/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_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:39:09,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:39:09,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:39:09,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:39:09,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:39:09,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:39:09,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:39:09,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:39:09,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:39:09,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:39:09,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:39:09,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:39:09,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:39:09,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:39:09,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:39:09,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:39:09,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:39:09,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:39:09,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:39:09,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:39:09,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:39:09,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:39:09,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:39:09,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:39:09,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:39:09,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:39:09,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:39:09,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:39:09,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:39:09,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:39:09,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:39:09,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:39:09,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:39:09,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:39:09,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:39:09,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:39:09,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:39:09,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:39:09,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:39:09,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:39:09,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:39:09,425 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:39:09,441 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:39:09,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:39:09,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:39:09,447 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:39:09,447 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:39:09,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:39:09,447 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:39:09,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:39:09,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:39:09,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:39:09,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:39:09,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:39:09,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:39:09,450 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:39:09,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:39:09,450 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:39:09,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:39:09,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:39:09,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:39:09,451 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:39:09,451 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:39:09,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:39:09,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:39:09,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:39:09,452 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:39:09,452 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:39:09,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:39:09,453 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:39:09,453 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:39:09,453 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:39:09,756 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:39:09,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:39:09,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:39:09,774 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:39:09,775 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:39:09,775 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i [2019-12-26 22:39:09,857 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30fc375fb/cbdf8bd15dce499db9cad13e871ca563/FLAGfeb179ed1 [2019-12-26 22:39:10,391 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:39:10,392 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i [2019-12-26 22:39:10,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30fc375fb/cbdf8bd15dce499db9cad13e871ca563/FLAGfeb179ed1 [2019-12-26 22:39:10,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30fc375fb/cbdf8bd15dce499db9cad13e871ca563 [2019-12-26 22:39:10,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:39:10,672 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:39:10,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:39:10,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:39:10,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:39:10,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:39:10" (1/1) ... [2019-12-26 22:39:10,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2043a82e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:39:10, skipping insertion in model container [2019-12-26 22:39:10,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:39:10" (1/1) ... [2019-12-26 22:39:10,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:39:10,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:39:11,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:39:11,277 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:39:11,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:39:11,466 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:39:11,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:39:11 WrapperNode [2019-12-26 22:39:11,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:39:11,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:39:11,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:39:11,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:39:11,477 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:39:11" (1/1) ... [2019-12-26 22:39:11,496 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:39:11" (1/1) ... [2019-12-26 22:39:11,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:39:11,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:39:11,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:39:11,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:39:11,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:39:11" (1/1) ... [2019-12-26 22:39:11,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:39:11" (1/1) ... [2019-12-26 22:39:11,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:39:11" (1/1) ... [2019-12-26 22:39:11,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:39:11" (1/1) ... [2019-12-26 22:39:11,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:39:11" (1/1) ... [2019-12-26 22:39:11,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:39:11" (1/1) ... [2019-12-26 22:39:11,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:39:11" (1/1) ... [2019-12-26 22:39:11,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:39:11,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:39:11,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:39:11,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:39:11,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:39:11" (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:39:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:39:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:39:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:39:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:39:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:39:11,642 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:39:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:39:11,642 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:39:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:39:11,643 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:39:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:39:11,643 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:39:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:39:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:39:11,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:39:11,645 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:39:12,456 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:39:12,456 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:39:12,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:39:12 BoogieIcfgContainer [2019-12-26 22:39:12,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:39:12,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:39:12,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:39:12,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:39:12,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:39:10" (1/3) ... [2019-12-26 22:39:12,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188a4b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:39:12, skipping insertion in model container [2019-12-26 22:39:12,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:39:11" (2/3) ... [2019-12-26 22:39:12,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188a4b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:39:12, skipping insertion in model container [2019-12-26 22:39:12,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:39:12" (3/3) ... [2019-12-26 22:39:12,467 INFO L109 eAbstractionObserver]: Analyzing ICFG mix044_rmo.opt.i [2019-12-26 22:39:12,477 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:39:12,478 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:39:12,486 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:39:12,487 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:39:12,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,526 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,527 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,528 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,529 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,530 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,531 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,539 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,539 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,539 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,539 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,539 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,540 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,540 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,540 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,562 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,563 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,567 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,567 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,567 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,568 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,569 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,569 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,574 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,574 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,580 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,585 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,585 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,588 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,588 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,589 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,589 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,589 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,589 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,589 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,590 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:39:12,604 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:39:12,619 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:39:12,620 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:39:12,620 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:39:12,620 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:39:12,620 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:39:12,620 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:39:12,620 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:39:12,620 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:39:12,638 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-26 22:39:12,640 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-26 22:39:12,752 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-26 22:39:12,752 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:39:12,773 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:39:12,790 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-26 22:39:12,844 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-26 22:39:12,845 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:39:12,851 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:39:12,866 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-26 22:39:12,867 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:39:18,305 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-26 22:39:18,453 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-26 22:39:18,482 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52490 [2019-12-26 22:39:18,482 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-26 22:39:18,486 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-26 22:39:20,761 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 37086 states. [2019-12-26 22:39:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 37086 states. [2019-12-26 22:39:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 22:39:20,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:20,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:20,771 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:39:20,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:20,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1862617909, now seen corresponding path program 1 times [2019-12-26 22:39:20,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:20,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922332325] [2019-12-26 22:39:20,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:21,166 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:21,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922332325] [2019-12-26 22:39:21,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:21,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:39:21,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673303847] [2019-12-26 22:39:21,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:39:21,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:21,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:39:21,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:39:21,196 INFO L87 Difference]: Start difference. First operand 37086 states. Second operand 3 states. [2019-12-26 22:39:22,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:22,596 INFO L93 Difference]: Finished difference Result 36830 states and 157144 transitions. [2019-12-26 22:39:22,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:39:22,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 22:39:22,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:22,991 INFO L225 Difference]: With dead ends: 36830 [2019-12-26 22:39:22,992 INFO L226 Difference]: Without dead ends: 36102 [2019-12-26 22:39:22,993 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:39:23,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-26 22:39:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-26 22:39:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-26 22:39:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 154176 transitions. [2019-12-26 22:39:25,164 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 154176 transitions. Word has length 9 [2019-12-26 22:39:25,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:25,165 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 154176 transitions. [2019-12-26 22:39:25,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:39:25,165 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 154176 transitions. [2019-12-26 22:39:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:39:25,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:25,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:25,173 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:39:25,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:25,174 INFO L82 PathProgramCache]: Analyzing trace with hash 290643941, now seen corresponding path program 1 times [2019-12-26 22:39:25,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:25,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723117190] [2019-12-26 22:39:25,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:25,322 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:25,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723117190] [2019-12-26 22:39:25,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:25,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:39:25,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691817956] [2019-12-26 22:39:25,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:39:25,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:25,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:39:25,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:39:25,327 INFO L87 Difference]: Start difference. First operand 36102 states and 154176 transitions. Second operand 4 states. [2019-12-26 22:39:27,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:27,812 INFO L93 Difference]: Finished difference Result 56134 states and 231868 transitions. [2019-12-26 22:39:27,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:39:27,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:39:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:28,130 INFO L225 Difference]: With dead ends: 56134 [2019-12-26 22:39:28,130 INFO L226 Difference]: Without dead ends: 56106 [2019-12-26 22:39:28,131 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:39:28,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-26 22:39:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 51222. [2019-12-26 22:39:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51222 states. [2019-12-26 22:39:30,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51222 states to 51222 states and 213628 transitions. [2019-12-26 22:39:30,292 INFO L78 Accepts]: Start accepts. Automaton has 51222 states and 213628 transitions. Word has length 15 [2019-12-26 22:39:30,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:30,293 INFO L462 AbstractCegarLoop]: Abstraction has 51222 states and 213628 transitions. [2019-12-26 22:39:30,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:39:30,293 INFO L276 IsEmpty]: Start isEmpty. Operand 51222 states and 213628 transitions. [2019-12-26 22:39:30,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:39:30,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:30,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:39:30,296 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:39:30,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:30,296 INFO L82 PathProgramCache]: Analyzing trace with hash -497322091, now seen corresponding path program 1 times [2019-12-26 22:39:30,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:30,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938358717] [2019-12-26 22:39:30,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:30,350 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:30,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938358717] [2019-12-26 22:39:30,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:30,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:39:30,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523792971] [2019-12-26 22:39:30,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:39:30,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:30,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:39:30,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:39:30,353 INFO L87 Difference]: Start difference. First operand 51222 states and 213628 transitions. Second operand 3 states. [2019-12-26 22:39:32,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:32,400 INFO L93 Difference]: Finished difference Result 40168 states and 154828 transitions. [2019-12-26 22:39:32,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:39:32,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 22:39:32,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:32,652 INFO L225 Difference]: With dead ends: 40168 [2019-12-26 22:39:32,652 INFO L226 Difference]: Without dead ends: 40168 [2019-12-26 22:39:32,653 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:39:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40168 states. [2019-12-26 22:39:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40168 to 40168. [2019-12-26 22:39:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40168 states. [2019-12-26 22:39:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40168 states to 40168 states and 154828 transitions. [2019-12-26 22:39:34,017 INFO L78 Accepts]: Start accepts. Automaton has 40168 states and 154828 transitions. Word has length 15 [2019-12-26 22:39:34,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:34,017 INFO L462 AbstractCegarLoop]: Abstraction has 40168 states and 154828 transitions. [2019-12-26 22:39:34,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:39:34,018 INFO L276 IsEmpty]: Start isEmpty. Operand 40168 states and 154828 transitions. [2019-12-26 22:39:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:39:34,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:34,021 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:34,021 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:34,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:34,021 INFO L82 PathProgramCache]: Analyzing trace with hash -13987850, now seen corresponding path program 1 times [2019-12-26 22:39:34,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:34,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593443758] [2019-12-26 22:39:34,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:34,075 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:34,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593443758] [2019-12-26 22:39:34,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:34,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:39:34,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322209057] [2019-12-26 22:39:34,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:39:34,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:34,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:39:34,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:39:34,078 INFO L87 Difference]: Start difference. First operand 40168 states and 154828 transitions. Second operand 4 states. [2019-12-26 22:39:34,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:34,168 INFO L93 Difference]: Finished difference Result 16680 states and 53353 transitions. [2019-12-26 22:39:34,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:39:34,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:39:34,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:34,207 INFO L225 Difference]: With dead ends: 16680 [2019-12-26 22:39:34,207 INFO L226 Difference]: Without dead ends: 16680 [2019-12-26 22:39:34,207 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:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16680 states. [2019-12-26 22:39:34,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16680 to 16680. [2019-12-26 22:39:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16680 states. [2019-12-26 22:39:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 53353 transitions. [2019-12-26 22:39:34,611 INFO L78 Accepts]: Start accepts. Automaton has 16680 states and 53353 transitions. Word has length 16 [2019-12-26 22:39:34,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:34,611 INFO L462 AbstractCegarLoop]: Abstraction has 16680 states and 53353 transitions. [2019-12-26 22:39:34,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:39:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 16680 states and 53353 transitions. [2019-12-26 22:39:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 22:39:34,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:34,614 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:34,614 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:34,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:34,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1397943155, now seen corresponding path program 1 times [2019-12-26 22:39:34,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:34,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651494666] [2019-12-26 22:39:34,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:34,655 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:34,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651494666] [2019-12-26 22:39:34,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:34,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:39:34,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293582254] [2019-12-26 22:39:34,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:39:34,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:34,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:39:34,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:39:34,658 INFO L87 Difference]: Start difference. First operand 16680 states and 53353 transitions. Second operand 5 states. [2019-12-26 22:39:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:34,709 INFO L93 Difference]: Finished difference Result 2823 states and 7312 transitions. [2019-12-26 22:39:34,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:39:34,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 22:39:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:34,715 INFO L225 Difference]: With dead ends: 2823 [2019-12-26 22:39:34,716 INFO L226 Difference]: Without dead ends: 2823 [2019-12-26 22:39:34,716 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:34,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-26 22:39:34,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2823. [2019-12-26 22:39:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2019-12-26 22:39:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 7312 transitions. [2019-12-26 22:39:34,762 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 7312 transitions. Word has length 17 [2019-12-26 22:39:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:34,762 INFO L462 AbstractCegarLoop]: Abstraction has 2823 states and 7312 transitions. [2019-12-26 22:39:34,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:39:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 7312 transitions. [2019-12-26 22:39:34,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:39:34,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:34,768 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:34,768 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:34,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:34,768 INFO L82 PathProgramCache]: Analyzing trace with hash 34035109, now seen corresponding path program 1 times [2019-12-26 22:39:34,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:34,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747979632] [2019-12-26 22:39:34,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:34,859 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:34,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747979632] [2019-12-26 22:39:34,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:34,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:39:34,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127061114] [2019-12-26 22:39:34,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:39:34,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:34,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:39:34,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:39:34,862 INFO L87 Difference]: Start difference. First operand 2823 states and 7312 transitions. Second operand 6 states. [2019-12-26 22:39:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:34,997 INFO L93 Difference]: Finished difference Result 1357 states and 3889 transitions. [2019-12-26 22:39:34,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:39:34,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-26 22:39:34,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:35,002 INFO L225 Difference]: With dead ends: 1357 [2019-12-26 22:39:35,002 INFO L226 Difference]: Without dead ends: 1357 [2019-12-26 22:39:35,002 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:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-26 22:39:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-26 22:39:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-26 22:39:35,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3489 transitions. [2019-12-26 22:39:35,024 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3489 transitions. Word has length 29 [2019-12-26 22:39:35,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:35,025 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3489 transitions. [2019-12-26 22:39:35,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:39:35,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3489 transitions. [2019-12-26 22:39:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:39:35,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:35,030 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:35,030 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:35,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:35,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2028178460, now seen corresponding path program 1 times [2019-12-26 22:39:35,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:35,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641630095] [2019-12-26 22:39:35,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:35,106 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:35,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641630095] [2019-12-26 22:39:35,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:35,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:39:35,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565044379] [2019-12-26 22:39:35,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:39:35,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:35,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:39:35,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:39:35,110 INFO L87 Difference]: Start difference. First operand 1217 states and 3489 transitions. Second operand 3 states. [2019-12-26 22:39:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:35,160 INFO L93 Difference]: Finished difference Result 1228 states and 3505 transitions. [2019-12-26 22:39:35,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:39:35,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 22:39:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:35,163 INFO L225 Difference]: With dead ends: 1228 [2019-12-26 22:39:35,164 INFO L226 Difference]: Without dead ends: 1228 [2019-12-26 22:39:35,165 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:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-26 22:39:35,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-26 22:39:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-26 22:39:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3498 transitions. [2019-12-26 22:39:35,185 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3498 transitions. Word has length 58 [2019-12-26 22:39:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:35,187 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3498 transitions. [2019-12-26 22:39:35,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:39:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3498 transitions. [2019-12-26 22:39:35,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:39:35,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:35,193 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:35,194 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:35,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:35,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1114375606, now seen corresponding path program 1 times [2019-12-26 22:39:35,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:35,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913809773] [2019-12-26 22:39:35,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:35,299 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:35,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913809773] [2019-12-26 22:39:35,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:35,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:39:35,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664626385] [2019-12-26 22:39:35,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:39:35,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:35,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:39:35,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:39:35,301 INFO L87 Difference]: Start difference. First operand 1222 states and 3498 transitions. Second operand 3 states. [2019-12-26 22:39:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:35,362 INFO L93 Difference]: Finished difference Result 1228 states and 3497 transitions. [2019-12-26 22:39:35,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:39:35,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 22:39:35,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:35,365 INFO L225 Difference]: With dead ends: 1228 [2019-12-26 22:39:35,366 INFO L226 Difference]: Without dead ends: 1228 [2019-12-26 22:39:35,366 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:35,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-26 22:39:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1223. [2019-12-26 22:39:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-26 22:39:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3492 transitions. [2019-12-26 22:39:35,386 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3492 transitions. Word has length 58 [2019-12-26 22:39:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:35,388 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3492 transitions. [2019-12-26 22:39:35,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:39:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3492 transitions. [2019-12-26 22:39:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:39:35,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:35,394 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:35,394 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:35,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:35,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1114895507, now seen corresponding path program 1 times [2019-12-26 22:39:35,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:35,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116561326] [2019-12-26 22:39:35,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:35,544 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:35,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116561326] [2019-12-26 22:39:35,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:35,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:39:35,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256082839] [2019-12-26 22:39:35,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:39:35,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:35,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:39:35,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:39:35,547 INFO L87 Difference]: Start difference. First operand 1223 states and 3492 transitions. Second operand 5 states. [2019-12-26 22:39:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:35,759 INFO L93 Difference]: Finished difference Result 1764 states and 5014 transitions. [2019-12-26 22:39:35,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:39:35,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-26 22:39:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:35,763 INFO L225 Difference]: With dead ends: 1764 [2019-12-26 22:39:35,763 INFO L226 Difference]: Without dead ends: 1764 [2019-12-26 22:39:35,763 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:35,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-12-26 22:39:35,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1419. [2019-12-26 22:39:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-26 22:39:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4068 transitions. [2019-12-26 22:39:35,789 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4068 transitions. Word has length 58 [2019-12-26 22:39:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:35,789 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 4068 transitions. [2019-12-26 22:39:35,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:39:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4068 transitions. [2019-12-26 22:39:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:39:35,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:35,793 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:35,793 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:35,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:35,794 INFO L82 PathProgramCache]: Analyzing trace with hash -217131029, now seen corresponding path program 2 times [2019-12-26 22:39:35,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:35,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438477426] [2019-12-26 22:39:35,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:35,882 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:35,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438477426] [2019-12-26 22:39:35,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:35,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:39:35,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857295142] [2019-12-26 22:39:35,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:39:35,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:35,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:39:35,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:39:35,884 INFO L87 Difference]: Start difference. First operand 1419 states and 4068 transitions. Second operand 6 states. [2019-12-26 22:39:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:36,256 INFO L93 Difference]: Finished difference Result 2370 states and 6731 transitions. [2019-12-26 22:39:36,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:39:36,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-26 22:39:36,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:36,262 INFO L225 Difference]: With dead ends: 2370 [2019-12-26 22:39:36,262 INFO L226 Difference]: Without dead ends: 2370 [2019-12-26 22:39:36,262 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:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2019-12-26 22:39:36,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 1503. [2019-12-26 22:39:36,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-12-26 22:39:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 4316 transitions. [2019-12-26 22:39:36,283 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 4316 transitions. Word has length 58 [2019-12-26 22:39:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:36,283 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 4316 transitions. [2019-12-26 22:39:36,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:39:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 4316 transitions. [2019-12-26 22:39:36,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:39:36,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:36,287 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:36,287 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:36,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:36,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1417485459, now seen corresponding path program 3 times [2019-12-26 22:39:36,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:36,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374408678] [2019-12-26 22:39:36,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:36,406 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:36,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374408678] [2019-12-26 22:39:36,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:36,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:39:36,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762089046] [2019-12-26 22:39:36,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:39:36,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:36,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:39:36,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:39:36,408 INFO L87 Difference]: Start difference. First operand 1503 states and 4316 transitions. Second operand 3 states. [2019-12-26 22:39:36,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:36,471 INFO L93 Difference]: Finished difference Result 1502 states and 4314 transitions. [2019-12-26 22:39:36,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:39:36,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 22:39:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:36,474 INFO L225 Difference]: With dead ends: 1502 [2019-12-26 22:39:36,474 INFO L226 Difference]: Without dead ends: 1502 [2019-12-26 22:39:36,475 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:36,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-12-26 22:39:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1081. [2019-12-26 22:39:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2019-12-26 22:39:36,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 3128 transitions. [2019-12-26 22:39:36,500 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 3128 transitions. Word has length 58 [2019-12-26 22:39:36,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:36,500 INFO L462 AbstractCegarLoop]: Abstraction has 1081 states and 3128 transitions. [2019-12-26 22:39:36,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:39:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 3128 transitions. [2019-12-26 22:39:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:39:36,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:36,503 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:36,504 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:36,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:36,504 INFO L82 PathProgramCache]: Analyzing trace with hash 368051854, now seen corresponding path program 1 times [2019-12-26 22:39:36,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:36,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151427456] [2019-12-26 22:39:36,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:36,787 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:36,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151427456] [2019-12-26 22:39:36,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:36,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:39:36,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003976365] [2019-12-26 22:39:36,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:39:36,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:36,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:39:36,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:39:36,789 INFO L87 Difference]: Start difference. First operand 1081 states and 3128 transitions. Second operand 12 states. [2019-12-26 22:39:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:37,701 INFO L93 Difference]: Finished difference Result 2489 states and 6543 transitions. [2019-12-26 22:39:37,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 22:39:37,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-26 22:39:37,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:37,705 INFO L225 Difference]: With dead ends: 2489 [2019-12-26 22:39:37,705 INFO L226 Difference]: Without dead ends: 1445 [2019-12-26 22:39:37,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-26 22:39:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-12-26 22:39:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 951. [2019-12-26 22:39:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-12-26 22:39:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2688 transitions. [2019-12-26 22:39:37,721 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 2688 transitions. Word has length 59 [2019-12-26 22:39:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:37,721 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 2688 transitions. [2019-12-26 22:39:37,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:39:37,721 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 2688 transitions. [2019-12-26 22:39:37,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:39:37,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:37,724 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:37,724 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:37,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:37,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1147587362, now seen corresponding path program 2 times [2019-12-26 22:39:37,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:37,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038297907] [2019-12-26 22:39:37,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:37,874 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:37,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038297907] [2019-12-26 22:39:37,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:37,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:39:37,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672334485] [2019-12-26 22:39:37,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:39:37,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:37,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:39:37,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:39:37,876 INFO L87 Difference]: Start difference. First operand 951 states and 2688 transitions. Second operand 6 states. [2019-12-26 22:39:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:37,978 INFO L93 Difference]: Finished difference Result 1371 states and 3700 transitions. [2019-12-26 22:39:37,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:39:37,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-26 22:39:37,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:37,980 INFO L225 Difference]: With dead ends: 1371 [2019-12-26 22:39:37,980 INFO L226 Difference]: Without dead ends: 806 [2019-12-26 22:39:37,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:39:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-12-26 22:39:37,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 694. [2019-12-26 22:39:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-12-26 22:39:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1729 transitions. [2019-12-26 22:39:37,993 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1729 transitions. Word has length 59 [2019-12-26 22:39:37,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:37,993 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 1729 transitions. [2019-12-26 22:39:37,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:39:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1729 transitions. [2019-12-26 22:39:37,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:39:37,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:37,995 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:37,995 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:37,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:37,996 INFO L82 PathProgramCache]: Analyzing trace with hash 83225480, now seen corresponding path program 3 times [2019-12-26 22:39:37,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:37,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221879104] [2019-12-26 22:39:37,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:38,296 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:38,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221879104] [2019-12-26 22:39:38,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:38,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:39:38,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527941081] [2019-12-26 22:39:38,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:39:38,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:38,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:39:38,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:39:38,301 INFO L87 Difference]: Start difference. First operand 694 states and 1729 transitions. Second operand 13 states. [2019-12-26 22:39:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:39,998 INFO L93 Difference]: Finished difference Result 2178 states and 5362 transitions. [2019-12-26 22:39:39,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 22:39:39,998 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-26 22:39:39,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:39,999 INFO L225 Difference]: With dead ends: 2178 [2019-12-26 22:39:39,999 INFO L226 Difference]: Without dead ends: 346 [2019-12-26 22:39:40,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 22:39:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-12-26 22:39:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 290. [2019-12-26 22:39:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-12-26 22:39:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 531 transitions. [2019-12-26 22:39:40,005 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 531 transitions. Word has length 59 [2019-12-26 22:39:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:40,005 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 531 transitions. [2019-12-26 22:39:40,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:39:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 531 transitions. [2019-12-26 22:39:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:39:40,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:40,006 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:40,006 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:40,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:40,007 INFO L82 PathProgramCache]: Analyzing trace with hash 211375676, now seen corresponding path program 4 times [2019-12-26 22:39:40,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:40,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826326539] [2019-12-26 22:39:40,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:40,068 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:40,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826326539] [2019-12-26 22:39:40,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:40,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:39:40,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313463999] [2019-12-26 22:39:40,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:39:40,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:40,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:39:40,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:39:40,070 INFO L87 Difference]: Start difference. First operand 290 states and 531 transitions. Second operand 3 states. [2019-12-26 22:39:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:40,079 INFO L93 Difference]: Finished difference Result 269 states and 474 transitions. [2019-12-26 22:39:40,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:39:40,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 22:39:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:40,080 INFO L225 Difference]: With dead ends: 269 [2019-12-26 22:39:40,080 INFO L226 Difference]: Without dead ends: 269 [2019-12-26 22:39:40,081 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:40,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-12-26 22:39:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 237. [2019-12-26 22:39:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-26 22:39:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 414 transitions. [2019-12-26 22:39:40,084 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 414 transitions. Word has length 59 [2019-12-26 22:39:40,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:40,084 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 414 transitions. [2019-12-26 22:39:40,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:39:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 414 transitions. [2019-12-26 22:39:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:39:40,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:40,085 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:40,086 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:40,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:40,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1893006908, now seen corresponding path program 1 times [2019-12-26 22:39:40,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:40,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173266415] [2019-12-26 22:39:40,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:40,522 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:40,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173266415] [2019-12-26 22:39:40,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:40,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:39:40,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39694442] [2019-12-26 22:39:40,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 22:39:40,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:40,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 22:39:40,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:39:40,524 INFO L87 Difference]: Start difference. First operand 237 states and 414 transitions. Second operand 14 states. [2019-12-26 22:39:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:41,027 INFO L93 Difference]: Finished difference Result 403 states and 684 transitions. [2019-12-26 22:39:41,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 22:39:41,028 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-26 22:39:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:41,029 INFO L225 Difference]: With dead ends: 403 [2019-12-26 22:39:41,029 INFO L226 Difference]: Without dead ends: 371 [2019-12-26 22:39:41,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-26 22:39:41,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-26 22:39:41,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 337. [2019-12-26 22:39:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-12-26 22:39:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 585 transitions. [2019-12-26 22:39:41,034 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 585 transitions. Word has length 60 [2019-12-26 22:39:41,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:41,035 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 585 transitions. [2019-12-26 22:39:41,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 22:39:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 585 transitions. [2019-12-26 22:39:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:39:41,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:41,036 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:41,036 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:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:41,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1191078724, now seen corresponding path program 2 times [2019-12-26 22:39:41,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:41,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567054725] [2019-12-26 22:39:41,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:39:41,326 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:41,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567054725] [2019-12-26 22:39:41,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:39:41,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:39:41,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397139422] [2019-12-26 22:39:41,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:39:41,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:39:41,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:39:41,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:39:41,329 INFO L87 Difference]: Start difference. First operand 337 states and 585 transitions. Second operand 12 states. [2019-12-26 22:39:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:39:41,668 INFO L93 Difference]: Finished difference Result 447 states and 750 transitions. [2019-12-26 22:39:41,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 22:39:41,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-26 22:39:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:39:41,670 INFO L225 Difference]: With dead ends: 447 [2019-12-26 22:39:41,670 INFO L226 Difference]: Without dead ends: 415 [2019-12-26 22:39:41,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:39:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-12-26 22:39:41,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 345. [2019-12-26 22:39:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-26 22:39:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 599 transitions. [2019-12-26 22:39:41,675 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 599 transitions. Word has length 60 [2019-12-26 22:39:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:39:41,676 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 599 transitions. [2019-12-26 22:39:41,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:39:41,676 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 599 transitions. [2019-12-26 22:39:41,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:39:41,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:39:41,677 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:41,677 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:41,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:39:41,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1108974140, now seen corresponding path program 3 times [2019-12-26 22:39:41,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:39:41,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394445771] [2019-12-26 22:39:41,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:39:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:39:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:39:41,799 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:39:41,799 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:39:41,803 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) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1181~0.base_19|) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1181~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1181~0.base_19|) |v_ULTIMATE.start_main_~#t1181~0.offset_16| 0)) |v_#memory_int_25|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1181~0.base_19|) 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_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1181~0.base_19| 1)) (= v_~z$r_buff0_thd2~0_88 0) (= v_~z$read_delayed_var~0.offset_7 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1181~0.base_19| 4) |v_#length_29|) (= v_~__unbuffered_p3_EAX~0_243 0) (= 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) (= 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) (= 0 |v_ULTIMATE.start_main_~#t1181~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_#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_#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|, ULTIMATE.start_main_~#t1182~0.base=|v_ULTIMATE.start_main_~#t1182~0.base_22|, ~a~0=v_~a~0_234, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_435, ULTIMATE.start_main_~#t1182~0.offset=|v_ULTIMATE.start_main_~#t1182~0.offset_17|, ~__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_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_69|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_~#t1184~0.offset=|v_ULTIMATE.start_main_~#t1184~0.offset_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ULTIMATE.start_main_~#t1181~0.base=|v_ULTIMATE.start_main_~#t1181~0.base_19|, ~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, ~x~0=v_~x~0_42, ULTIMATE.start_main_~#t1183~0.offset=|v_ULTIMATE.start_main_~#t1183~0.offset_16|, ~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_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, 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_~#t1183~0.base=|v_ULTIMATE.start_main_~#t1183~0.base_21|, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_28|, ~y~0=v_~y~0_38, ~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_~#t1181~0.offset=|v_ULTIMATE.start_main_~#t1181~0.offset_16|, 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, ULTIMATE.start_main_~#t1184~0.base=|v_ULTIMATE.start_main_~#t1184~0.base_22|} AuxVars[] AssignedVars[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_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1182~0.base, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1182~0.offset, ~__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_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_~#t1184~0.offset, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1181~0.base, ~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, ~x~0, ULTIMATE.start_main_~#t1183~0.offset, ~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_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1183~0.base, ULTIMATE.start_main_#t~nondet26, ~y~0, ~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_~#t1181~0.offset, 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, ULTIMATE.start_main_~#t1184~0.base] because there is no mapped edge [2019-12-26 22:39:41,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L833-1-->L835: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1182~0.base_13|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1182~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1182~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1182~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1182~0.base_13|) |v_ULTIMATE.start_main_~#t1182~0.offset_11| 1)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1182~0.base_13| 4)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1182~0.base_13| 1) |v_#valid_48|) (= 0 |v_ULTIMATE.start_main_~#t1182~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1182~0.offset=|v_ULTIMATE.start_main_~#t1182~0.offset_11|, #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|, ULTIMATE.start_main_~#t1182~0.base=|v_ULTIMATE.start_main_~#t1182~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1182~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1182~0.base] because there is no mapped edge [2019-12-26 22:39:41,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1183~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t1183~0.offset_10|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1183~0.base_12| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1183~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1183~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1183~0.base_12|) |v_ULTIMATE.start_main_~#t1183~0.offset_10| 2)) |v_#memory_int_17|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1183~0.base_12| 4) |v_#length_21|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1183~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1183~0.offset=|v_ULTIMATE.start_main_~#t1183~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1183~0.base=|v_ULTIMATE.start_main_~#t1183~0.base_12|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1183~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1183~0.base, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-26 22:39:41,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L837-1-->L839: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1184~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1184~0.base_12|) |v_ULTIMATE.start_main_~#t1184~0.offset_10| 3)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1184~0.offset_10|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1184~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t1184~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1184~0.base_12|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1184~0.base_12| 4)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1184~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1184~0.offset=|v_ULTIMATE.start_main_~#t1184~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_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_~#t1184~0.base=|v_ULTIMATE.start_main_~#t1184~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1184~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1184~0.base] because there is no mapped edge [2019-12-26 22:39:41,808 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:41,808 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:41,809 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:41,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-91848730 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-91848730 256) 0))) (or (and (= ~z$w_buff0_used~0_In-91848730 |P3Thread1of1ForFork3_#t~ite11_Out-91848730|) (or .cse0 .cse1)) (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out-91848730| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-91848730, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-91848730} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-91848730, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-91848730, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-91848730|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-26 22:39:41,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1200377387 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1200377387 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In1200377387 |P2Thread1of1ForFork2_#t~ite3_Out1200377387|)) (and (not .cse0) (= ~z$w_buff1~0_In1200377387 |P2Thread1of1ForFork2_#t~ite3_Out1200377387|) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1200377387, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1200377387, ~z$w_buff1~0=~z$w_buff1~0_In1200377387, ~z~0=~z~0_In1200377387} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1200377387|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1200377387, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1200377387, ~z$w_buff1~0=~z$w_buff1~0_In1200377387, ~z~0=~z~0_In1200377387} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-26 22:39:41,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-12620867 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-12620867 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-12620867 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-12620867 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite12_Out-12620867| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-12620867 |P3Thread1of1ForFork3_#t~ite12_Out-12620867|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-12620867, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-12620867, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-12620867, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-12620867} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-12620867, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-12620867, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-12620867, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-12620867, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-12620867|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-26 22:39:41,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In358735470 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In358735470 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out358735470 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out358735470 ~z$r_buff0_thd4~0_In358735470)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In358735470, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In358735470} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In358735470, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out358735470, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out358735470|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-26 22:39:41,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-398230863 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-398230863 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-398230863 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-398230863 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-398230863|)) (and (= ~z$r_buff1_thd4~0_In-398230863 |P3Thread1of1ForFork3_#t~ite14_Out-398230863|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-398230863, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-398230863, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-398230863, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-398230863} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-398230863, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-398230863, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-398230863|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-398230863, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-398230863} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-26 22:39:41,814 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:41,814 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:41,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1946674698 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1946674698 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1946674698 |P2Thread1of1ForFork2_#t~ite5_Out-1946674698|)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out-1946674698| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1946674698, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1946674698} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1946674698|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1946674698, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1946674698} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 22:39:41,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1377301972 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1377301972 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1377301972 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1377301972 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out1377301972|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite6_Out1377301972| ~z$w_buff1_used~0_In1377301972)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1377301972, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1377301972, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1377301972, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1377301972} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1377301972|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1377301972, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1377301972, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1377301972, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1377301972} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 22:39:41,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1374744469 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1374744469 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out-1374744469| ~z$r_buff0_thd3~0_In-1374744469) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out-1374744469| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1374744469, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1374744469} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1374744469, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1374744469, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1374744469|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-26 22:39:41,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In2054505376 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In2054505376 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In2054505376 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2054505376 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite8_Out2054505376| 0)) (and (= |P2Thread1of1ForFork2_#t~ite8_Out2054505376| ~z$r_buff1_thd3~0_In2054505376) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2054505376, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2054505376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2054505376, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2054505376} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2054505376, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2054505376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2054505376, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2054505376, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out2054505376|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:39:41,817 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:41,818 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:41,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In302948403 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In302948403 256)))) (or (and (= ~z~0_In302948403 |ULTIMATE.start_main_#t~ite19_Out302948403|) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In302948403 |ULTIMATE.start_main_#t~ite19_Out302948403|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In302948403, ~z$w_buff1_used~0=~z$w_buff1_used~0_In302948403, ~z$w_buff1~0=~z$w_buff1~0_In302948403, ~z~0=~z~0_In302948403} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out302948403|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In302948403, ~z$w_buff1_used~0=~z$w_buff1_used~0_In302948403, ~z$w_buff1~0=~z$w_buff1~0_In302948403, ~z~0=~z~0_In302948403} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 22:39:41,819 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:41,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1567808496 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1567808496 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out1567808496| ~z$w_buff0_used~0_In1567808496)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out1567808496|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1567808496, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567808496} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1567808496, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1567808496, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1567808496|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 22:39:41,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1294631990 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1294631990 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1294631990 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1294631990 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1294631990|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1294631990 |ULTIMATE.start_main_#t~ite22_Out1294631990|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1294631990, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1294631990, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1294631990, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1294631990} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1294631990, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1294631990, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1294631990, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1294631990, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1294631990|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 22:39:41,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1133829730 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1133829730 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1133829730|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-1133829730 |ULTIMATE.start_main_#t~ite23_Out-1133829730|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1133829730, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1133829730} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1133829730, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1133829730, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1133829730|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 22:39:41,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In869549149 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In869549149 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In869549149 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In869549149 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite24_Out869549149| ~z$r_buff1_thd0~0_In869549149) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite24_Out869549149| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In869549149, ~z$w_buff0_used~0=~z$w_buff0_used~0_In869549149, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In869549149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In869549149} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In869549149, ~z$w_buff0_used~0=~z$w_buff0_used~0_In869549149, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In869549149, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out869549149|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In869549149} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-26 22:39:41,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1784173835 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1784173835| ~z$w_buff1_used~0_In1784173835) (= |ULTIMATE.start_main_#t~ite39_In1784173835| |ULTIMATE.start_main_#t~ite39_Out1784173835|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite40_Out1784173835| |ULTIMATE.start_main_#t~ite39_Out1784173835|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1784173835 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1784173835 256))) (= 0 (mod ~z$w_buff0_used~0_In1784173835 256)) (and (= (mod ~z$w_buff1_used~0_In1784173835 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out1784173835| ~z$w_buff1_used~0_In1784173835)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1784173835, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1784173835, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In1784173835|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1784173835, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1784173835, ~weak$$choice2~0=~weak$$choice2~0_In1784173835} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1784173835, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1784173835|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1784173835|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1784173835, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1784173835, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1784173835, ~weak$$choice2~0=~weak$$choice2~0_In1784173835} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 22:39:41,830 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:41,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L862-->L862-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1284775913 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1284775913 256) 0))) (or (and .cse0 (= (mod ~z$r_buff1_thd0~0_In-1284775913 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-1284775913 256)) (and (= (mod ~z$w_buff1_used~0_In-1284775913 256) 0) .cse0))) (= |ULTIMATE.start_main_#t~ite45_Out-1284775913| ~z$r_buff1_thd0~0_In-1284775913) (= |ULTIMATE.start_main_#t~ite45_Out-1284775913| |ULTIMATE.start_main_#t~ite46_Out-1284775913|) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite45_In-1284775913| |ULTIMATE.start_main_#t~ite45_Out-1284775913|) (= ~z$r_buff1_thd0~0_In-1284775913 |ULTIMATE.start_main_#t~ite46_Out-1284775913|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1284775913, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1284775913, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1284775913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1284775913, ~weak$$choice2~0=~weak$$choice2~0_In-1284775913, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-1284775913|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1284775913, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1284775913, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1284775913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1284775913, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1284775913|, ~weak$$choice2~0=~weak$$choice2~0_In-1284775913, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1284775913|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:39:41,832 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:41,832 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:41,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:39:41 BasicIcfg [2019-12-26 22:39:41,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:39:41,927 INFO L168 Benchmark]: Toolchain (without parser) took 31255.63 ms. Allocated memory was 144.7 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 100.6 MB in the beginning and 504.1 MB in the end (delta: -403.4 MB). Peak memory consumption was 965.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:39:41,928 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 22:39:41,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.44 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.2 MB in the beginning and 153.9 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:39:41,929 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.44 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:39:41,930 INFO L168 Benchmark]: Boogie Preprocessor took 42.19 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 148.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:39:41,930 INFO L168 Benchmark]: RCFGBuilder took 880.11 ms. Allocated memory is still 202.9 MB. Free memory was 148.4 MB in the beginning and 98.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:39:41,931 INFO L168 Benchmark]: TraceAbstraction took 29466.14 ms. Allocated memory was 202.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 98.6 MB in the beginning and 504.1 MB in the end (delta: -405.5 MB). Peak memory consumption was 904.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:39:41,935 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.23 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.44 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.2 MB in the beginning and 153.9 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.44 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.19 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 148.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 880.11 ms. Allocated memory is still 202.9 MB. Free memory was 148.4 MB in the beginning and 98.6 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29466.14 ms. Allocated memory was 202.9 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 98.6 MB in the beginning and 504.1 MB in the end (delta: -405.5 MB). Peak memory consumption was 904.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 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.6s, 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(&t1181, ((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(&t1182, ((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(&t1183, ((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(&t1184, ((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: 29.1s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1942 SDtfs, 2538 SDslu, 5833 SDs, 0 SdLazy, 3075 SolverSat, 193 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 2.0s 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.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 7466 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 730 ConstructedInterpolants, 0 QuantifiedInterpolants, 217851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...