/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:45:12,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:45:12,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:45:12,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:45:12,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:45:12,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:45:12,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:45:12,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:45:12,942 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:45:12,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:45:12,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:45:12,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:45:12,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:45:12,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:45:12,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:45:12,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:45:12,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:45:12,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:45:12,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:45:12,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:45:12,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:45:12,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:45:12,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:45:12,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:45:12,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:45:12,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:45:12,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:45:12,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:45:12,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:45:12,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:45:12,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:45:12,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:45:12,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:45:12,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:45:12,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:45:12,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:45:12,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:45:12,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:45:12,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:45:12,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:45:12,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:45:12,971 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:45:12,992 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:45:12,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:45:12,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:45:12,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:45:12,995 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:45:12,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:45:12,996 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:45:12,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:45:12,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:45:12,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:45:12,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:45:12,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:45:12,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:45:12,998 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:45:12,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:45:12,998 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:45:12,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:45:12,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:45:12,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:45:12,999 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:45:13,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:45:13,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:45:13,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:45:13,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:45:13,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:45:13,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:45:13,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:45:13,001 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:45:13,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:45:13,001 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:45:13,002 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:45:13,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:45:13,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:45:13,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:45:13,301 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:45:13,301 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:45:13,302 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_power.oepc.i [2019-12-27 17:45:13,368 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c77d65a/97bc06e1378048d5a6996c9ff1cf2ae6/FLAG78bf888e8 [2019-12-27 17:45:13,953 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:45:13,954 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_power.oepc.i [2019-12-27 17:45:13,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c77d65a/97bc06e1378048d5a6996c9ff1cf2ae6/FLAG78bf888e8 [2019-12-27 17:45:14,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c77d65a/97bc06e1378048d5a6996c9ff1cf2ae6 [2019-12-27 17:45:14,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:45:14,246 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:45:14,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:45:14,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:45:14,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:45:14,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:45:14" (1/1) ... [2019-12-27 17:45:14,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ede25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:14, skipping insertion in model container [2019-12-27 17:45:14,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:45:14" (1/1) ... [2019-12-27 17:45:14,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:45:14,331 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:45:14,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:45:14,887 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:45:14,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:45:15,025 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:45:15,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:15 WrapperNode [2019-12-27 17:45:15,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:45:15,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:45:15,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:45:15,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:45:15,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:15" (1/1) ... [2019-12-27 17:45:15,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:15" (1/1) ... [2019-12-27 17:45:15,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:45:15,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:45:15,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:45:15,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:45:15,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:15" (1/1) ... [2019-12-27 17:45:15,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:15" (1/1) ... [2019-12-27 17:45:15,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:15" (1/1) ... [2019-12-27 17:45:15,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:15" (1/1) ... [2019-12-27 17:45:15,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:15" (1/1) ... [2019-12-27 17:45:15,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:15" (1/1) ... [2019-12-27 17:45:15,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:15" (1/1) ... [2019-12-27 17:45:15,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:45:15,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:45:15,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:45:15,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:45:15,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:45:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:45:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:45:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:45:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:45:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:45:15,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:45:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:45:15,204 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:45:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:45:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:45:15,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:45:15,207 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:45:15,853 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:45:15,853 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:45:15,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:45:15 BoogieIcfgContainer [2019-12-27 17:45:15,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:45:15,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:45:15,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:45:15,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:45:15,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:45:14" (1/3) ... [2019-12-27 17:45:15,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37605c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:45:15, skipping insertion in model container [2019-12-27 17:45:15,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:45:15" (2/3) ... [2019-12-27 17:45:15,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37605c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:45:15, skipping insertion in model container [2019-12-27 17:45:15,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:45:15" (3/3) ... [2019-12-27 17:45:15,867 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_power.oepc.i [2019-12-27 17:45:15,878 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:45:15,879 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:45:15,894 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:45:15,895 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:45:15,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,955 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,955 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,987 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,987 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,987 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,988 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,988 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:15,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,013 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,022 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,023 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,024 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:45:16,049 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:45:16,071 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:45:16,071 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:45:16,072 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:45:16,072 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:45:16,072 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:45:16,072 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:45:16,072 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:45:16,072 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:45:16,092 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-27 17:45:16,094 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 17:45:16,195 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 17:45:16,195 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:45:16,210 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 17:45:16,229 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-27 17:45:16,273 INFO L132 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-27 17:45:16,273 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:45:16,280 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/126 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 17:45:16,295 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 17:45:16,296 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:45:20,725 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 17:45:20,841 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 17:45:20,895 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39043 [2019-12-27 17:45:20,896 INFO L214 etLargeBlockEncoding]: Total number of compositions: 99 [2019-12-27 17:45:20,899 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-27 17:45:21,248 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6812 states. [2019-12-27 17:45:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states. [2019-12-27 17:45:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:45:21,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:21,257 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:45:21,258 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:21,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:21,264 INFO L82 PathProgramCache]: Analyzing trace with hash 679696961, now seen corresponding path program 1 times [2019-12-27 17:45:21,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:21,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553083088] [2019-12-27 17:45:21,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:45:21,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553083088] [2019-12-27 17:45:21,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:21,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:45:21,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [55230826] [2019-12-27 17:45:21,582 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:21,588 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:21,603 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:45:21,603 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:21,607 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:45:21,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:45:21,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:21,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:45:21,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:45:21,626 INFO L87 Difference]: Start difference. First operand 6812 states. Second operand 3 states. [2019-12-27 17:45:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:21,814 INFO L93 Difference]: Finished difference Result 6636 states and 22229 transitions. [2019-12-27 17:45:21,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:45:21,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:45:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:21,896 INFO L225 Difference]: With dead ends: 6636 [2019-12-27 17:45:21,897 INFO L226 Difference]: Without dead ends: 6246 [2019-12-27 17:45:21,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:45:21,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6246 states. [2019-12-27 17:45:22,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6246 to 6246. [2019-12-27 17:45:22,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6246 states. [2019-12-27 17:45:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6246 states to 6246 states and 20886 transitions. [2019-12-27 17:45:22,236 INFO L78 Accepts]: Start accepts. Automaton has 6246 states and 20886 transitions. Word has length 5 [2019-12-27 17:45:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:22,237 INFO L462 AbstractCegarLoop]: Abstraction has 6246 states and 20886 transitions. [2019-12-27 17:45:22,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:45:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 6246 states and 20886 transitions. [2019-12-27 17:45:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:45:22,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:22,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:22,242 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:22,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:22,242 INFO L82 PathProgramCache]: Analyzing trace with hash -113641298, now seen corresponding path program 1 times [2019-12-27 17:45:22,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:22,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445923112] [2019-12-27 17:45:22,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:45:22,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445923112] [2019-12-27 17:45:22,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:22,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:45:22,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2037776338] [2019-12-27 17:45:22,329 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:22,330 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:22,333 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:45:22,333 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:22,333 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:45:22,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:45:22,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:22,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:45:22,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:45:22,336 INFO L87 Difference]: Start difference. First operand 6246 states and 20886 transitions. Second operand 4 states. [2019-12-27 17:45:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:22,700 INFO L93 Difference]: Finished difference Result 9424 states and 30254 transitions. [2019-12-27 17:45:22,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:45:22,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:45:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:22,770 INFO L225 Difference]: With dead ends: 9424 [2019-12-27 17:45:22,771 INFO L226 Difference]: Without dead ends: 9411 [2019-12-27 17:45:22,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:45:22,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9411 states. [2019-12-27 17:45:23,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9411 to 8307. [2019-12-27 17:45:23,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8307 states. [2019-12-27 17:45:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8307 states to 8307 states and 27132 transitions. [2019-12-27 17:45:23,080 INFO L78 Accepts]: Start accepts. Automaton has 8307 states and 27132 transitions. Word has length 11 [2019-12-27 17:45:23,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:23,081 INFO L462 AbstractCegarLoop]: Abstraction has 8307 states and 27132 transitions. [2019-12-27 17:45:23,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:45:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 8307 states and 27132 transitions. [2019-12-27 17:45:23,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:45:23,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:23,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:23,086 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:23,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:23,086 INFO L82 PathProgramCache]: Analyzing trace with hash 711580898, now seen corresponding path program 1 times [2019-12-27 17:45:23,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:23,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190992272] [2019-12-27 17:45:23,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:23,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:45:23,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190992272] [2019-12-27 17:45:23,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:23,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:45:23,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2078900742] [2019-12-27 17:45:23,148 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:23,150 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:23,157 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 17:45:23,157 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:23,221 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:45:23,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:45:23,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:23,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:45:23,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:45:23,222 INFO L87 Difference]: Start difference. First operand 8307 states and 27132 transitions. Second operand 5 states. [2019-12-27 17:45:23,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:23,363 INFO L93 Difference]: Finished difference Result 11392 states and 37048 transitions. [2019-12-27 17:45:23,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:45:23,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 17:45:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:23,404 INFO L225 Difference]: With dead ends: 11392 [2019-12-27 17:45:23,404 INFO L226 Difference]: Without dead ends: 11392 [2019-12-27 17:45:23,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:45:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11392 states. [2019-12-27 17:45:24,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11392 to 10440. [2019-12-27 17:45:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10440 states. [2019-12-27 17:45:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10440 states to 10440 states and 34208 transitions. [2019-12-27 17:45:24,296 INFO L78 Accepts]: Start accepts. Automaton has 10440 states and 34208 transitions. Word has length 14 [2019-12-27 17:45:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:24,297 INFO L462 AbstractCegarLoop]: Abstraction has 10440 states and 34208 transitions. [2019-12-27 17:45:24,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:45:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 10440 states and 34208 transitions. [2019-12-27 17:45:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:45:24,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:24,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:24,301 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:24,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:24,301 INFO L82 PathProgramCache]: Analyzing trace with hash 798779155, now seen corresponding path program 1 times [2019-12-27 17:45:24,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:24,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186957002] [2019-12-27 17:45:24,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:45:24,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186957002] [2019-12-27 17:45:24,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:24,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:45:24,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1255046674] [2019-12-27 17:45:24,363 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:24,366 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:24,370 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 17:45:24,370 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:24,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:45:24,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:45:24,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:24,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:45:24,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:45:24,387 INFO L87 Difference]: Start difference. First operand 10440 states and 34208 transitions. Second operand 5 states. [2019-12-27 17:45:24,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:24,648 INFO L93 Difference]: Finished difference Result 12648 states and 40515 transitions. [2019-12-27 17:45:24,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:45:24,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 17:45:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:24,680 INFO L225 Difference]: With dead ends: 12648 [2019-12-27 17:45:24,680 INFO L226 Difference]: Without dead ends: 12637 [2019-12-27 17:45:24,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:45:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12637 states. [2019-12-27 17:45:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12637 to 11272. [2019-12-27 17:45:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11272 states. [2019-12-27 17:45:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11272 states to 11272 states and 36643 transitions. [2019-12-27 17:45:25,115 INFO L78 Accepts]: Start accepts. Automaton has 11272 states and 36643 transitions. Word has length 14 [2019-12-27 17:45:25,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:25,116 INFO L462 AbstractCegarLoop]: Abstraction has 11272 states and 36643 transitions. [2019-12-27 17:45:25,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:45:25,116 INFO L276 IsEmpty]: Start isEmpty. Operand 11272 states and 36643 transitions. [2019-12-27 17:45:25,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:45:25,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:25,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:25,125 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:25,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:25,126 INFO L82 PathProgramCache]: Analyzing trace with hash -564373810, now seen corresponding path program 1 times [2019-12-27 17:45:25,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:25,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142355163] [2019-12-27 17:45:25,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:45:25,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142355163] [2019-12-27 17:45:25,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:25,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:45:25,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [728571910] [2019-12-27 17:45:25,175 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:25,177 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:25,180 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 17:45:25,180 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:25,198 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:45:25,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:45:25,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:25,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:45:25,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:45:25,199 INFO L87 Difference]: Start difference. First operand 11272 states and 36643 transitions. Second operand 5 states. [2019-12-27 17:45:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:25,426 INFO L93 Difference]: Finished difference Result 13620 states and 43661 transitions. [2019-12-27 17:45:25,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:45:25,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 17:45:25,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:25,459 INFO L225 Difference]: With dead ends: 13620 [2019-12-27 17:45:25,459 INFO L226 Difference]: Without dead ends: 13607 [2019-12-27 17:45:25,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:45:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13607 states. [2019-12-27 17:45:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13607 to 11607. [2019-12-27 17:45:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11607 states. [2019-12-27 17:45:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11607 states to 11607 states and 37707 transitions. [2019-12-27 17:45:25,957 INFO L78 Accepts]: Start accepts. Automaton has 11607 states and 37707 transitions. Word has length 14 [2019-12-27 17:45:25,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:25,957 INFO L462 AbstractCegarLoop]: Abstraction has 11607 states and 37707 transitions. [2019-12-27 17:45:25,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:45:25,958 INFO L276 IsEmpty]: Start isEmpty. Operand 11607 states and 37707 transitions. [2019-12-27 17:45:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:45:25,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:25,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:25,964 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:25,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:25,964 INFO L82 PathProgramCache]: Analyzing trace with hash 833908596, now seen corresponding path program 1 times [2019-12-27 17:45:25,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:25,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815896097] [2019-12-27 17:45:25,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:45:26,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815896097] [2019-12-27 17:45:26,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:26,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:45:26,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [675682718] [2019-12-27 17:45:26,033 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:26,037 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:26,039 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 18 transitions. [2019-12-27 17:45:26,039 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:26,040 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:45:26,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:45:26,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:26,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:45:26,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:45:26,041 INFO L87 Difference]: Start difference. First operand 11607 states and 37707 transitions. Second operand 3 states. [2019-12-27 17:45:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:26,090 INFO L93 Difference]: Finished difference Result 11464 states and 37241 transitions. [2019-12-27 17:45:26,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:45:26,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 17:45:26,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:26,115 INFO L225 Difference]: With dead ends: 11464 [2019-12-27 17:45:26,116 INFO L226 Difference]: Without dead ends: 11464 [2019-12-27 17:45:26,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:45:26,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11464 states. [2019-12-27 17:45:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11464 to 11464. [2019-12-27 17:45:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11464 states. [2019-12-27 17:45:26,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11464 states to 11464 states and 37241 transitions. [2019-12-27 17:45:26,424 INFO L78 Accepts]: Start accepts. Automaton has 11464 states and 37241 transitions. Word has length 16 [2019-12-27 17:45:26,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:26,424 INFO L462 AbstractCegarLoop]: Abstraction has 11464 states and 37241 transitions. [2019-12-27 17:45:26,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:45:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand 11464 states and 37241 transitions. [2019-12-27 17:45:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:45:26,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:26,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:26,431 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:26,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:26,431 INFO L82 PathProgramCache]: Analyzing trace with hash 89165451, now seen corresponding path program 1 times [2019-12-27 17:45:26,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:26,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078570340] [2019-12-27 17:45:26,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:45:26,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078570340] [2019-12-27 17:45:26,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:26,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:45:26,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [257153155] [2019-12-27 17:45:26,531 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:26,533 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:26,537 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 23 transitions. [2019-12-27 17:45:26,538 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:26,538 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:45:26,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:45:26,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:26,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:45:26,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:45:26,539 INFO L87 Difference]: Start difference. First operand 11464 states and 37241 transitions. Second operand 3 states. [2019-12-27 17:45:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:26,604 INFO L93 Difference]: Finished difference Result 10861 states and 34721 transitions. [2019-12-27 17:45:26,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:45:26,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 17:45:26,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:26,626 INFO L225 Difference]: With dead ends: 10861 [2019-12-27 17:45:26,626 INFO L226 Difference]: Without dead ends: 10861 [2019-12-27 17:45:26,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:45:26,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2019-12-27 17:45:27,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10663. [2019-12-27 17:45:27,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10663 states. [2019-12-27 17:45:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10663 states to 10663 states and 34123 transitions. [2019-12-27 17:45:27,497 INFO L78 Accepts]: Start accepts. Automaton has 10663 states and 34123 transitions. Word has length 17 [2019-12-27 17:45:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:27,497 INFO L462 AbstractCegarLoop]: Abstraction has 10663 states and 34123 transitions. [2019-12-27 17:45:27,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:45:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 10663 states and 34123 transitions. [2019-12-27 17:45:27,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 17:45:27,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:27,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:27,506 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:27,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:27,507 INFO L82 PathProgramCache]: Analyzing trace with hash -832349724, now seen corresponding path program 1 times [2019-12-27 17:45:27,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:27,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442622812] [2019-12-27 17:45:27,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:45:27,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442622812] [2019-12-27 17:45:27,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:27,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:45:27,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [816462664] [2019-12-27 17:45:27,640 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:27,643 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:27,646 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 17:45:27,647 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:27,649 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:45:27,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:45:27,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:27,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:45:27,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:45:27,650 INFO L87 Difference]: Start difference. First operand 10663 states and 34123 transitions. Second operand 4 states. [2019-12-27 17:45:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:27,686 INFO L93 Difference]: Finished difference Result 2208 states and 5787 transitions. [2019-12-27 17:45:27,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:45:27,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 17:45:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:27,690 INFO L225 Difference]: With dead ends: 2208 [2019-12-27 17:45:27,690 INFO L226 Difference]: Without dead ends: 1576 [2019-12-27 17:45:27,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:45:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-12-27 17:45:27,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-12-27 17:45:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-12-27 17:45:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 3757 transitions. [2019-12-27 17:45:27,716 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 3757 transitions. Word has length 18 [2019-12-27 17:45:27,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:27,716 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 3757 transitions. [2019-12-27 17:45:27,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:45:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 3757 transitions. [2019-12-27 17:45:27,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 17:45:27,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:27,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:27,719 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:27,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:27,719 INFO L82 PathProgramCache]: Analyzing trace with hash -375021524, now seen corresponding path program 1 times [2019-12-27 17:45:27,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:27,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768809490] [2019-12-27 17:45:27,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:27,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:45:27,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768809490] [2019-12-27 17:45:27,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:27,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:45:27,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [490911520] [2019-12-27 17:45:27,822 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:27,826 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:27,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 17:45:27,838 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:27,857 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:45:27,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:45:27,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:27,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:45:27,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:45:27,858 INFO L87 Difference]: Start difference. First operand 1576 states and 3757 transitions. Second operand 6 states. [2019-12-27 17:45:28,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:28,134 INFO L93 Difference]: Finished difference Result 2187 states and 5165 transitions. [2019-12-27 17:45:28,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:45:28,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 17:45:28,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:28,139 INFO L225 Difference]: With dead ends: 2187 [2019-12-27 17:45:28,139 INFO L226 Difference]: Without dead ends: 2185 [2019-12-27 17:45:28,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:45:28,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2019-12-27 17:45:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 1686. [2019-12-27 17:45:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2019-12-27 17:45:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 4016 transitions. [2019-12-27 17:45:28,165 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 4016 transitions. Word has length 26 [2019-12-27 17:45:28,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:28,165 INFO L462 AbstractCegarLoop]: Abstraction has 1686 states and 4016 transitions. [2019-12-27 17:45:28,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:45:28,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 4016 transitions. [2019-12-27 17:45:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:45:28,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:28,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:28,169 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:28,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:28,169 INFO L82 PathProgramCache]: Analyzing trace with hash 427469221, now seen corresponding path program 1 times [2019-12-27 17:45:28,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:28,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897642324] [2019-12-27 17:45:28,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:45:28,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897642324] [2019-12-27 17:45:28,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:28,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:45:28,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [235531840] [2019-12-27 17:45:28,234 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:28,240 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:28,257 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 91 transitions. [2019-12-27 17:45:28,257 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:28,274 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:45:28,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:45:28,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:28,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:45:28,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:45:28,276 INFO L87 Difference]: Start difference. First operand 1686 states and 4016 transitions. Second operand 6 states. [2019-12-27 17:45:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:28,523 INFO L93 Difference]: Finished difference Result 2156 states and 5083 transitions. [2019-12-27 17:45:28,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:45:28,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:45:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:28,526 INFO L225 Difference]: With dead ends: 2156 [2019-12-27 17:45:28,527 INFO L226 Difference]: Without dead ends: 2154 [2019-12-27 17:45:28,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:45:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2019-12-27 17:45:28,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1596. [2019-12-27 17:45:28,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2019-12-27 17:45:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 3807 transitions. [2019-12-27 17:45:28,556 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 3807 transitions. Word has length 27 [2019-12-27 17:45:28,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:28,556 INFO L462 AbstractCegarLoop]: Abstraction has 1596 states and 3807 transitions. [2019-12-27 17:45:28,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:45:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 3807 transitions. [2019-12-27 17:45:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:45:28,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:28,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:28,559 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:28,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:28,559 INFO L82 PathProgramCache]: Analyzing trace with hash 225506980, now seen corresponding path program 1 times [2019-12-27 17:45:28,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:28,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346481011] [2019-12-27 17:45:28,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:45:28,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346481011] [2019-12-27 17:45:28,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:28,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:45:28,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1930051012] [2019-12-27 17:45:28,653 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:28,658 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:28,665 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:45:28,665 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:28,665 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:45:28,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:45:28,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:28,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:45:28,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:45:28,667 INFO L87 Difference]: Start difference. First operand 1596 states and 3807 transitions. Second operand 5 states. [2019-12-27 17:45:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:28,717 INFO L93 Difference]: Finished difference Result 791 states and 1818 transitions. [2019-12-27 17:45:28,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:45:28,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 17:45:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:28,719 INFO L225 Difference]: With dead ends: 791 [2019-12-27 17:45:28,719 INFO L226 Difference]: Without dead ends: 716 [2019-12-27 17:45:28,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:45:28,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-12-27 17:45:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2019-12-27 17:45:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-12-27 17:45:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1637 transitions. [2019-12-27 17:45:28,729 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1637 transitions. Word has length 27 [2019-12-27 17:45:28,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:28,730 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 1637 transitions. [2019-12-27 17:45:28,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:45:28,730 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1637 transitions. [2019-12-27 17:45:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 17:45:28,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:28,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:28,732 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:28,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:28,733 INFO L82 PathProgramCache]: Analyzing trace with hash 394366268, now seen corresponding path program 1 times [2019-12-27 17:45:28,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:28,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123770962] [2019-12-27 17:45:28,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:45:28,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123770962] [2019-12-27 17:45:28,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:28,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:45:28,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1417196817] [2019-12-27 17:45:28,801 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:28,875 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:28,914 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 132 transitions. [2019-12-27 17:45:28,914 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:28,916 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:45:28,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:45:28,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:28,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:45:28,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:45:28,917 INFO L87 Difference]: Start difference. First operand 716 states and 1637 transitions. Second operand 6 states. [2019-12-27 17:45:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:29,133 INFO L93 Difference]: Finished difference Result 1836 states and 4152 transitions. [2019-12-27 17:45:29,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:45:29,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 17:45:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:29,136 INFO L225 Difference]: With dead ends: 1836 [2019-12-27 17:45:29,136 INFO L226 Difference]: Without dead ends: 1248 [2019-12-27 17:45:29,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:45:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-27 17:45:29,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 788. [2019-12-27 17:45:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-12-27 17:45:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1805 transitions. [2019-12-27 17:45:29,146 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1805 transitions. Word has length 42 [2019-12-27 17:45:29,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:29,147 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1805 transitions. [2019-12-27 17:45:29,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:45:29,147 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1805 transitions. [2019-12-27 17:45:29,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 17:45:29,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:29,150 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:29,150 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:29,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:29,150 INFO L82 PathProgramCache]: Analyzing trace with hash -186633826, now seen corresponding path program 2 times [2019-12-27 17:45:29,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:29,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343029343] [2019-12-27 17:45:29,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:45:29,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343029343] [2019-12-27 17:45:29,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:29,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:45:29,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1211199469] [2019-12-27 17:45:29,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:29,264 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:29,303 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 132 transitions. [2019-12-27 17:45:29,303 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:29,305 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:45:29,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:45:29,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:29,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:45:29,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:45:29,306 INFO L87 Difference]: Start difference. First operand 788 states and 1805 transitions. Second operand 4 states. [2019-12-27 17:45:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:29,324 INFO L93 Difference]: Finished difference Result 1266 states and 2914 transitions. [2019-12-27 17:45:29,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:45:29,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 17:45:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:29,327 INFO L225 Difference]: With dead ends: 1266 [2019-12-27 17:45:29,328 INFO L226 Difference]: Without dead ends: 498 [2019-12-27 17:45:29,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:45:29,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-12-27 17:45:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2019-12-27 17:45:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-12-27 17:45:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1142 transitions. [2019-12-27 17:45:29,337 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1142 transitions. Word has length 42 [2019-12-27 17:45:29,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:29,337 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 1142 transitions. [2019-12-27 17:45:29,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:45:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1142 transitions. [2019-12-27 17:45:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 17:45:29,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:29,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:29,339 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:29,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:29,339 INFO L82 PathProgramCache]: Analyzing trace with hash 380081836, now seen corresponding path program 3 times [2019-12-27 17:45:29,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:29,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458175910] [2019-12-27 17:45:29,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:45:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:45:29,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458175910] [2019-12-27 17:45:29,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:45:29,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:45:29,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [203455665] [2019-12-27 17:45:29,446 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:45:29,459 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:45:29,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 94 transitions. [2019-12-27 17:45:29,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:45:29,517 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:45:29,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:45:29,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:45:29,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:45:29,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:45:29,518 INFO L87 Difference]: Start difference. First operand 498 states and 1142 transitions. Second operand 7 states. [2019-12-27 17:45:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:45:29,689 INFO L93 Difference]: Finished difference Result 866 states and 1944 transitions. [2019-12-27 17:45:29,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:45:29,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 17:45:29,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:45:29,691 INFO L225 Difference]: With dead ends: 866 [2019-12-27 17:45:29,691 INFO L226 Difference]: Without dead ends: 580 [2019-12-27 17:45:29,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:45:29,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-12-27 17:45:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 514. [2019-12-27 17:45:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-12-27 17:45:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1172 transitions. [2019-12-27 17:45:29,702 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1172 transitions. Word has length 42 [2019-12-27 17:45:29,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:45:29,702 INFO L462 AbstractCegarLoop]: Abstraction has 514 states and 1172 transitions. [2019-12-27 17:45:29,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:45:29,703 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1172 transitions. [2019-12-27 17:45:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 17:45:29,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:45:29,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:45:29,704 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:45:29,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:45:29,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1605159892, now seen corresponding path program 4 times [2019-12-27 17:45:29,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:45:29,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915020939] [2019-12-27 17:45:29,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:45:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:45:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:45:29,869 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:45:29,869 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:45:29,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1649~0.base_19|) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$w_buff0~0_571) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1649~0.base_19|)) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= 0 |v_ULTIMATE.start_main_~#t1649~0.offset_17|) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1649~0.base_19| 1) |v_#valid_38|) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= 0 v_~y$r_buff1_thd2~0_86) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1649~0.base_19| 4)) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= v_~y$r_buff0_thd0~0_127 0) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1649~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1649~0.base_19|) |v_ULTIMATE.start_main_~#t1649~0.offset_17| 0)) |v_#memory_int_11|) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~x~0_36 0) (= v_~y$w_buff1~0_385 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_794, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, ULTIMATE.start_main_~#t1650~0.offset=|v_ULTIMATE.start_main_~#t1650~0.offset_17|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ~y~0=v_~y~0_145, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_~#t1649~0.offset=|v_ULTIMATE.start_main_~#t1649~0.offset_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, ULTIMATE.start_main_~#t1649~0.base=|v_ULTIMATE.start_main_~#t1649~0.base_19|, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ULTIMATE.start_main_~#t1650~0.base=|v_ULTIMATE.start_main_~#t1650~0.base_22|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1650~0.offset, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1649~0.offset, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t1649~0.base, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1650~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:45:29,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1650~0.base_9| 4)) (not (= |v_ULTIMATE.start_main_~#t1650~0.base_9| 0)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1650~0.base_9|) 0) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1650~0.base_9| 1)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1650~0.base_9|) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1650~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1650~0.base_9|) |v_ULTIMATE.start_main_~#t1650~0.offset_8| 1)) |v_#memory_int_7|) (= |v_ULTIMATE.start_main_~#t1650~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1650~0.offset=|v_ULTIMATE.start_main_~#t1650~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1650~0.base=|v_ULTIMATE.start_main_~#t1650~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1650~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1650~0.base] because there is no mapped edge [2019-12-27 17:45:29,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76 0)) (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 17:45:29,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1040302 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1040302 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out1040302| ~y$w_buff0_used~0_In1040302)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out1040302| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1040302, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1040302} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1040302, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1040302, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1040302|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 17:45:29,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1285490799 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1285490799 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1285490799 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1285490799 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1285490799|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1285490799 |P1Thread1of1ForFork0_#t~ite29_Out1285490799|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1285490799, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1285490799, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1285490799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1285490799} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1285490799, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1285490799, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1285490799, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1285490799|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1285490799} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 17:45:29,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1038795719 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1038795719 256) 0))) (or (and (= ~y$r_buff0_thd2~0_Out-1038795719 ~y$r_buff0_thd2~0_In-1038795719) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd2~0_Out-1038795719 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1038795719, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1038795719} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1038795719, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1038795719|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1038795719} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 17:45:29,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-579400084 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-579400084 256) 0))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-579400084 256))) (= 0 (mod ~y$w_buff0_used~0_In-579400084 256)) (and .cse0 (= (mod ~y$w_buff1_used~0_In-579400084 256) 0)))) .cse1 (= ~y$w_buff1_used~0_In-579400084 |P0Thread1of1ForFork1_#t~ite17_Out-579400084|) (= |P0Thread1of1ForFork1_#t~ite17_Out-579400084| |P0Thread1of1ForFork1_#t~ite18_Out-579400084|)) (and (= ~y$w_buff1_used~0_In-579400084 |P0Thread1of1ForFork1_#t~ite18_Out-579400084|) (= |P0Thread1of1ForFork1_#t~ite17_In-579400084| |P0Thread1of1ForFork1_#t~ite17_Out-579400084|) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-579400084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-579400084, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-579400084, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In-579400084|, ~weak$$choice2~0=~weak$$choice2~0_In-579400084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-579400084} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-579400084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-579400084, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-579400084, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out-579400084|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out-579400084|, ~weak$$choice2~0=~weak$$choice2~0_In-579400084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-579400084} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 17:45:29,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_14|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_15|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:45:29,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_11|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 17:45:29,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1038493106 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1038493106 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1038493106 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1038493106 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out1038493106| ~y$r_buff1_thd2~0_In1038493106)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out1038493106| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1038493106, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1038493106, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1038493106, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1038493106} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1038493106, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1038493106, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1038493106|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1038493106, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1038493106} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 17:45:29,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_34| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 17:45:29,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:45:29,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1481709538 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1481709538 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1481709538| ~y~0_In-1481709538)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1481709538| ~y$w_buff1~0_In-1481709538)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1481709538, ~y~0=~y~0_In-1481709538, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1481709538, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1481709538} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1481709538, ~y~0=~y~0_In-1481709538, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1481709538, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1481709538|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1481709538} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 17:45:29,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 17:45:29,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2055948488 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2055948488 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-2055948488| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-2055948488| ~y$w_buff0_used~0_In-2055948488)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2055948488, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2055948488} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2055948488, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2055948488, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-2055948488|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 17:45:29,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-666406512 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-666406512 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-666406512 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-666406512 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite37_Out-666406512| ~y$w_buff1_used~0_In-666406512)) (and (= |ULTIMATE.start_main_#t~ite37_Out-666406512| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-666406512, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-666406512, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-666406512, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-666406512} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-666406512, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-666406512, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-666406512|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-666406512, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-666406512} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 17:45:29,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In693516674 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In693516674 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out693516674| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out693516674| ~y$r_buff0_thd0~0_In693516674) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In693516674, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In693516674} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In693516674, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In693516674, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out693516674|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 17:45:29,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-999665473 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-999665473 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-999665473 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-999665473 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-999665473 |ULTIMATE.start_main_#t~ite39_Out-999665473|)) (and (= |ULTIMATE.start_main_#t~ite39_Out-999665473| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-999665473, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-999665473, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-999665473, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-999665473} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-999665473, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-999665473|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-999665473, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-999665473, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-999665473} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 17:45:29,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_15 0) (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:45:29,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:45:29 BasicIcfg [2019-12-27 17:45:29,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:45:29,958 INFO L168 Benchmark]: Toolchain (without parser) took 15711.87 ms. Allocated memory was 137.9 MB in the beginning and 746.6 MB in the end (delta: 608.7 MB). Free memory was 100.9 MB in the beginning and 332.5 MB in the end (delta: -231.6 MB). Peak memory consumption was 377.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:29,958 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 17:45:29,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.63 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 156.9 MB in the end (delta: -56.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:29,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.99 ms. Allocated memory is still 201.9 MB. Free memory was 156.9 MB in the beginning and 154.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:29,961 INFO L168 Benchmark]: Boogie Preprocessor took 36.15 ms. Allocated memory is still 201.9 MB. Free memory was 154.2 MB in the beginning and 152.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:29,961 INFO L168 Benchmark]: RCFGBuilder took 731.31 ms. Allocated memory is still 201.9 MB. Free memory was 152.1 MB in the beginning and 110.8 MB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:29,962 INFO L168 Benchmark]: TraceAbstraction took 14099.02 ms. Allocated memory was 201.9 MB in the beginning and 746.6 MB in the end (delta: 544.7 MB). Free memory was 110.2 MB in the beginning and 332.5 MB in the end (delta: -222.4 MB). Peak memory consumption was 322.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:45:29,966 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.63 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.7 MB in the beginning and 156.9 MB in the end (delta: -56.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.99 ms. Allocated memory is still 201.9 MB. Free memory was 156.9 MB in the beginning and 154.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.15 ms. Allocated memory is still 201.9 MB. Free memory was 154.2 MB in the beginning and 152.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 731.31 ms. Allocated memory is still 201.9 MB. Free memory was 152.1 MB in the beginning and 110.8 MB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14099.02 ms. Allocated memory was 201.9 MB in the beginning and 746.6 MB in the end (delta: 544.7 MB). Free memory was 110.2 MB in the beginning and 332.5 MB in the end (delta: -222.4 MB). Peak memory consumption was 322.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 20 ChoiceCompositions, 4326 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 84 SemBasedMoverChecksPositive, 180 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 39043 CheckedPairsTotal, 99 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1597 SDtfs, 1466 SDslu, 3140 SDs, 0 SdLazy, 1141 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11607occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 7202 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 301 ConstructedInterpolants, 0 QuantifiedInterpolants, 23203 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...