/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:31:42,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:31:42,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:31:42,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:31:42,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:31:42,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:31:42,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:31:42,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:31:42,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:31:42,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:31:42,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:31:42,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:31:42,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:31:42,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:31:42,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:31:42,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:31:42,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:31:42,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:31:42,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:31:42,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:31:42,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:31:42,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:31:42,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:31:42,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:31:42,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:31:42,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:31:42,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:31:42,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:31:42,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:31:42,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:31:42,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:31:42,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:31:42,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:31:42,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:31:42,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:31:42,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:31:42,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:31:42,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:31:42,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:31:42,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:31:42,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:31:42,459 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:31:42,473 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:31:42,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:31:42,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:31:42,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:31:42,475 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:31:42,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:31:42,476 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:31:42,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:31:42,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:31:42,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:31:42,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:31:42,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:31:42,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:31:42,477 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:31:42,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:31:42,477 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:31:42,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:31:42,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:31:42,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:31:42,478 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:31:42,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:31:42,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:31:42,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:31:42,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:31:42,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:31:42,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:31:42,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:31:42,480 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:31:42,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:31:42,480 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:31:42,805 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:31:42,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:31:42,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:31:42,827 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:31:42,828 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:31:42,829 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2019-12-18 21:31:42,893 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/728f3a580/f08e46070bab4af6a4925e90e59195f3/FLAGa335e15c0 [2019-12-18 21:31:43,439 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:31:43,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2019-12-18 21:31:43,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/728f3a580/f08e46070bab4af6a4925e90e59195f3/FLAGa335e15c0 [2019-12-18 21:31:43,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/728f3a580/f08e46070bab4af6a4925e90e59195f3 [2019-12-18 21:31:43,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:31:43,747 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:31:43,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:31:43,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:31:43,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:31:43,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:31:43" (1/1) ... [2019-12-18 21:31:43,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c488c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:43, skipping insertion in model container [2019-12-18 21:31:43,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:31:43" (1/1) ... [2019-12-18 21:31:43,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:31:43,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:31:44,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:31:44,353 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:31:44,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:31:44,507 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:31:44,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:44 WrapperNode [2019-12-18 21:31:44,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:31:44,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:31:44,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:31:44,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:31:44,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:44" (1/1) ... [2019-12-18 21:31:44,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:44" (1/1) ... [2019-12-18 21:31:44,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:31:44,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:31:44,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:31:44,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:31:44,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:44" (1/1) ... [2019-12-18 21:31:44,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:44" (1/1) ... [2019-12-18 21:31:44,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:44" (1/1) ... [2019-12-18 21:31:44,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:44" (1/1) ... [2019-12-18 21:31:44,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:44" (1/1) ... [2019-12-18 21:31:44,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:44" (1/1) ... [2019-12-18 21:31:44,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:44" (1/1) ... [2019-12-18 21:31:44,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:31:44,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:31:44,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:31:44,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:31:44,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:44" (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-18 21:31:44,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:31:44,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:31:44,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:31:44,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:31:44,703 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:31:44,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:31:44,704 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:31:44,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:31:44,704 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:31:44,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:31:44,704 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:31:44,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:31:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:31:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:31:44,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:31:44,707 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:31:45,464 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:31:45,464 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:31:45,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:31:45 BoogieIcfgContainer [2019-12-18 21:31:45,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:31:45,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:31:45,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:31:45,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:31:45,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:31:43" (1/3) ... [2019-12-18 21:31:45,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bec8e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:31:45, skipping insertion in model container [2019-12-18 21:31:45,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:31:44" (2/3) ... [2019-12-18 21:31:45,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bec8e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:31:45, skipping insertion in model container [2019-12-18 21:31:45,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:31:45" (3/3) ... [2019-12-18 21:31:45,475 INFO L109 eAbstractionObserver]: Analyzing ICFG mix046_power.opt.i [2019-12-18 21:31:45,485 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:31:45,485 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:31:45,493 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:31:45,494 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:31:45,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,532 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,532 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,534 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,534 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,535 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,535 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,543 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,543 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,544 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,544 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,544 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,544 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,545 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,545 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,545 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,546 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,546 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,546 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,546 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,546 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,547 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,547 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,547 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,562 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,563 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,566 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,567 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,567 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,571 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,571 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,573 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,574 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,577 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,577 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,580 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,580 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,581 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:31:45,596 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:31:45,617 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:31:45,617 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:31:45,617 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:31:45,617 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:31:45,618 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:31:45,618 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:31:45,618 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:31:45,618 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:31:45,636 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 21:31:45,638 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 21:31:45,742 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 21:31:45,742 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:31:45,765 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. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:31:45,786 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 21:31:45,873 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 21:31:45,873 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:31:45,879 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. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:31:45,895 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 21:31:45,896 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:31:49,521 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 21:31:49,655 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 21:31:49,676 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54567 [2019-12-18 21:31:49,676 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 21:31:49,680 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 100 transitions [2019-12-18 21:31:52,887 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39550 states. [2019-12-18 21:31:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 39550 states. [2019-12-18 21:31:52,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:31:52,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:52,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:52,898 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-18 21:31:52,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:52,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1832018812, now seen corresponding path program 1 times [2019-12-18 21:31:52,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:52,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358072018] [2019-12-18 21:31:52,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:53,191 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-18 21:31:53,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358072018] [2019-12-18 21:31:53,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:53,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:31:53,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257119696] [2019-12-18 21:31:53,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:31:53,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:53,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:31:53,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:31:53,219 INFO L87 Difference]: Start difference. First operand 39550 states. Second operand 3 states. [2019-12-18 21:31:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:53,834 INFO L93 Difference]: Finished difference Result 36830 states and 156304 transitions. [2019-12-18 21:31:53,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:31:53,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:31:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:54,438 INFO L225 Difference]: With dead ends: 36830 [2019-12-18 21:31:54,439 INFO L226 Difference]: Without dead ends: 36102 [2019-12-18 21:31:54,444 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-18 21:31:54,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-18 21:31:55,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-18 21:31:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-18 21:31:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 153336 transitions. [2019-12-18 21:31:58,104 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 153336 transitions. Word has length 9 [2019-12-18 21:31:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:31:58,104 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 153336 transitions. [2019-12-18 21:31:58,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:31:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 153336 transitions. [2019-12-18 21:31:58,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:31:58,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:31:58,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:31:58,113 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-18 21:31:58,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:31:58,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1657144856, now seen corresponding path program 1 times [2019-12-18 21:31:58,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:31:58,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216225647] [2019-12-18 21:31:58,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:31:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:31:58,256 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-18 21:31:58,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216225647] [2019-12-18 21:31:58,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:31:58,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:31:58,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810390964] [2019-12-18 21:31:58,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:31:58,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:31:58,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:31:58,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:31:58,259 INFO L87 Difference]: Start difference. First operand 36102 states and 153336 transitions. Second operand 4 states. [2019-12-18 21:31:59,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:31:59,114 INFO L93 Difference]: Finished difference Result 56134 states and 230968 transitions. [2019-12-18 21:31:59,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:31:59,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:31:59,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:31:59,859 INFO L225 Difference]: With dead ends: 56134 [2019-12-18 21:31:59,859 INFO L226 Difference]: Without dead ends: 56106 [2019-12-18 21:31:59,860 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-18 21:32:00,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-18 21:32:01,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 50070. [2019-12-18 21:32:01,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50070 states. [2019-12-18 21:32:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50070 states to 50070 states and 208456 transitions. [2019-12-18 21:32:01,785 INFO L78 Accepts]: Start accepts. Automaton has 50070 states and 208456 transitions. Word has length 15 [2019-12-18 21:32:01,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:01,785 INFO L462 AbstractCegarLoop]: Abstraction has 50070 states and 208456 transitions. [2019-12-18 21:32:01,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:32:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 50070 states and 208456 transitions. [2019-12-18 21:32:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:32:01,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:01,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:32:01,789 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-18 21:32:01,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:01,789 INFO L82 PathProgramCache]: Analyzing trace with hash -311678002, now seen corresponding path program 1 times [2019-12-18 21:32:01,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:01,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580512197] [2019-12-18 21:32:01,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:01,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-18 21:32:01,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580512197] [2019-12-18 21:32:01,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:01,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:32:01,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951751426] [2019-12-18 21:32:01,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:32:01,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:01,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:32:01,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:32:01,878 INFO L87 Difference]: Start difference. First operand 50070 states and 208456 transitions. Second operand 3 states. [2019-12-18 21:32:03,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:03,904 INFO L93 Difference]: Finished difference Result 39280 states and 151115 transitions. [2019-12-18 21:32:03,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:32:03,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 21:32:03,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:04,173 INFO L225 Difference]: With dead ends: 39280 [2019-12-18 21:32:04,174 INFO L226 Difference]: Without dead ends: 39280 [2019-12-18 21:32:04,175 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-18 21:32:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39280 states. [2019-12-18 21:32:05,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39280 to 39280. [2019-12-18 21:32:05,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39280 states. [2019-12-18 21:32:05,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39280 states to 39280 states and 151115 transitions. [2019-12-18 21:32:05,347 INFO L78 Accepts]: Start accepts. Automaton has 39280 states and 151115 transitions. Word has length 15 [2019-12-18 21:32:05,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:05,348 INFO L462 AbstractCegarLoop]: Abstraction has 39280 states and 151115 transitions. [2019-12-18 21:32:05,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:32:05,348 INFO L276 IsEmpty]: Start isEmpty. Operand 39280 states and 151115 transitions. [2019-12-18 21:32:05,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:32:05,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:05,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:32:05,350 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-18 21:32:05,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:05,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1094107821, now seen corresponding path program 1 times [2019-12-18 21:32:05,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:05,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143070278] [2019-12-18 21:32:05,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:05,450 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-18 21:32:05,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143070278] [2019-12-18 21:32:05,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:05,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:32:05,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479031287] [2019-12-18 21:32:05,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:32:05,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:05,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:32:05,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:32:05,452 INFO L87 Difference]: Start difference. First operand 39280 states and 151115 transitions. Second operand 4 states. [2019-12-18 21:32:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:05,523 INFO L93 Difference]: Finished difference Result 16344 states and 52151 transitions. [2019-12-18 21:32:05,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:32:05,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:32:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:05,554 INFO L225 Difference]: With dead ends: 16344 [2019-12-18 21:32:05,554 INFO L226 Difference]: Without dead ends: 16344 [2019-12-18 21:32:05,555 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-18 21:32:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2019-12-18 21:32:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 16344. [2019-12-18 21:32:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2019-12-18 21:32:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 52151 transitions. [2019-12-18 21:32:05,888 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 52151 transitions. Word has length 16 [2019-12-18 21:32:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:05,888 INFO L462 AbstractCegarLoop]: Abstraction has 16344 states and 52151 transitions. [2019-12-18 21:32:05,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:32:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 52151 transitions. [2019-12-18 21:32:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:32:05,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:05,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:32:05,890 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-18 21:32:05,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:05,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1111128464, now seen corresponding path program 1 times [2019-12-18 21:32:05,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:05,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392220779] [2019-12-18 21:32:05,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:05,952 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-18 21:32:05,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392220779] [2019-12-18 21:32:05,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:05,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:32:05,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695934591] [2019-12-18 21:32:05,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:32:05,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:05,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:32:05,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:32:05,955 INFO L87 Difference]: Start difference. First operand 16344 states and 52151 transitions. Second operand 5 states. [2019-12-18 21:32:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:05,997 INFO L93 Difference]: Finished difference Result 2799 states and 7236 transitions. [2019-12-18 21:32:05,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:32:05,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 21:32:05,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:06,004 INFO L225 Difference]: With dead ends: 2799 [2019-12-18 21:32:06,004 INFO L226 Difference]: Without dead ends: 2799 [2019-12-18 21:32:06,004 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-18 21:32:06,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-12-18 21:32:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2799. [2019-12-18 21:32:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2799 states. [2019-12-18 21:32:06,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 7236 transitions. [2019-12-18 21:32:06,198 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 7236 transitions. Word has length 17 [2019-12-18 21:32:06,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:06,199 INFO L462 AbstractCegarLoop]: Abstraction has 2799 states and 7236 transitions. [2019-12-18 21:32:06,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:32:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 7236 transitions. [2019-12-18 21:32:06,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:32:06,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:06,203 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-18 21:32:06,204 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-18 21:32:06,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:06,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1318629020, now seen corresponding path program 1 times [2019-12-18 21:32:06,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:06,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270524686] [2019-12-18 21:32:06,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:06,313 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-18 21:32:06,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270524686] [2019-12-18 21:32:06,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:06,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:32:06,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346890483] [2019-12-18 21:32:06,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:32:06,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:06,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:32:06,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:32:06,316 INFO L87 Difference]: Start difference. First operand 2799 states and 7236 transitions. Second operand 6 states. [2019-12-18 21:32:06,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:06,363 INFO L93 Difference]: Finished difference Result 1357 states and 3888 transitions. [2019-12-18 21:32:06,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:32:06,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 21:32:06,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:06,366 INFO L225 Difference]: With dead ends: 1357 [2019-12-18 21:32:06,367 INFO L226 Difference]: Without dead ends: 1357 [2019-12-18 21:32:06,367 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-18 21:32:06,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-18 21:32:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-18 21:32:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 21:32:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3488 transitions. [2019-12-18 21:32:06,387 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3488 transitions. Word has length 29 [2019-12-18 21:32:06,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:06,388 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3488 transitions. [2019-12-18 21:32:06,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:32:06,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3488 transitions. [2019-12-18 21:32:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:32:06,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:06,395 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-18 21:32:06,395 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-18 21:32:06,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:06,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1789262397, now seen corresponding path program 1 times [2019-12-18 21:32:06,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:06,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438074355] [2019-12-18 21:32:06,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:06,527 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-18 21:32:06,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438074355] [2019-12-18 21:32:06,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:06,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:32:06,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772208112] [2019-12-18 21:32:06,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:32:06,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:06,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:32:06,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:32:06,531 INFO L87 Difference]: Start difference. First operand 1217 states and 3488 transitions. Second operand 3 states. [2019-12-18 21:32:06,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:06,584 INFO L93 Difference]: Finished difference Result 1228 states and 3503 transitions. [2019-12-18 21:32:06,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:32:06,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:32:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:06,589 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 21:32:06,589 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 21:32:06,590 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-18 21:32:06,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 21:32:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-18 21:32:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-18 21:32:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3497 transitions. [2019-12-18 21:32:06,617 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3497 transitions. Word has length 58 [2019-12-18 21:32:06,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:06,620 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3497 transitions. [2019-12-18 21:32:06,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:32:06,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3497 transitions. [2019-12-18 21:32:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:32:06,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:06,626 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-18 21:32:06,626 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-18 21:32:06,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:06,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2131195958, now seen corresponding path program 1 times [2019-12-18 21:32:06,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:06,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713775935] [2019-12-18 21:32:06,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:06,797 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-18 21:32:06,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713775935] [2019-12-18 21:32:06,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:06,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:32:06,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43068196] [2019-12-18 21:32:06,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:32:06,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:06,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:32:06,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:32:06,800 INFO L87 Difference]: Start difference. First operand 1222 states and 3497 transitions. Second operand 5 states. [2019-12-18 21:32:07,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:07,025 INFO L93 Difference]: Finished difference Result 1763 states and 5019 transitions. [2019-12-18 21:32:07,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:32:07,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 21:32:07,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:07,029 INFO L225 Difference]: With dead ends: 1763 [2019-12-18 21:32:07,030 INFO L226 Difference]: Without dead ends: 1763 [2019-12-18 21:32:07,030 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-18 21:32:07,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-12-18 21:32:07,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1418. [2019-12-18 21:32:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-18 21:32:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 4073 transitions. [2019-12-18 21:32:07,059 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 4073 transitions. Word has length 58 [2019-12-18 21:32:07,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:07,059 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 4073 transitions. [2019-12-18 21:32:07,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:32:07,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 4073 transitions. [2019-12-18 21:32:07,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:32:07,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:07,064 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-18 21:32:07,065 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-18 21:32:07,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:07,065 INFO L82 PathProgramCache]: Analyzing trace with hash 831744802, now seen corresponding path program 2 times [2019-12-18 21:32:07,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:07,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26697352] [2019-12-18 21:32:07,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:07,217 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-18 21:32:07,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26697352] [2019-12-18 21:32:07,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:07,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:32:07,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645513812] [2019-12-18 21:32:07,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:32:07,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:07,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:32:07,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:32:07,220 INFO L87 Difference]: Start difference. First operand 1418 states and 4073 transitions. Second operand 6 states. [2019-12-18 21:32:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:07,535 INFO L93 Difference]: Finished difference Result 2369 states and 6739 transitions. [2019-12-18 21:32:07,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:32:07,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 21:32:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:07,540 INFO L225 Difference]: With dead ends: 2369 [2019-12-18 21:32:07,541 INFO L226 Difference]: Without dead ends: 2369 [2019-12-18 21:32:07,541 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-18 21:32:07,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-12-18 21:32:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1502. [2019-12-18 21:32:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2019-12-18 21:32:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4321 transitions. [2019-12-18 21:32:07,571 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4321 transitions. Word has length 58 [2019-12-18 21:32:07,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:07,572 INFO L462 AbstractCegarLoop]: Abstraction has 1502 states and 4321 transitions. [2019-12-18 21:32:07,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:32:07,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4321 transitions. [2019-12-18 21:32:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:32:07,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:07,577 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-18 21:32:07,577 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-18 21:32:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1828606006, now seen corresponding path program 3 times [2019-12-18 21:32:07,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:07,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730146006] [2019-12-18 21:32:07,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:07,689 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-18 21:32:07,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730146006] [2019-12-18 21:32:07,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:07,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:32:07,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078704645] [2019-12-18 21:32:07,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:32:07,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:07,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:32:07,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:32:07,691 INFO L87 Difference]: Start difference. First operand 1502 states and 4321 transitions. Second operand 6 states. [2019-12-18 21:32:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:08,061 INFO L93 Difference]: Finished difference Result 2376 states and 6757 transitions. [2019-12-18 21:32:08,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:32:08,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 21:32:08,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:08,068 INFO L225 Difference]: With dead ends: 2376 [2019-12-18 21:32:08,068 INFO L226 Difference]: Without dead ends: 2376 [2019-12-18 21:32:08,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:32:08,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-12-18 21:32:08,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1690. [2019-12-18 21:32:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-12-18 21:32:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 4865 transitions. [2019-12-18 21:32:08,102 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 4865 transitions. Word has length 58 [2019-12-18 21:32:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:08,102 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 4865 transitions. [2019-12-18 21:32:08,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:32:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 4865 transitions. [2019-12-18 21:32:08,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:32:08,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:08,106 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-18 21:32:08,107 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-18 21:32:08,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:08,107 INFO L82 PathProgramCache]: Analyzing trace with hash 361631606, now seen corresponding path program 4 times [2019-12-18 21:32:08,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:08,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060324507] [2019-12-18 21:32:08,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:08,231 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-18 21:32:08,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060324507] [2019-12-18 21:32:08,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:08,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:32:08,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147591062] [2019-12-18 21:32:08,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:32:08,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:08,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:32:08,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:32:08,233 INFO L87 Difference]: Start difference. First operand 1690 states and 4865 transitions. Second operand 7 states. [2019-12-18 21:32:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:08,685 INFO L93 Difference]: Finished difference Result 2633 states and 7491 transitions. [2019-12-18 21:32:08,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:32:08,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-18 21:32:08,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:08,691 INFO L225 Difference]: With dead ends: 2633 [2019-12-18 21:32:08,691 INFO L226 Difference]: Without dead ends: 2633 [2019-12-18 21:32:08,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:32:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2019-12-18 21:32:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 1606. [2019-12-18 21:32:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2019-12-18 21:32:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 4617 transitions. [2019-12-18 21:32:08,722 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 4617 transitions. Word has length 58 [2019-12-18 21:32:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:08,724 INFO L462 AbstractCegarLoop]: Abstraction has 1606 states and 4617 transitions. [2019-12-18 21:32:08,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:32:08,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 4617 transitions. [2019-12-18 21:32:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:32:08,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:08,728 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-18 21:32:08,728 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-18 21:32:08,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:08,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1130563328, now seen corresponding path program 1 times [2019-12-18 21:32:08,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:08,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978918358] [2019-12-18 21:32:08,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:08,836 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-18 21:32:08,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978918358] [2019-12-18 21:32:08,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:08,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:32:08,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555530063] [2019-12-18 21:32:08,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:32:08,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:08,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:32:08,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:32:08,838 INFO L87 Difference]: Start difference. First operand 1606 states and 4617 transitions. Second operand 3 states. [2019-12-18 21:32:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:08,885 INFO L93 Difference]: Finished difference Result 1605 states and 4615 transitions. [2019-12-18 21:32:08,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:32:08,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:32:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:08,888 INFO L225 Difference]: With dead ends: 1605 [2019-12-18 21:32:08,889 INFO L226 Difference]: Without dead ends: 1605 [2019-12-18 21:32:08,889 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-18 21:32:08,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2019-12-18 21:32:08,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1080. [2019-12-18 21:32:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2019-12-18 21:32:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3133 transitions. [2019-12-18 21:32:08,909 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3133 transitions. Word has length 59 [2019-12-18 21:32:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:08,910 INFO L462 AbstractCegarLoop]: Abstraction has 1080 states and 3133 transitions. [2019-12-18 21:32:08,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:32:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3133 transitions. [2019-12-18 21:32:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:32:08,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:08,913 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-18 21:32:08,913 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-18 21:32:08,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:08,913 INFO L82 PathProgramCache]: Analyzing trace with hash 226928645, now seen corresponding path program 1 times [2019-12-18 21:32:08,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:08,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947416083] [2019-12-18 21:32:08,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:08,991 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-18 21:32:08,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947416083] [2019-12-18 21:32:08,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:08,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:32:08,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331292830] [2019-12-18 21:32:08,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:32:08,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:08,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:32:08,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:32:08,993 INFO L87 Difference]: Start difference. First operand 1080 states and 3133 transitions. Second operand 3 states. [2019-12-18 21:32:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:09,008 INFO L93 Difference]: Finished difference Result 1020 states and 2889 transitions. [2019-12-18 21:32:09,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:32:09,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:32:09,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:09,010 INFO L225 Difference]: With dead ends: 1020 [2019-12-18 21:32:09,011 INFO L226 Difference]: Without dead ends: 1020 [2019-12-18 21:32:09,013 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-18 21:32:09,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-12-18 21:32:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 956. [2019-12-18 21:32:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-12-18 21:32:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2705 transitions. [2019-12-18 21:32:09,032 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2705 transitions. Word has length 59 [2019-12-18 21:32:09,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:09,032 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2705 transitions. [2019-12-18 21:32:09,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:32:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2705 transitions. [2019-12-18 21:32:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:32:09,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:09,034 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-18 21:32:09,035 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-18 21:32:09,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:09,035 INFO L82 PathProgramCache]: Analyzing trace with hash 692943471, now seen corresponding path program 1 times [2019-12-18 21:32:09,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:09,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008706620] [2019-12-18 21:32:09,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:09,303 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-18 21:32:09,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008706620] [2019-12-18 21:32:09,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:09,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:32:09,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007411226] [2019-12-18 21:32:09,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:32:09,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:09,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:32:09,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:32:09,306 INFO L87 Difference]: Start difference. First operand 956 states and 2705 transitions. Second operand 10 states. [2019-12-18 21:32:09,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:09,718 INFO L93 Difference]: Finished difference Result 1859 states and 4911 transitions. [2019-12-18 21:32:09,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:32:09,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-12-18 21:32:09,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:09,721 INFO L225 Difference]: With dead ends: 1859 [2019-12-18 21:32:09,721 INFO L226 Difference]: Without dead ends: 1277 [2019-12-18 21:32:09,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:32:09,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2019-12-18 21:32:09,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 830. [2019-12-18 21:32:09,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-12-18 21:32:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2281 transitions. [2019-12-18 21:32:09,739 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 2281 transitions. Word has length 60 [2019-12-18 21:32:09,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:09,739 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 2281 transitions. [2019-12-18 21:32:09,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:32:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 2281 transitions. [2019-12-18 21:32:09,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:32:09,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:09,742 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-18 21:32:09,742 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-18 21:32:09,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:09,742 INFO L82 PathProgramCache]: Analyzing trace with hash -40355053, now seen corresponding path program 2 times [2019-12-18 21:32:09,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:09,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601618161] [2019-12-18 21:32:09,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:09,866 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-18 21:32:09,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601618161] [2019-12-18 21:32:09,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:09,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:32:09,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527487070] [2019-12-18 21:32:09,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:32:09,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:09,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:32:09,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:32:09,868 INFO L87 Difference]: Start difference. First operand 830 states and 2281 transitions. Second operand 6 states. [2019-12-18 21:32:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:09,928 INFO L93 Difference]: Finished difference Result 1039 states and 2657 transitions. [2019-12-18 21:32:09,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:32:09,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 21:32:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:09,930 INFO L225 Difference]: With dead ends: 1039 [2019-12-18 21:32:09,930 INFO L226 Difference]: Without dead ends: 604 [2019-12-18 21:32:09,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:32:09,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-12-18 21:32:09,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-12-18 21:32:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 21:32:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1458 transitions. [2019-12-18 21:32:09,943 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1458 transitions. Word has length 60 [2019-12-18 21:32:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:09,943 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1458 transitions. [2019-12-18 21:32:09,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:32:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1458 transitions. [2019-12-18 21:32:09,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:32:09,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:09,945 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-18 21:32:09,945 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-18 21:32:09,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:09,945 INFO L82 PathProgramCache]: Analyzing trace with hash -528056523, now seen corresponding path program 3 times [2019-12-18 21:32:09,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:09,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185940094] [2019-12-18 21:32:09,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:10,082 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-18 21:32:10,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185940094] [2019-12-18 21:32:10,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:10,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:32:10,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391795824] [2019-12-18 21:32:10,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:32:10,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:10,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:32:10,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:32:10,087 INFO L87 Difference]: Start difference. First operand 604 states and 1458 transitions. Second operand 6 states. [2019-12-18 21:32:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:10,163 INFO L93 Difference]: Finished difference Result 889 states and 2055 transitions. [2019-12-18 21:32:10,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:32:10,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 21:32:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:10,164 INFO L225 Difference]: With dead ends: 889 [2019-12-18 21:32:10,164 INFO L226 Difference]: Without dead ends: 260 [2019-12-18 21:32:10,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:32:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-18 21:32:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 236. [2019-12-18 21:32:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-18 21:32:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 419 transitions. [2019-12-18 21:32:10,169 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 419 transitions. Word has length 60 [2019-12-18 21:32:10,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:10,169 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 419 transitions. [2019-12-18 21:32:10,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:32:10,170 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 419 transitions. [2019-12-18 21:32:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:32:10,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:10,171 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-18 21:32:10,171 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-18 21:32:10,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:10,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1833326427, now seen corresponding path program 4 times [2019-12-18 21:32:10,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:10,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205238982] [2019-12-18 21:32:10,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:32:10,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205238982] [2019-12-18 21:32:10,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:10,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:32:10,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718333980] [2019-12-18 21:32:10,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:32:10,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:10,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:32:10,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:32:10,446 INFO L87 Difference]: Start difference. First operand 236 states and 419 transitions. Second operand 14 states. [2019-12-18 21:32:11,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:11,036 INFO L93 Difference]: Finished difference Result 401 states and 694 transitions. [2019-12-18 21:32:11,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 21:32:11,036 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-18 21:32:11,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:11,037 INFO L225 Difference]: With dead ends: 401 [2019-12-18 21:32:11,037 INFO L226 Difference]: Without dead ends: 370 [2019-12-18 21:32:11,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-12-18 21:32:11,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-12-18 21:32:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 336. [2019-12-18 21:32:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-18 21:32:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 590 transitions. [2019-12-18 21:32:11,043 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 590 transitions. Word has length 60 [2019-12-18 21:32:11,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:11,043 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 590 transitions. [2019-12-18 21:32:11,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:32:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 590 transitions. [2019-12-18 21:32:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:32:11,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:11,044 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-18 21:32:11,045 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-18 21:32:11,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:11,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1131398243, now seen corresponding path program 5 times [2019-12-18 21:32:11,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:11,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815165251] [2019-12-18 21:32:11,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:11,696 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-18 21:32:11,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815165251] [2019-12-18 21:32:11,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:11,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 21:32:11,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828786285] [2019-12-18 21:32:11,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 21:32:11,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:11,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 21:32:11,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-12-18 21:32:11,699 INFO L87 Difference]: Start difference. First operand 336 states and 590 transitions. Second operand 21 states. [2019-12-18 21:32:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:13,388 INFO L93 Difference]: Finished difference Result 718 states and 1244 transitions. [2019-12-18 21:32:13,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 21:32:13,388 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-12-18 21:32:13,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:13,389 INFO L225 Difference]: With dead ends: 718 [2019-12-18 21:32:13,390 INFO L226 Difference]: Without dead ends: 687 [2019-12-18 21:32:13,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=335, Invalid=1471, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 21:32:13,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-12-18 21:32:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 352. [2019-12-18 21:32:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-12-18 21:32:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 621 transitions. [2019-12-18 21:32:13,396 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 621 transitions. Word has length 60 [2019-12-18 21:32:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:13,396 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 621 transitions. [2019-12-18 21:32:13,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 21:32:13,397 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 621 transitions. [2019-12-18 21:32:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:32:13,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:13,397 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-18 21:32:13,397 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:32:13,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:13,398 INFO L82 PathProgramCache]: Analyzing trace with hash -66309019, now seen corresponding path program 6 times [2019-12-18 21:32:13,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:13,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845451648] [2019-12-18 21:32:13,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:13,738 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-18 21:32:13,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845451648] [2019-12-18 21:32:13,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:13,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 21:32:13,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359284334] [2019-12-18 21:32:13,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 21:32:13,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:13,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 21:32:13,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:32:13,741 INFO L87 Difference]: Start difference. First operand 352 states and 621 transitions. Second operand 15 states. [2019-12-18 21:32:14,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:14,549 INFO L93 Difference]: Finished difference Result 584 states and 987 transitions. [2019-12-18 21:32:14,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:32:14,550 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-18 21:32:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:14,551 INFO L225 Difference]: With dead ends: 584 [2019-12-18 21:32:14,551 INFO L226 Difference]: Without dead ends: 553 [2019-12-18 21:32:14,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-18 21:32:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-12-18 21:32:14,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 346. [2019-12-18 21:32:14,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-12-18 21:32:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 608 transitions. [2019-12-18 21:32:14,557 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 608 transitions. Word has length 60 [2019-12-18 21:32:14,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:14,557 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 608 transitions. [2019-12-18 21:32:14,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 21:32:14,557 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 608 transitions. [2019-12-18 21:32:14,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:32:14,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:14,558 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-18 21:32:14,559 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:32:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:14,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1330572061, now seen corresponding path program 7 times [2019-12-18 21:32:14,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:14,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963690739] [2019-12-18 21:32:14,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:14,810 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-18 21:32:14,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963690739] [2019-12-18 21:32:14,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:14,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:32:14,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178548320] [2019-12-18 21:32:14,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:32:14,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:14,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:32:14,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:32:14,812 INFO L87 Difference]: Start difference. First operand 346 states and 608 transitions. Second operand 14 states. [2019-12-18 21:32:15,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:32:15,238 INFO L93 Difference]: Finished difference Result 455 states and 778 transitions. [2019-12-18 21:32:15,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:32:15,239 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-18 21:32:15,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:32:15,240 INFO L225 Difference]: With dead ends: 455 [2019-12-18 21:32:15,240 INFO L226 Difference]: Without dead ends: 424 [2019-12-18 21:32:15,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:32:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-12-18 21:32:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 344. [2019-12-18 21:32:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-18 21:32:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 604 transitions. [2019-12-18 21:32:15,245 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 604 transitions. Word has length 60 [2019-12-18 21:32:15,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:32:15,245 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 604 transitions. [2019-12-18 21:32:15,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:32:15,246 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 604 transitions. [2019-12-18 21:32:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:32:15,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:15,246 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-18 21:32:15,247 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:32:15,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:15,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1060183003, now seen corresponding path program 8 times [2019-12-18 21:32:15,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:15,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572791315] [2019-12-18 21:32:15,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:32:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:32:15,360 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:32:15,360 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:32:15,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_47) (= 0 v_~a~0_9) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p3_EAX~0_10) (= |v_#NULL.offset_7| 0) (= |v_ULTIMATE.start_main_~#t1221~0.offset_16| 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1221~0.base_19| 4)) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$mem_tmp~0_11 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (< 0 |v_#StackHeapBarrier_21|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1221~0.base_19| 1) |v_#valid_70|) (= 0 v_~z$r_buff1_thd4~0_16) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1221~0.base_19|) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~b~0_11 0) (= 0 v_~z$w_buff1~0_22) (= 0 v_~z$flush_delayed~0_16) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$w_buff1_used~0_62) (= (select .cse0 |v_ULTIMATE.start_main_~#t1221~0.base_19|) 0) (= v_~z$r_buff0_thd4~0_24 0) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= v_~z$r_buff0_thd0~0_80 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1221~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1221~0.base_19|) |v_ULTIMATE.start_main_~#t1221~0.offset_16| 0)) |v_#memory_int_25|) (= v_~z$r_buff0_thd2~0_9 0) (= v_~y~0_10 0) (= 0 v_~z$w_buff0~0_25) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 v_~__unbuffered_p3_EBX~0_10))) 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_12|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start_main_~#t1223~0.offset=|v_ULTIMATE.start_main_~#t1223~0.offset_16|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_29|, ULTIMATE.start_main_~#t1222~0.base=|v_ULTIMATE.start_main_~#t1222~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_~#t1223~0.base=|v_ULTIMATE.start_main_~#t1223~0.base_21|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_62, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, 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_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_11, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_13|, ULTIMATE.start_main_~#t1224~0.offset=|v_ULTIMATE.start_main_~#t1224~0.offset_17|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~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_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_~#t1224~0.base=|v_ULTIMATE.start_main_~#t1224~0.base_22|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_~#t1222~0.offset=|v_ULTIMATE.start_main_~#t1222~0.offset_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_~#t1221~0.base=|v_ULTIMATE.start_main_~#t1221~0.base_19|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, ULTIMATE.start_main_~#t1221~0.offset=|v_ULTIMATE.start_main_~#t1221~0.offset_16|, #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_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8} 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, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1223~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1222~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1223~0.base, 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_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1224~0.offset, ~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_~#t1224~0.base, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, 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_~#t1222~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1221~0.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t1221~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:32:15,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L833-1-->L835: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1222~0.base_13| 4) |v_#length_23|) (= 0 |v_ULTIMATE.start_main_~#t1222~0.offset_11|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1222~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1222~0.base_13|) |v_ULTIMATE.start_main_~#t1222~0.offset_11| 1)) |v_#memory_int_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1222~0.base_13|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1222~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t1222~0.base_13| 0)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1222~0.base_13| 1))) 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_~#t1222~0.offset=|v_ULTIMATE.start_main_~#t1222~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_~#t1222~0.base=|v_ULTIMATE.start_main_~#t1222~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1222~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1222~0.base] because there is no mapped edge [2019-12-18 21:32:15,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1223~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1223~0.base_12| 0)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1223~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t1223~0.offset_10|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1223~0.base_12|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1223~0.base_12| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1223~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1223~0.base_12|) |v_ULTIMATE.start_main_~#t1223~0.offset_10| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1223~0.base=|v_ULTIMATE.start_main_~#t1223~0.base_12|, ULTIMATE.start_main_~#t1223~0.offset=|v_ULTIMATE.start_main_~#t1223~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1223~0.base, ULTIMATE.start_main_~#t1223~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 21:32:15,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L837-1-->L839: Formula: (and (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1224~0.base_12|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1224~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1224~0.base_12|) |v_ULTIMATE.start_main_~#t1224~0.offset_10| 3)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1224~0.base_12| 4) |v_#length_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1224~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1224~0.base_12|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1224~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t1224~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1224~0.offset=|v_ULTIMATE.start_main_~#t1224~0.offset_10|, #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_~#t1224~0.base=|v_ULTIMATE.start_main_~#t1224~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1224~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1224~0.base] because there is no mapped edge [2019-12-18 21:32:15,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= 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) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_15 1) (= v_~z$r_buff0_thd4~0_16 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff0_thd3~0_15 v_~z$r_buff1_thd3~0_11) (= v_~z$r_buff0_thd0~0_46 v_~z$r_buff1_thd0~0_26)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~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_10, ~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_46, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~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_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~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-18 21:32:15,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 1 v_~b~0_7) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~x~0_6) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_6} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_6, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:32:15,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 1 v_~y~0_6) (= 1 v_~x~0_7) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_6, ~x~0=v_~x~0_7, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:32:15,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In113096309 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In113096309 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out113096309|) (not .cse1)) (and (= ~z$w_buff0_used~0_In113096309 |P3Thread1of1ForFork3_#t~ite11_Out113096309|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In113096309, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In113096309} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In113096309, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In113096309, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out113096309|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:32:15,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1501161199 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1501161199 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1501161199 |P2Thread1of1ForFork2_#t~ite3_Out-1501161199|)) (and (= ~z~0_In-1501161199 |P2Thread1of1ForFork2_#t~ite3_Out-1501161199|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1501161199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1501161199, ~z$w_buff1~0=~z$w_buff1~0_In-1501161199, ~z~0=~z~0_In-1501161199} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1501161199|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1501161199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1501161199, ~z$w_buff1~0=~z$w_buff1~0_In-1501161199, ~z~0=~z~0_In-1501161199} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:32:15,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-620713752 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-620713752 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-620713752 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-620713752 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-620713752|)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-620713752 |P3Thread1of1ForFork3_#t~ite12_Out-620713752|) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-620713752, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-620713752, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-620713752, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-620713752} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-620713752, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-620713752, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-620713752, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-620713752, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-620713752|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 21:32:15,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In280945540 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In280945540 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out280945540 0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out280945540 ~z$r_buff0_thd4~0_In280945540) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In280945540, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In280945540} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In280945540, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out280945540, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out280945540|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 21:32:15,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-632395137 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-632395137 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-632395137 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-632395137 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out-632395137| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork3_#t~ite14_Out-632395137| ~z$r_buff1_thd4~0_In-632395137) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-632395137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-632395137, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-632395137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-632395137} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-632395137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-632395137, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-632395137|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-632395137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-632395137} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 21:32:15,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_11) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_11, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, 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-18 21:32:15,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 21:32:15,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-685995173 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-685995173 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out-685995173| 0)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out-685995173| ~z$w_buff0_used~0_In-685995173) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-685995173, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-685995173} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-685995173|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-685995173, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-685995173} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:32:15,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1107122601 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1107122601 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1107122601 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1107122601 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite6_Out-1107122601| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite6_Out-1107122601| ~z$w_buff1_used~0_In-1107122601)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1107122601, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1107122601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1107122601, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1107122601} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1107122601|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1107122601, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1107122601, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1107122601, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1107122601} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:32:15,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-346717072 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-346717072 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-346717072|) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out-346717072| ~z$r_buff0_thd3~0_In-346717072)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-346717072, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-346717072} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-346717072, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-346717072, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-346717072|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:32:15,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In644224973 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In644224973 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In644224973 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In644224973 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite8_Out644224973| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite8_Out644224973| ~z$r_buff1_thd3~0_In644224973) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In644224973, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In644224973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In644224973, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In644224973} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In644224973, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In644224973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In644224973, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In644224973, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out644224973|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:32:15,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} 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-18 21:32:15,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 21:32:15,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2146565527 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2146565527 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out2146565527| ~z$w_buff1~0_In2146565527) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite19_Out2146565527| ~z~0_In2146565527) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2146565527, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2146565527, ~z$w_buff1~0=~z$w_buff1~0_In2146565527, ~z~0=~z~0_In2146565527} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2146565527|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2146565527, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2146565527, ~z$w_buff1~0=~z$w_buff1~0_In2146565527, ~z~0=~z~0_In2146565527} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:32:15,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_16 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_16, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:32:15,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1299225473 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1299225473 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1299225473| 0)) (and (= |ULTIMATE.start_main_#t~ite21_Out-1299225473| ~z$w_buff0_used~0_In-1299225473) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1299225473, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1299225473} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1299225473, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1299225473, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1299225473|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:32:15,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1989931765 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1989931765 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1989931765 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1989931765 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out1989931765| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1989931765 |ULTIMATE.start_main_#t~ite22_Out1989931765|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1989931765, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1989931765, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1989931765, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1989931765} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1989931765, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1989931765, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1989931765, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1989931765, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1989931765|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:32:15,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1558499306 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1558499306 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out1558499306| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite23_Out1558499306| ~z$r_buff0_thd0~0_In1558499306) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1558499306, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1558499306} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1558499306, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1558499306, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1558499306|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:32:15,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-748670819 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-748670819 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-748670819 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-748670819 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-748670819| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite24_Out-748670819| ~z$r_buff1_thd0~0_In-748670819) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-748670819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-748670819, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-748670819, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-748670819} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-748670819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-748670819, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-748670819, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-748670819|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-748670819} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 21:32:15,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-524704688 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-524704688| |ULTIMATE.start_main_#t~ite40_Out-524704688|) .cse0 (= |ULTIMATE.start_main_#t~ite39_Out-524704688| ~z$w_buff1_used~0_In-524704688) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-524704688 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-524704688 256))) (= 0 (mod ~z$w_buff0_used~0_In-524704688 256)) (and (= 0 (mod ~z$r_buff1_thd0~0_In-524704688 256)) .cse1)))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite39_In-524704688| |ULTIMATE.start_main_#t~ite39_Out-524704688|) (= ~z$w_buff1_used~0_In-524704688 |ULTIMATE.start_main_#t~ite40_Out-524704688|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-524704688, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-524704688, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-524704688|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-524704688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-524704688, ~weak$$choice2~0=~weak$$choice2~0_In-524704688} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-524704688, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-524704688|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-524704688|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-524704688, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-524704688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-524704688, ~weak$$choice2~0=~weak$$choice2~0_In-524704688} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:32:15,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_60) (not (= (mod v_~weak$$choice2~0_18 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} 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-18 21:32:15,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L862-->L862-8: Formula: (let ((.cse4 (= 0 (mod ~z$w_buff0_used~0_In-961484230 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-961484230 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-961484230 256))) (.cse6 (= (mod ~z$r_buff0_thd0~0_In-961484230 256) 0)) (.cse5 (= |ULTIMATE.start_main_#t~ite46_Out-961484230| |ULTIMATE.start_main_#t~ite45_Out-961484230|)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-961484230 256)))) (or (let ((.cse2 (not .cse6))) (and .cse0 (or (not .cse1) .cse2) (= |ULTIMATE.start_main_#t~ite44_Out-961484230| |ULTIMATE.start_main_#t~ite45_Out-961484230|) (or (not .cse3) .cse2) (not .cse4) (= 0 |ULTIMATE.start_main_#t~ite44_Out-961484230|) .cse5)) (and (or (and .cse0 (or .cse4 (and .cse3 .cse6) (and .cse1 .cse6)) (= ~z$r_buff1_thd0~0_In-961484230 |ULTIMATE.start_main_#t~ite45_Out-961484230|) .cse5) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In-961484230| |ULTIMATE.start_main_#t~ite45_Out-961484230|) (= |ULTIMATE.start_main_#t~ite46_Out-961484230| ~z$r_buff1_thd0~0_In-961484230))) (= |ULTIMATE.start_main_#t~ite44_In-961484230| |ULTIMATE.start_main_#t~ite44_Out-961484230|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-961484230, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-961484230, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-961484230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-961484230, ~weak$$choice2~0=~weak$$choice2~0_In-961484230, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-961484230|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-961484230|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-961484230, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-961484230, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-961484230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-961484230, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-961484230|, ~weak$$choice2~0=~weak$$choice2~0_In-961484230, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-961484230|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-961484230|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:32:15,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L864-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (not (= 0 (mod v_~z$flush_delayed~0_12 256))) (= v_~z~0_23 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_23, 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-18 21:32:15,393 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-18 21:32:15,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:32:15 BasicIcfg [2019-12-18 21:32:15,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:32:15,495 INFO L168 Benchmark]: Toolchain (without parser) took 31749.28 ms. Allocated memory was 145.2 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 101.6 MB in the beginning and 740.5 MB in the end (delta: -638.9 MB). Peak memory consumption was 705.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:32:15,496 INFO L168 Benchmark]: CDTParser took 0.83 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 21:32:15,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.18 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.2 MB in the beginning and 155.4 MB in the end (delta: -54.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:32:15,497 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.66 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:32:15,499 INFO L168 Benchmark]: Boogie Preprocessor took 38.83 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:32:15,499 INFO L168 Benchmark]: RCFGBuilder took 845.09 ms. Allocated memory is still 202.4 MB. Free memory was 150.1 MB in the beginning and 100.4 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:32:15,500 INFO L168 Benchmark]: TraceAbstraction took 30026.17 ms. Allocated memory was 202.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 100.4 MB in the beginning and 740.5 MB in the end (delta: -640.1 MB). Peak memory consumption was 647.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:32:15,509 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.83 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.18 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.2 MB in the beginning and 155.4 MB in the end (delta: -54.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.66 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.83 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 150.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 845.09 ms. Allocated memory is still 202.4 MB. Free memory was 150.1 MB in the beginning and 100.4 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30026.17 ms. Allocated memory was 202.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 100.4 MB in the beginning and 740.5 MB in the end (delta: -640.1 MB). Peak memory consumption was 647.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 181 ProgramPointsBefore, 93 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4801 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54567 CheckedPairsTotal, 117 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(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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_p0_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=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=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 = 2 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_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=1, y=2, 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_p0_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=1, y=2, 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_p0_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=1, y=2, 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_p0_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=1, y=2, 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_p0_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=1, y=2, 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_p0_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=1, y=2, 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_p0_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=1, y=2, 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_p0_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=1, y=2, 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 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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=1, y=2, 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.7s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2222 SDtfs, 2578 SDslu, 6944 SDs, 0 SdLazy, 4051 SolverSat, 218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 37 SyntacticMatches, 19 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50070occurred 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: 7.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 10823 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 989 NumberOfCodeBlocks, 989 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 909 ConstructedInterpolants, 0 QuantifiedInterpolants, 238339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...