/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:38:35,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:38:35,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:38:35,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:38:35,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:38:35,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:38:35,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:38:35,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:38:35,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:38:35,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:38:35,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:38:35,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:38:35,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:38:35,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:38:35,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:38:35,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:38:35,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:38:35,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:38:35,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:38:35,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:38:35,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:38:35,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:38:35,304 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:38:35,305 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:38:35,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:38:35,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:38:35,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:38:35,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:38:35,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:38:35,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:38:35,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:38:35,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:38:35,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:38:35,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:38:35,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:38:35,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:38:35,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:38:35,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:38:35,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:38:35,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:38:35,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:38:35,331 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:38:35,350 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:38:35,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:38:35,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:38:35,353 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:38:35,353 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:38:35,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:38:35,353 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:38:35,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:38:35,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:38:35,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:38:35,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:38:35,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:38:35,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:38:35,356 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:38:35,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:38:35,356 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:38:35,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:38:35,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:38:35,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:38:35,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:38:35,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:38:35,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:38:35,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:38:35,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:38:35,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:38:35,359 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:38:35,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:38:35,359 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:38:35,359 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:38:35,359 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:38:35,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:38:35,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:38:35,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:38:35,717 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:38:35,718 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:38:35,719 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_pso.opt.i [2019-12-26 22:38:35,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a05fb67c/75aeb1896f5c4507acf9128bc26a644a/FLAG5fc057b50 [2019-12-26 22:38:36,345 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:38:36,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_pso.opt.i [2019-12-26 22:38:36,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a05fb67c/75aeb1896f5c4507acf9128bc26a644a/FLAG5fc057b50 [2019-12-26 22:38:36,625 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a05fb67c/75aeb1896f5c4507acf9128bc26a644a [2019-12-26 22:38:36,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:38:36,642 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:38:36,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:38:36,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:38:36,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:38:36,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:38:36" (1/1) ... [2019-12-26 22:38:36,651 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 26.12 10:38:36, skipping insertion in model container [2019-12-26 22:38:36,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:38:36" (1/1) ... [2019-12-26 22:38:36,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:38:36,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:38:37,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:38:37,286 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:38:37,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:38:37,448 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:38:37,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:38:37 WrapperNode [2019-12-26 22:38:37,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:38:37,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:38:37,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:38:37,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:38:37,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:38:37" (1/1) ... [2019-12-26 22:38:37,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:38:37" (1/1) ... [2019-12-26 22:38:37,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:38:37,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:38:37,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:38:37,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:38:37,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:38:37" (1/1) ... [2019-12-26 22:38:37,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:38:37" (1/1) ... [2019-12-26 22:38:37,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:38:37" (1/1) ... [2019-12-26 22:38:37,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:38:37" (1/1) ... [2019-12-26 22:38:37,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:38:37" (1/1) ... [2019-12-26 22:38:37,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:38:37" (1/1) ... [2019-12-26 22:38:37,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:38:37" (1/1) ... [2019-12-26 22:38:37,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:38:37,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:38:37,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:38:37,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:38:37,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:38:37" (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-26 22:38:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:38:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:38:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:38:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:38:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:38:37,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:38:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:38:37,639 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:38:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:38:37,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:38:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:38:37,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:38:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:38:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:38:37,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:38:37,642 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:38:38,445 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:38:38,445 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:38:38,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:38:38 BoogieIcfgContainer [2019-12-26 22:38:38,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:38:38,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:38:38,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:38:38,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:38:38,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:38:36" (1/3) ... [2019-12-26 22:38:38,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ba108f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:38:38, skipping insertion in model container [2019-12-26 22:38:38,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:38:37" (2/3) ... [2019-12-26 22:38:38,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ba108f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:38:38, skipping insertion in model container [2019-12-26 22:38:38,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:38:38" (3/3) ... [2019-12-26 22:38:38,456 INFO L109 eAbstractionObserver]: Analyzing ICFG mix044_pso.opt.i [2019-12-26 22:38:38,465 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:38:38,465 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:38:38,472 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:38:38,473 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:38:38,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,513 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,515 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,515 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,517 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,517 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,525 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,525 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,525 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,526 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,526 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,526 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,526 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,527 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,527 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,527 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,528 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,528 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,528 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,528 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,529 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,529 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,529 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,529 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,530 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,530 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,530 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,530 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,531 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,531 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,531 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,531 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,538 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,538 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,541 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,542 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,546 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,547 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,566 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,566 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,567 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,567 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,567 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,567 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,568 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:38:38,582 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:38:38,598 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:38:38,598 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:38:38,599 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:38:38,599 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:38:38,599 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:38:38,599 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:38:38,599 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:38:38,599 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:38:38,617 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-26 22:38:38,619 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-26 22:38:38,733 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-26 22:38:38,734 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:38:38,749 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:38:38,773 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-26 22:38:38,826 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-26 22:38:38,826 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:38:38,833 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:38:38,851 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-26 22:38:38,853 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:38:44,147 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-26 22:38:44,305 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-26 22:38:44,328 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52490 [2019-12-26 22:38:44,329 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-26 22:38:44,332 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-26 22:38:47,169 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 37086 states. [2019-12-26 22:38:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 37086 states. [2019-12-26 22:38:47,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 22:38:47,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:38:47,179 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:38:47,180 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:38:47,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:38:47,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1862617909, now seen corresponding path program 1 times [2019-12-26 22:38:47,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:38:47,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683509084] [2019-12-26 22:38:47,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:38:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:38:47,460 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-26 22:38:47,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683509084] [2019-12-26 22:38:47,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:38:47,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:38:47,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953349329] [2019-12-26 22:38:47,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:38:47,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:38:47,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:38:47,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:38:47,486 INFO L87 Difference]: Start difference. First operand 37086 states. Second operand 3 states. [2019-12-26 22:38:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:38:48,316 INFO L93 Difference]: Finished difference Result 36830 states and 157144 transitions. [2019-12-26 22:38:48,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:38:48,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 22:38:48,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:38:48,701 INFO L225 Difference]: With dead ends: 36830 [2019-12-26 22:38:48,701 INFO L226 Difference]: Without dead ends: 36102 [2019-12-26 22:38:48,702 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-26 22:38:49,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-26 22:38:51,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-26 22:38:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-26 22:38:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 154176 transitions. [2019-12-26 22:38:51,713 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 154176 transitions. Word has length 9 [2019-12-26 22:38:51,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:38:51,714 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 154176 transitions. [2019-12-26 22:38:51,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:38:51,716 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 154176 transitions. [2019-12-26 22:38:51,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:38:51,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:38:51,729 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:38:51,730 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:38:51,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:38:51,731 INFO L82 PathProgramCache]: Analyzing trace with hash 290643941, now seen corresponding path program 1 times [2019-12-26 22:38:51,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:38:51,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010728989] [2019-12-26 22:38:51,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:38:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:38:51,902 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-26 22:38:51,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010728989] [2019-12-26 22:38:51,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:38:51,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:38:51,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809948810] [2019-12-26 22:38:51,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:38:51,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:38:51,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:38:51,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:38:51,907 INFO L87 Difference]: Start difference. First operand 36102 states and 154176 transitions. Second operand 4 states. [2019-12-26 22:38:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:38:54,420 INFO L93 Difference]: Finished difference Result 56134 states and 231868 transitions. [2019-12-26 22:38:54,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:38:54,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:38:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:38:54,761 INFO L225 Difference]: With dead ends: 56134 [2019-12-26 22:38:54,762 INFO L226 Difference]: Without dead ends: 56106 [2019-12-26 22:38:54,763 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-26 22:38:55,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-26 22:38:56,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 51222. [2019-12-26 22:38:56,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51222 states. [2019-12-26 22:38:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51222 states to 51222 states and 213628 transitions. [2019-12-26 22:38:56,869 INFO L78 Accepts]: Start accepts. Automaton has 51222 states and 213628 transitions. Word has length 15 [2019-12-26 22:38:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:38:56,869 INFO L462 AbstractCegarLoop]: Abstraction has 51222 states and 213628 transitions. [2019-12-26 22:38:56,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:38:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 51222 states and 213628 transitions. [2019-12-26 22:38:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:38:56,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:38:56,872 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:38:56,872 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:38:56,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:38:56,873 INFO L82 PathProgramCache]: Analyzing trace with hash -497322091, now seen corresponding path program 1 times [2019-12-26 22:38:56,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:38:56,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803459507] [2019-12-26 22:38:56,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:38:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:38:56,938 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-26 22:38:56,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803459507] [2019-12-26 22:38:56,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:38:56,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:38:56,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070211630] [2019-12-26 22:38:56,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:38:56,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:38:56,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:38:56,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:38:56,944 INFO L87 Difference]: Start difference. First operand 51222 states and 213628 transitions. Second operand 3 states. [2019-12-26 22:38:57,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:38:57,115 INFO L93 Difference]: Finished difference Result 40168 states and 154828 transitions. [2019-12-26 22:38:57,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:38:57,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 22:38:57,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:38:59,368 INFO L225 Difference]: With dead ends: 40168 [2019-12-26 22:38:59,369 INFO L226 Difference]: Without dead ends: 40168 [2019-12-26 22:38:59,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-26 22:38:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40168 states. [2019-12-26 22:39:00,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40168 to 40168. [2019-12-26 22:39:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40168 states. [2019-12-26 22:39:00,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40168 states to 40168 states and 154828 transitions. [2019-12-26 22:39:00,530 INFO L78 Accepts]: Start accepts. Automaton has 40168 states and 154828 transitions. Word has length 15 [2019-12-26 22:39:00,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:00,531 INFO L462 AbstractCegarLoop]: Abstraction has 40168 states and 154828 transitions. [2019-12-26 22:39:00,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:39:00,531 INFO L276 IsEmpty]: Start isEmpty. Operand 40168 states and 154828 transitions. [2019-12-26 22:39:00,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:39:00,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:00,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:00,534 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:00,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:00,534 INFO L82 PathProgramCache]: Analyzing trace with hash -13987850, now seen corresponding path program 1 times [2019-12-26 22:39:00,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:00,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727386640] [2019-12-26 22:39:00,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:00,600 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-26 22:39:00,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727386640] [2019-12-26 22:39:00,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:00,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:39:00,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839191375] [2019-12-26 22:39:00,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:39:00,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:00,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:39:00,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:39:00,603 INFO L87 Difference]: Start difference. First operand 40168 states and 154828 transitions. Second operand 4 states. [2019-12-26 22:39:00,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:00,669 INFO L93 Difference]: Finished difference Result 16680 states and 53353 transitions. [2019-12-26 22:39:00,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:39:00,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:39:00,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:00,709 INFO L225 Difference]: With dead ends: 16680 [2019-12-26 22:39:00,709 INFO L226 Difference]: Without dead ends: 16680 [2019-12-26 22:39:00,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:39:00,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16680 states. [2019-12-26 22:39:01,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16680 to 16680. [2019-12-26 22:39:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16680 states. [2019-12-26 22:39:01,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 53353 transitions. [2019-12-26 22:39:01,113 INFO L78 Accepts]: Start accepts. Automaton has 16680 states and 53353 transitions. Word has length 16 [2019-12-26 22:39:01,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:01,114 INFO L462 AbstractCegarLoop]: Abstraction has 16680 states and 53353 transitions. [2019-12-26 22:39:01,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:39:01,114 INFO L276 IsEmpty]: Start isEmpty. Operand 16680 states and 53353 transitions. [2019-12-26 22:39:01,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 22:39:01,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:01,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:01,117 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:01,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:01,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1397943155, now seen corresponding path program 1 times [2019-12-26 22:39:01,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:01,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13329734] [2019-12-26 22:39:01,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:01,163 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-26 22:39:01,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13329734] [2019-12-26 22:39:01,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:01,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:39:01,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764802096] [2019-12-26 22:39:01,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:39:01,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:01,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:39:01,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:39:01,165 INFO L87 Difference]: Start difference. First operand 16680 states and 53353 transitions. Second operand 5 states. [2019-12-26 22:39:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:01,304 INFO L93 Difference]: Finished difference Result 2823 states and 7312 transitions. [2019-12-26 22:39:01,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:39:01,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 22:39:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:01,309 INFO L225 Difference]: With dead ends: 2823 [2019-12-26 22:39:01,310 INFO L226 Difference]: Without dead ends: 2823 [2019-12-26 22:39:01,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:39:01,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-26 22:39:01,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2823. [2019-12-26 22:39:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2019-12-26 22:39:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 7312 transitions. [2019-12-26 22:39:01,354 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 7312 transitions. Word has length 17 [2019-12-26 22:39:01,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:01,354 INFO L462 AbstractCegarLoop]: Abstraction has 2823 states and 7312 transitions. [2019-12-26 22:39:01,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:39:01,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 7312 transitions. [2019-12-26 22:39:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:39:01,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:01,362 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] [2019-12-26 22:39:01,362 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:01,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:01,362 INFO L82 PathProgramCache]: Analyzing trace with hash 34035109, now seen corresponding path program 1 times [2019-12-26 22:39:01,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:01,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518491657] [2019-12-26 22:39:01,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:01,487 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-26 22:39:01,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518491657] [2019-12-26 22:39:01,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:01,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:39:01,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120293693] [2019-12-26 22:39:01,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:39:01,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:01,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:39:01,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:39:01,489 INFO L87 Difference]: Start difference. First operand 2823 states and 7312 transitions. Second operand 6 states. [2019-12-26 22:39:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:01,536 INFO L93 Difference]: Finished difference Result 1357 states and 3889 transitions. [2019-12-26 22:39:01,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:39:01,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-26 22:39:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:01,540 INFO L225 Difference]: With dead ends: 1357 [2019-12-26 22:39:01,540 INFO L226 Difference]: Without dead ends: 1357 [2019-12-26 22:39:01,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:39:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-26 22:39:01,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-26 22:39:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-26 22:39:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3489 transitions. [2019-12-26 22:39:01,558 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3489 transitions. Word has length 29 [2019-12-26 22:39:01,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:01,559 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3489 transitions. [2019-12-26 22:39:01,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:39:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3489 transitions. [2019-12-26 22:39:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:39:01,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:01,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:01,564 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:01,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:01,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2028178460, now seen corresponding path program 1 times [2019-12-26 22:39:01,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:01,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208952384] [2019-12-26 22:39:01,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:01,639 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-26 22:39:01,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208952384] [2019-12-26 22:39:01,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:01,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:39:01,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214218225] [2019-12-26 22:39:01,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:39:01,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:01,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:39:01,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:39:01,641 INFO L87 Difference]: Start difference. First operand 1217 states and 3489 transitions. Second operand 3 states. [2019-12-26 22:39:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:01,697 INFO L93 Difference]: Finished difference Result 1228 states and 3505 transitions. [2019-12-26 22:39:01,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:39:01,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 22:39:01,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:01,700 INFO L225 Difference]: With dead ends: 1228 [2019-12-26 22:39:01,700 INFO L226 Difference]: Without dead ends: 1228 [2019-12-26 22:39:01,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-26 22:39:01,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-26 22:39:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-26 22:39:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-26 22:39:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3498 transitions. [2019-12-26 22:39:01,720 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3498 transitions. Word has length 58 [2019-12-26 22:39:01,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:01,720 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3498 transitions. [2019-12-26 22:39:01,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:39:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3498 transitions. [2019-12-26 22:39:01,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:39:01,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:01,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:01,725 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:01,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:01,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1114375606, now seen corresponding path program 1 times [2019-12-26 22:39:01,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:01,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059901743] [2019-12-26 22:39:01,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:01,790 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-26 22:39:01,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059901743] [2019-12-26 22:39:01,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:01,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:39:01,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281542789] [2019-12-26 22:39:01,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:39:01,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:01,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:39:01,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:39:01,793 INFO L87 Difference]: Start difference. First operand 1222 states and 3498 transitions. Second operand 3 states. [2019-12-26 22:39:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:01,840 INFO L93 Difference]: Finished difference Result 1228 states and 3497 transitions. [2019-12-26 22:39:01,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:39:01,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 22:39:01,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:01,843 INFO L225 Difference]: With dead ends: 1228 [2019-12-26 22:39:01,843 INFO L226 Difference]: Without dead ends: 1228 [2019-12-26 22:39:01,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-26 22:39:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-26 22:39:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1223. [2019-12-26 22:39:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-26 22:39:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3492 transitions. [2019-12-26 22:39:01,860 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3492 transitions. Word has length 58 [2019-12-26 22:39:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:01,861 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3492 transitions. [2019-12-26 22:39:01,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:39:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3492 transitions. [2019-12-26 22:39:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:39:01,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:01,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:01,865 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:01,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:01,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1114895507, now seen corresponding path program 1 times [2019-12-26 22:39:01,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:01,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961662338] [2019-12-26 22:39:01,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:01,968 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-26 22:39:01,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961662338] [2019-12-26 22:39:01,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:01,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:39:01,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282067096] [2019-12-26 22:39:01,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:39:01,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:01,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:39:01,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:39:01,971 INFO L87 Difference]: Start difference. First operand 1223 states and 3492 transitions. Second operand 5 states. [2019-12-26 22:39:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:02,207 INFO L93 Difference]: Finished difference Result 1764 states and 5014 transitions. [2019-12-26 22:39:02,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:39:02,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-26 22:39:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:02,211 INFO L225 Difference]: With dead ends: 1764 [2019-12-26 22:39:02,211 INFO L226 Difference]: Without dead ends: 1764 [2019-12-26 22:39:02,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:39:02,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-12-26 22:39:02,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1419. [2019-12-26 22:39:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-26 22:39:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4068 transitions. [2019-12-26 22:39:02,236 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4068 transitions. Word has length 58 [2019-12-26 22:39:02,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:02,237 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 4068 transitions. [2019-12-26 22:39:02,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:39:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4068 transitions. [2019-12-26 22:39:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:39:02,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:02,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:02,242 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:02,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:02,242 INFO L82 PathProgramCache]: Analyzing trace with hash -217131029, now seen corresponding path program 2 times [2019-12-26 22:39:02,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:02,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121716935] [2019-12-26 22:39:02,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:02,347 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-26 22:39:02,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121716935] [2019-12-26 22:39:02,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:02,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:39:02,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243555162] [2019-12-26 22:39:02,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:39:02,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:02,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:39:02,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:39:02,350 INFO L87 Difference]: Start difference. First operand 1419 states and 4068 transitions. Second operand 6 states. [2019-12-26 22:39:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:02,689 INFO L93 Difference]: Finished difference Result 2370 states and 6731 transitions. [2019-12-26 22:39:02,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:39:02,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-26 22:39:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:02,694 INFO L225 Difference]: With dead ends: 2370 [2019-12-26 22:39:02,695 INFO L226 Difference]: Without dead ends: 2370 [2019-12-26 22:39:02,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:39:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2019-12-26 22:39:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 1503. [2019-12-26 22:39:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-12-26 22:39:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 4316 transitions. [2019-12-26 22:39:02,724 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 4316 transitions. Word has length 58 [2019-12-26 22:39:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:02,725 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 4316 transitions. [2019-12-26 22:39:02,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:39:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 4316 transitions. [2019-12-26 22:39:02,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:39:02,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:02,729 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:02,730 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:02,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:02,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1417485459, now seen corresponding path program 3 times [2019-12-26 22:39:02,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:02,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219550514] [2019-12-26 22:39:02,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:02,876 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-26 22:39:02,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219550514] [2019-12-26 22:39:02,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:02,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:39:02,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712689757] [2019-12-26 22:39:02,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:39:02,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:02,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:39:02,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:39:02,878 INFO L87 Difference]: Start difference. First operand 1503 states and 4316 transitions. Second operand 6 states. [2019-12-26 22:39:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:03,248 INFO L93 Difference]: Finished difference Result 2377 states and 6752 transitions. [2019-12-26 22:39:03,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:39:03,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-26 22:39:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:03,253 INFO L225 Difference]: With dead ends: 2377 [2019-12-26 22:39:03,253 INFO L226 Difference]: Without dead ends: 2377 [2019-12-26 22:39:03,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:39:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2019-12-26 22:39:03,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1691. [2019-12-26 22:39:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1691 states. [2019-12-26 22:39:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 4860 transitions. [2019-12-26 22:39:03,287 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 4860 transitions. Word has length 58 [2019-12-26 22:39:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:03,288 INFO L462 AbstractCegarLoop]: Abstraction has 1691 states and 4860 transitions. [2019-12-26 22:39:03,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:39:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 4860 transitions. [2019-12-26 22:39:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:39:03,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:03,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:03,293 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:03,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:03,294 INFO L82 PathProgramCache]: Analyzing trace with hash -687244225, now seen corresponding path program 4 times [2019-12-26 22:39:03,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:03,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913053072] [2019-12-26 22:39:03,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:03,479 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-26 22:39:03,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913053072] [2019-12-26 22:39:03,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:03,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:39:03,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553317040] [2019-12-26 22:39:03,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:39:03,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:03,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:39:03,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:39:03,481 INFO L87 Difference]: Start difference. First operand 1691 states and 4860 transitions. Second operand 8 states. [2019-12-26 22:39:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:04,078 INFO L93 Difference]: Finished difference Result 2634 states and 7483 transitions. [2019-12-26 22:39:04,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:39:04,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-26 22:39:04,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:04,084 INFO L225 Difference]: With dead ends: 2634 [2019-12-26 22:39:04,085 INFO L226 Difference]: Without dead ends: 2634 [2019-12-26 22:39:04,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:39:04,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2019-12-26 22:39:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1607. [2019-12-26 22:39:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-26 22:39:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 4612 transitions. [2019-12-26 22:39:04,121 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 4612 transitions. Word has length 58 [2019-12-26 22:39:04,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:04,121 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 4612 transitions. [2019-12-26 22:39:04,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:39:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 4612 transitions. [2019-12-26 22:39:04,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:39:04,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:04,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:04,126 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:04,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:04,126 INFO L82 PathProgramCache]: Analyzing trace with hash 658273713, now seen corresponding path program 1 times [2019-12-26 22:39:04,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:04,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451415317] [2019-12-26 22:39:04,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:04,224 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-26 22:39:04,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451415317] [2019-12-26 22:39:04,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:04,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:39:04,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908634661] [2019-12-26 22:39:04,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:39:04,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:04,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:39:04,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:39:04,226 INFO L87 Difference]: Start difference. First operand 1607 states and 4612 transitions. Second operand 3 states. [2019-12-26 22:39:04,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:04,279 INFO L93 Difference]: Finished difference Result 1606 states and 4610 transitions. [2019-12-26 22:39:04,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:39:04,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 22:39:04,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:04,283 INFO L225 Difference]: With dead ends: 1606 [2019-12-26 22:39:04,283 INFO L226 Difference]: Without dead ends: 1606 [2019-12-26 22:39:04,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:39:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-12-26 22:39:04,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1081. [2019-12-26 22:39:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2019-12-26 22:39:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 3128 transitions. [2019-12-26 22:39:04,300 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 3128 transitions. Word has length 59 [2019-12-26 22:39:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:04,300 INFO L462 AbstractCegarLoop]: Abstraction has 1081 states and 3128 transitions. [2019-12-26 22:39:04,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:39:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 3128 transitions. [2019-12-26 22:39:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:39:04,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:04,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:04,303 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:04,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:04,303 INFO L82 PathProgramCache]: Analyzing trace with hash 368051854, now seen corresponding path program 1 times [2019-12-26 22:39:04,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:04,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115014764] [2019-12-26 22:39:04,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:04,436 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-26 22:39:04,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115014764] [2019-12-26 22:39:04,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:04,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:39:04,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740760646] [2019-12-26 22:39:04,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:39:04,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:04,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:39:04,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:39:04,439 INFO L87 Difference]: Start difference. First operand 1081 states and 3128 transitions. Second operand 7 states. [2019-12-26 22:39:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:04,570 INFO L93 Difference]: Finished difference Result 2116 states and 5762 transitions. [2019-12-26 22:39:04,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:39:04,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-26 22:39:04,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:04,573 INFO L225 Difference]: With dead ends: 2116 [2019-12-26 22:39:04,573 INFO L226 Difference]: Without dead ends: 1445 [2019-12-26 22:39:04,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:39:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-12-26 22:39:04,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 951. [2019-12-26 22:39:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-12-26 22:39:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2688 transitions. [2019-12-26 22:39:04,593 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 2688 transitions. Word has length 59 [2019-12-26 22:39:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:04,593 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 2688 transitions. [2019-12-26 22:39:04,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:39:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 2688 transitions. [2019-12-26 22:39:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:39:04,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:04,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:04,596 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:04,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:04,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1147587362, now seen corresponding path program 2 times [2019-12-26 22:39:04,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:04,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325237341] [2019-12-26 22:39:04,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:04,716 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-26 22:39:04,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325237341] [2019-12-26 22:39:04,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:04,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:39:04,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819566572] [2019-12-26 22:39:04,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:39:04,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:04,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:39:04,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:39:04,718 INFO L87 Difference]: Start difference. First operand 951 states and 2688 transitions. Second operand 6 states. [2019-12-26 22:39:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:04,796 INFO L93 Difference]: Finished difference Result 1371 states and 3700 transitions. [2019-12-26 22:39:04,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:39:04,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-26 22:39:04,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:04,798 INFO L225 Difference]: With dead ends: 1371 [2019-12-26 22:39:04,798 INFO L226 Difference]: Without dead ends: 806 [2019-12-26 22:39:04,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:39:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-12-26 22:39:04,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 694. [2019-12-26 22:39:04,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-12-26 22:39:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1729 transitions. [2019-12-26 22:39:04,810 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1729 transitions. Word has length 59 [2019-12-26 22:39:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:04,811 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 1729 transitions. [2019-12-26 22:39:04,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:39:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1729 transitions. [2019-12-26 22:39:04,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:39:04,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:04,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:04,813 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:04,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:04,813 INFO L82 PathProgramCache]: Analyzing trace with hash 83225480, now seen corresponding path program 3 times [2019-12-26 22:39:04,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:04,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375809842] [2019-12-26 22:39:04,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:04,942 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-26 22:39:04,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375809842] [2019-12-26 22:39:04,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:04,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:39:04,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40584066] [2019-12-26 22:39:04,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:39:04,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:04,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:39:04,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:39:04,944 INFO L87 Difference]: Start difference. First operand 694 states and 1729 transitions. Second operand 7 states. [2019-12-26 22:39:05,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:05,069 INFO L93 Difference]: Finished difference Result 1182 states and 2909 transitions. [2019-12-26 22:39:05,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:39:05,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-26 22:39:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:05,071 INFO L225 Difference]: With dead ends: 1182 [2019-12-26 22:39:05,071 INFO L226 Difference]: Without dead ends: 346 [2019-12-26 22:39:05,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:39:05,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-12-26 22:39:05,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 290. [2019-12-26 22:39:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-12-26 22:39:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 531 transitions. [2019-12-26 22:39:05,075 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 531 transitions. Word has length 59 [2019-12-26 22:39:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:05,076 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 531 transitions. [2019-12-26 22:39:05,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:39:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 531 transitions. [2019-12-26 22:39:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:39:05,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:05,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:05,077 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:05,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:05,077 INFO L82 PathProgramCache]: Analyzing trace with hash 211375676, now seen corresponding path program 4 times [2019-12-26 22:39:05,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:05,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192837053] [2019-12-26 22:39:05,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:05,130 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-26 22:39:05,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192837053] [2019-12-26 22:39:05,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:05,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:39:05,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838037655] [2019-12-26 22:39:05,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:39:05,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:05,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:39:05,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:39:05,132 INFO L87 Difference]: Start difference. First operand 290 states and 531 transitions. Second operand 3 states. [2019-12-26 22:39:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:05,143 INFO L93 Difference]: Finished difference Result 269 states and 474 transitions. [2019-12-26 22:39:05,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:39:05,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 22:39:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:05,144 INFO L225 Difference]: With dead ends: 269 [2019-12-26 22:39:05,144 INFO L226 Difference]: Without dead ends: 269 [2019-12-26 22:39:05,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:39:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-12-26 22:39:05,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 237. [2019-12-26 22:39:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-26 22:39:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 414 transitions. [2019-12-26 22:39:05,148 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 414 transitions. Word has length 59 [2019-12-26 22:39:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:05,148 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 414 transitions. [2019-12-26 22:39:05,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:39:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 414 transitions. [2019-12-26 22:39:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:39:05,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:05,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:05,149 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:05,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:05,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1893006908, now seen corresponding path program 1 times [2019-12-26 22:39:05,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:05,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839680099] [2019-12-26 22:39:05,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:05,432 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-26 22:39:05,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839680099] [2019-12-26 22:39:05,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:05,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:39:05,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861958104] [2019-12-26 22:39:05,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 22:39:05,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:05,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 22:39:05,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:39:05,434 INFO L87 Difference]: Start difference. First operand 237 states and 414 transitions. Second operand 14 states. [2019-12-26 22:39:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:05,988 INFO L93 Difference]: Finished difference Result 403 states and 684 transitions. [2019-12-26 22:39:05,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:39:05,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-26 22:39:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:05,990 INFO L225 Difference]: With dead ends: 403 [2019-12-26 22:39:05,990 INFO L226 Difference]: Without dead ends: 371 [2019-12-26 22:39:05,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-12-26 22:39:05,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-26 22:39:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 337. [2019-12-26 22:39:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-12-26 22:39:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 585 transitions. [2019-12-26 22:39:05,996 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 585 transitions. Word has length 60 [2019-12-26 22:39:05,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:05,996 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 585 transitions. [2019-12-26 22:39:05,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 22:39:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 585 transitions. [2019-12-26 22:39:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:39:05,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:05,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:05,998 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:05,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:05,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1191078724, now seen corresponding path program 2 times [2019-12-26 22:39:05,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:05,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325497445] [2019-12-26 22:39:05,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:06,342 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-26 22:39:06,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325497445] [2019-12-26 22:39:06,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:06,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:39:06,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917483280] [2019-12-26 22:39:06,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:39:06,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:06,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:39:06,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:39:06,344 INFO L87 Difference]: Start difference. First operand 337 states and 585 transitions. Second operand 13 states. [2019-12-26 22:39:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:06,909 INFO L93 Difference]: Finished difference Result 447 states and 750 transitions. [2019-12-26 22:39:06,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:39:06,910 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-26 22:39:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:06,911 INFO L225 Difference]: With dead ends: 447 [2019-12-26 22:39:06,911 INFO L226 Difference]: Without dead ends: 415 [2019-12-26 22:39:06,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-12-26 22:39:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-12-26 22:39:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 345. [2019-12-26 22:39:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-26 22:39:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 599 transitions. [2019-12-26 22:39:06,916 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 599 transitions. Word has length 60 [2019-12-26 22:39:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:06,916 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 599 transitions. [2019-12-26 22:39:06,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:39:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 599 transitions. [2019-12-26 22:39:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:39:06,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:06,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:06,917 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:39:06,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:06,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1108974140, now seen corresponding path program 3 times [2019-12-26 22:39:06,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:06,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418481283] [2019-12-26 22:39:06,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:39:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:39:07,028 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:39:07,029 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:39:07,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~z$w_buff0_used~0_862 0) (= 0 v_~z$r_buff1_thd3~0_308) (= 0 v_~z$r_buff0_thd3~0_195) (= |v_#NULL.offset_7| 0) (= v_~z$r_buff1_thd1~0_233 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd0~0_427 0) (= v_~b~0_102 0) (= v_~y~0_38 0) (= v_~__unbuffered_cnt~0_109 0) (= 0 v_~z$flush_delayed~0_82) (= 0 v_~weak$$choice0~0_17) (= v_~z$w_buff1~0_400 0) (= v_~z$r_buff0_thd2~0_88 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p3_EAX~0_243 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1173~0.base_19|) (= v_~z$r_buff0_thd0~0_435 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 0 v_~__unbuffered_p3_EBX~0_243) (= 0 v_~z$r_buff0_thd4~0_372) (= v_~z$w_buff0~0_412 0) (= v_~weak$$choice2~0_150 0) (= 0 v_~z$r_buff1_thd4~0_281) (= v_~z~0_221 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff1_thd2~0_234 0) (= v_~z$read_delayed~0_7 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1173~0.base_19| 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t1173~0.base_19|) 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1173~0.base_19| 4) |v_#length_29|) (= 0 |v_#NULL.base_7|) (= v_~z$r_buff0_thd1~0_87 0) (= v_~x~0_42 0) (= v_~z$w_buff1_used~0_620 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1173~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1173~0.base_19|) |v_ULTIMATE.start_main_~#t1173~0.offset_16| 0)) |v_#memory_int_25|) (= 0 |v_ULTIMATE.start_main_~#t1173~0.offset_16|) (= v_~main$tmp_guard1~0_25 0) (= v_~a~0_234 0) (= v_~main$tmp_guard0~0_24 0) (= v_~z$mem_tmp~0_23 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1176~0.base=|v_ULTIMATE.start_main_~#t1176~0.base_22|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_234, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_44|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_101|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1173~0.base=|v_ULTIMATE.start_main_~#t1173~0.base_19|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_38|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_120|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_57|, ~a~0=v_~a~0_234, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_435, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_372, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_243, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_45|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_620, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_82, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_36|, ULTIMATE.start_main_~#t1175~0.offset=|v_ULTIMATE.start_main_~#t1175~0.offset_16|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_69|, ULTIMATE.start_main_~#t1174~0.offset=|v_ULTIMATE.start_main_~#t1174~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_233, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_195, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ULTIMATE.start_main_~#t1175~0.base=|v_ULTIMATE.start_main_~#t1175~0.base_21|, ~x~0=v_~x~0_42, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_281, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_43|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_40|, ~z$w_buff1~0=v_~z$w_buff1~0_400, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_34|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_36|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_~#t1173~0.offset=|v_ULTIMATE.start_main_~#t1173~0.offset_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_~#t1174~0.base=|v_ULTIMATE.start_main_~#t1174~0.base_22|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_55|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_427, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_28|, ~y~0=v_~y~0_38, ULTIMATE.start_main_~#t1176~0.offset=|v_ULTIMATE.start_main_~#t1176~0.offset_17|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_88, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_862, ~z$w_buff0~0=v_~z$w_buff0~0_412, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_40|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_28|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_46|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_243, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_61|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_64|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ~b~0=v_~b~0_102, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_22|, ~z~0=v_~z~0_221, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_87} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1176~0.base, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t1173~0.base, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1175~0.offset, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1174~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1175~0.base, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1173~0.offset, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1174~0.base, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ULTIMATE.start_main_~#t1176~0.offset, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:39:07,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L833-1-->L835: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1174~0.offset_11|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1174~0.base_13|)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1174~0.base_13| 1)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1174~0.base_13|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1174~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1174~0.base_13|) |v_ULTIMATE.start_main_~#t1174~0.offset_11| 1)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1174~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1174~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1174~0.offset=|v_ULTIMATE.start_main_~#t1174~0.offset_11|, ULTIMATE.start_main_~#t1174~0.base=|v_ULTIMATE.start_main_~#t1174~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1174~0.offset, ULTIMATE.start_main_~#t1174~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-26 22:39:07,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1175~0.base_12| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1175~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1175~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1175~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1175~0.base_12| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1175~0.base_12| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1175~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1175~0.base_12|) |v_ULTIMATE.start_main_~#t1175~0.offset_10| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1175~0.base=|v_ULTIMATE.start_main_~#t1175~0.base_12|, ULTIMATE.start_main_~#t1175~0.offset=|v_ULTIMATE.start_main_~#t1175~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1175~0.base, ULTIMATE.start_main_~#t1175~0.offset] because there is no mapped edge [2019-12-26 22:39:07,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L837-1-->L839: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1176~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1176~0.offset_10|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1176~0.base_12| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1176~0.base_12| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1176~0.base_12|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1176~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1176~0.base_12|) |v_ULTIMATE.start_main_~#t1176~0.offset_10| 3)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t1176~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1176~0.base=|v_ULTIMATE.start_main_~#t1176~0.base_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1176~0.offset=|v_ULTIMATE.start_main_~#t1176~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1176~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1176~0.offset] because there is no mapped edge [2019-12-26 22:39:07,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_60 v_~z$r_buff1_thd0~0_36) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= v_~z$r_buff0_thd4~0_20 v_~z$r_buff1_thd4~0_14) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_19 1) (= v_~z$r_buff0_thd3~0_17 v_~z$r_buff1_thd3~0_11)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_20, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_14, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_36, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_19, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-26 22:39:07,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_~b~0_77 1) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~x~0_27 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, ~b~0=v_~b~0_77, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_27, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:39:07,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_12 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_28 v_~__unbuffered_p1_EAX~0_19) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_12) (= v_~x~0_32 2) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~y~0=v_~y~0_28} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_12, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~y~0=v_~y~0_28, ~x~0=v_~x~0_32, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 22:39:07,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-920561288 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-920561288 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out-920561288| ~z$w_buff0_used~0_In-920561288) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-920561288|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-920561288, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-920561288} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-920561288, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-920561288, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-920561288|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-26 22:39:07,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1793640074 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1793640074 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1793640074 |P2Thread1of1ForFork2_#t~ite3_Out1793640074|)) (and (or .cse0 .cse1) (= ~z~0_In1793640074 |P2Thread1of1ForFork2_#t~ite3_Out1793640074|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1793640074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1793640074, ~z$w_buff1~0=~z$w_buff1~0_In1793640074, ~z~0=~z~0_In1793640074} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1793640074|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1793640074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1793640074, ~z$w_buff1~0=~z$w_buff1~0_In1793640074, ~z~0=~z~0_In1793640074} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-26 22:39:07,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd4~0_In410795826 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In410795826 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In410795826 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In410795826 256)))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite12_Out410795826|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In410795826 |P3Thread1of1ForFork3_#t~ite12_Out410795826|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In410795826, ~z$w_buff0_used~0=~z$w_buff0_used~0_In410795826, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In410795826, ~z$w_buff1_used~0=~z$w_buff1_used~0_In410795826} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In410795826, ~z$w_buff0_used~0=~z$w_buff0_used~0_In410795826, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In410795826, ~z$w_buff1_used~0=~z$w_buff1_used~0_In410795826, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out410795826|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-26 22:39:07,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In171251490 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In171251490 256)))) (or (and (= 0 ~z$r_buff0_thd4~0_Out171251490) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out171251490 ~z$r_buff0_thd4~0_In171251490)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In171251490, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In171251490} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In171251490, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out171251490, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out171251490|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-26 22:39:07,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-930689084 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-930689084 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-930689084 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-930689084 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out-930689084| ~z$r_buff1_thd4~0_In-930689084)) (and (= |P3Thread1of1ForFork3_#t~ite14_Out-930689084| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-930689084, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-930689084, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-930689084, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-930689084} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-930689084, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-930689084, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-930689084|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-930689084, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-930689084} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-26 22:39:07,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_32| v_~z$r_buff1_thd4~0_45) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_31|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-26 22:39:07,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_16| v_~z~0_56) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_16|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_11|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_15|, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-26 22:39:07,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1889305865 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1889305865 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out-1889305865| ~z$w_buff0_used~0_In-1889305865)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out-1889305865| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1889305865, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1889305865} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1889305865|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1889305865, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1889305865} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 22:39:07,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In-548012287 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-548012287 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-548012287 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-548012287 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-548012287 |P2Thread1of1ForFork2_#t~ite6_Out-548012287|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-548012287|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-548012287, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-548012287, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-548012287, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-548012287} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-548012287|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-548012287, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-548012287, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-548012287, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-548012287} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 22:39:07,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1693875643 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1693875643 256)))) (or (and (= ~z$r_buff0_thd3~0_In-1693875643 |P2Thread1of1ForFork2_#t~ite7_Out-1693875643|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-1693875643|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693875643, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1693875643} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693875643, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1693875643, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1693875643|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-26 22:39:07,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In2064539776 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In2064539776 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In2064539776 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In2064539776 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In2064539776 |P2Thread1of1ForFork2_#t~ite8_Out2064539776|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite8_Out2064539776| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2064539776, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2064539776, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2064539776, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2064539776} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2064539776, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2064539776, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2064539776, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2064539776, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out2064539776|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:39:07,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_30| v_~z$r_buff1_thd3~0_74) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_30|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_29|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:39:07,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_34) (= v_~main$tmp_guard0~0_13 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_13, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_12|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-26 22:39:07,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1190788053 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1190788053 256)))) (or (and (= ~z~0_In1190788053 |ULTIMATE.start_main_#t~ite19_Out1190788053|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In1190788053 |ULTIMATE.start_main_#t~ite19_Out1190788053|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1190788053, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1190788053, ~z$w_buff1~0=~z$w_buff1~0_In1190788053, ~z~0=~z~0_In1190788053} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1190788053|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1190788053, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1190788053, ~z$w_buff1~0=~z$w_buff1~0_In1190788053, ~z~0=~z~0_In1190788053} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 22:39:07,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_30 |v_ULTIMATE.start_main_#t~ite19_9|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|, ~z~0=v_~z~0_30, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 22:39:07,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In836786804 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In836786804 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out836786804|) (not .cse1)) (and (= ~z$w_buff0_used~0_In836786804 |ULTIMATE.start_main_#t~ite21_Out836786804|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In836786804, ~z$w_buff0_used~0=~z$w_buff0_used~0_In836786804} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In836786804, ~z$w_buff0_used~0=~z$w_buff0_used~0_In836786804, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out836786804|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 22:39:07,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1484605195 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1484605195 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1484605195 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In1484605195 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out1484605195| 0)) (and (= ~z$w_buff1_used~0_In1484605195 |ULTIMATE.start_main_#t~ite22_Out1484605195|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1484605195, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1484605195, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1484605195, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1484605195} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1484605195, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1484605195, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1484605195, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1484605195, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1484605195|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 22:39:07,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In759230634 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In759230634 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out759230634| ~z$r_buff0_thd0~0_In759230634)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out759230634| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In759230634, ~z$w_buff0_used~0=~z$w_buff0_used~0_In759230634} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In759230634, ~z$w_buff0_used~0=~z$w_buff0_used~0_In759230634, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out759230634|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 22:39:07,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In118589025 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In118589025 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In118589025 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In118589025 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out118589025| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite24_Out118589025| ~z$r_buff1_thd0~0_In118589025) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In118589025, ~z$w_buff0_used~0=~z$w_buff0_used~0_In118589025, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In118589025, ~z$w_buff1_used~0=~z$w_buff1_used~0_In118589025} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In118589025, ~z$w_buff0_used~0=~z$w_buff0_used~0_In118589025, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In118589025, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out118589025|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In118589025} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-26 22:39:07,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In78452644 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out78452644| ~z$w_buff1_used~0_In78452644) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In78452644 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In78452644 256)) (and (= 0 (mod ~z$r_buff1_thd0~0_In78452644 256)) .cse0) (and (= 0 (mod ~z$w_buff1_used~0_In78452644 256)) .cse0))) (= |ULTIMATE.start_main_#t~ite39_Out78452644| |ULTIMATE.start_main_#t~ite40_Out78452644|) .cse1) (and (= ~z$w_buff1_used~0_In78452644 |ULTIMATE.start_main_#t~ite40_Out78452644|) (= |ULTIMATE.start_main_#t~ite39_In78452644| |ULTIMATE.start_main_#t~ite39_Out78452644|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In78452644, ~z$w_buff0_used~0=~z$w_buff0_used~0_In78452644, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In78452644|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In78452644, ~z$w_buff1_used~0=~z$w_buff1_used~0_In78452644, ~weak$$choice2~0=~weak$$choice2~0_In78452644} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In78452644, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out78452644|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out78452644|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In78452644, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In78452644, ~z$w_buff1_used~0=~z$w_buff1_used~0_In78452644, ~weak$$choice2~0=~weak$$choice2~0_In78452644} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 22:39:07,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_125 v_~z$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:39:07,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L862-->L862-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-116792764 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-116792764| ~z$r_buff1_thd0~0_In-116792764) (= |ULTIMATE.start_main_#t~ite45_In-116792764| |ULTIMATE.start_main_#t~ite45_Out-116792764|)) (and (= |ULTIMATE.start_main_#t~ite45_Out-116792764| ~z$r_buff1_thd0~0_In-116792764) .cse0 (= |ULTIMATE.start_main_#t~ite45_Out-116792764| |ULTIMATE.start_main_#t~ite46_Out-116792764|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-116792764 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-116792764 256))) (and (= 0 (mod ~z$w_buff1_used~0_In-116792764 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-116792764 256))))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-116792764, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-116792764, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-116792764, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-116792764, ~weak$$choice2~0=~weak$$choice2~0_In-116792764, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-116792764|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-116792764, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-116792764, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-116792764, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-116792764, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-116792764|, ~weak$$choice2~0=~weak$$choice2~0_In-116792764, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-116792764|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:39:07,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L864-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_110) (not (= 0 (mod v_~z$flush_delayed~0_38 256))) (= 0 v_~z$flush_delayed~0_37) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_38} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~z~0=v_~z~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:39:07,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:39:07,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:39:07 BasicIcfg [2019-12-26 22:39:07,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:39:07,151 INFO L168 Benchmark]: Toolchain (without parser) took 30509.64 ms. Allocated memory was 144.2 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 101.0 MB in the beginning and 978.4 MB in the end (delta: -877.4 MB). Peak memory consumption was 447.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:39:07,152 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 22:39:07,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.12 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 100.6 MB in the beginning and 154.3 MB in the end (delta: -53.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:39:07,153 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.74 ms. Allocated memory is still 200.8 MB. Free memory was 154.3 MB in the beginning and 150.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:39:07,154 INFO L168 Benchmark]: Boogie Preprocessor took 50.32 ms. Allocated memory is still 200.8 MB. Free memory was 150.9 MB in the beginning and 148.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:39:07,154 INFO L168 Benchmark]: RCFGBuilder took 869.46 ms. Allocated memory is still 200.8 MB. Free memory was 148.1 MB in the beginning and 98.9 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:39:07,155 INFO L168 Benchmark]: TraceAbstraction took 28701.42 ms. Allocated memory was 200.8 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 98.9 MB in the beginning and 978.4 MB in the end (delta: -879.5 MB). Peak memory consumption was 388.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:39:07,159 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.50 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.12 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 100.6 MB in the beginning and 154.3 MB in the end (delta: -53.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.74 ms. Allocated memory is still 200.8 MB. Free memory was 154.3 MB in the beginning and 150.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.32 ms. Allocated memory is still 200.8 MB. Free memory was 150.9 MB in the beginning and 148.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 869.46 ms. Allocated memory is still 200.8 MB. Free memory was 148.1 MB in the beginning and 98.9 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28701.42 ms. Allocated memory was 200.8 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 98.9 MB in the beginning and 978.4 MB in the end (delta: -879.5 MB). Peak memory consumption was 388.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 181 ProgramPointsBefore, 92 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 4988 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 145 SemBasedMoverChecksPositive, 210 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 52490 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1173, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1174, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1175, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1176, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 1 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.4s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2109 SDtfs, 2154 SDslu, 5196 SDs, 0 SdLazy, 2360 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 37 SyntacticMatches, 14 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51222occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 9283 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 924 NumberOfCodeBlocks, 924 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 845 ConstructedInterpolants, 0 QuantifiedInterpolants, 181561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...