/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:15:09,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:15:09,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:15:09,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:15:09,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:15:09,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:15:09,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:15:09,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:15:09,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:15:09,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:15:09,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:15:09,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:15:09,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:15:09,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:15:09,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:15:09,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:15:09,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:15:09,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:15:09,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:15:09,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:15:09,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:15:09,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:15:09,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:15:09,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:15:09,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:15:09,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:15:09,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:15:09,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:15:09,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:15:09,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:15:09,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:15:09,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:15:09,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:15:09,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:15:09,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:15:09,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:15:09,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:15:09,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:15:09,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:15:09,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:15:09,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:15:09,595 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:15:09,629 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:15:09,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:15:09,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:15:09,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:15:09,634 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:15:09,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:15:09,635 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:15:09,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:15:09,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:15:09,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:15:09,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:15:09,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:15:09,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:15:09,636 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:15:09,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:15:09,636 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:15:09,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:15:09,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:15:09,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:15:09,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:15:09,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:15:09,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:15:09,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:15:09,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:15:09,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:15:09,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:15:09,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:15:09,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:15:09,639 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:15:09,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:15:09,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:15:09,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:15:09,927 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:15:09,927 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:15:09,928 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt.i [2019-12-18 17:15:09,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/659005541/7a4ac431af1f4a958684f563f0bb56ae/FLAGcb917300d [2019-12-18 17:15:10,585 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:15:10,589 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt.i [2019-12-18 17:15:10,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/659005541/7a4ac431af1f4a958684f563f0bb56ae/FLAGcb917300d [2019-12-18 17:15:10,849 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/659005541/7a4ac431af1f4a958684f563f0bb56ae [2019-12-18 17:15:10,860 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:15:10,862 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:15:10,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:15:10,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:15:10,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:15:10,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:15:10" (1/1) ... [2019-12-18 17:15:10,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c513ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:10, skipping insertion in model container [2019-12-18 17:15:10,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:15:10" (1/1) ... [2019-12-18 17:15:10,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:15:10,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:15:11,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:15:11,428 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:15:11,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:15:11,591 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:15:11,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:11 WrapperNode [2019-12-18 17:15:11,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:15:11,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:15:11,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:15:11,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:15:11,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:11" (1/1) ... [2019-12-18 17:15:11,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:11" (1/1) ... [2019-12-18 17:15:11,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:15:11,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:15:11,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:15:11,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:15:11,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:11" (1/1) ... [2019-12-18 17:15:11,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:11" (1/1) ... [2019-12-18 17:15:11,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:11" (1/1) ... [2019-12-18 17:15:11,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:11" (1/1) ... [2019-12-18 17:15:11,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:11" (1/1) ... [2019-12-18 17:15:11,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:11" (1/1) ... [2019-12-18 17:15:11,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:11" (1/1) ... [2019-12-18 17:15:11,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:15:11,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:15:11,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:15:11,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:15:11,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:15:11,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:15:11,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:15:11,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:15:11,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:15:11,763 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:15:11,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:15:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:15:11,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:15:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:15:11,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:15:11,764 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:15:11,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:15:11,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:15:11,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:15:11,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:15:11,766 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 17:15:12,509 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:15:12,509 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:15:12,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:15:12 BoogieIcfgContainer [2019-12-18 17:15:12,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:15:12,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:15:12,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:15:12,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:15:12,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:15:10" (1/3) ... [2019-12-18 17:15:12,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5f242a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:15:12, skipping insertion in model container [2019-12-18 17:15:12,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:11" (2/3) ... [2019-12-18 17:15:12,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5f242a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:15:12, skipping insertion in model container [2019-12-18 17:15:12,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:15:12" (3/3) ... [2019-12-18 17:15:12,521 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt.i [2019-12-18 17:15:12,533 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:15:12,534 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:15:12,543 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:15:12,544 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:15:12,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,588 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,588 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,590 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,590 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,593 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,593 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,618 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,618 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,618 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,619 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,619 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,619 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,619 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,620 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,620 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,620 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,621 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,621 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,621 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,621 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,622 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,622 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,622 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,630 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,631 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,667 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,668 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,673 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,674 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,674 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,674 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,674 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,674 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,675 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,675 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,676 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,678 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,679 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:12,694 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:15:12,713 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:15:12,713 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:15:12,713 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:15:12,713 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:15:12,713 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:15:12,713 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:15:12,714 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:15:12,714 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:15:12,731 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 193 transitions [2019-12-18 17:15:12,733 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-18 17:15:12,819 INFO L126 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-18 17:15:12,819 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:15:12,837 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 355 event pairs. 12/164 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 17:15:12,859 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-18 17:15:12,937 INFO L126 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-18 17:15:12,937 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:15:12,947 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 355 event pairs. 12/164 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 17:15:12,968 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-18 17:15:12,969 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:15:17,863 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-12-18 17:15:18,489 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-18 17:15:18,633 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-18 17:15:18,684 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48496 [2019-12-18 17:15:18,685 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-18 17:15:18,688 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 87 transitions [2019-12-18 17:15:20,802 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 26302 states. [2019-12-18 17:15:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 26302 states. [2019-12-18 17:15:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:15:20,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:20,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:15:20,812 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:20,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:20,817 INFO L82 PathProgramCache]: Analyzing trace with hash -887935004, now seen corresponding path program 1 times [2019-12-18 17:15:20,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:20,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132081004] [2019-12-18 17:15:20,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:21,094 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 17:15:21,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132081004] [2019-12-18 17:15:21,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:21,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:15:21,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979741848] [2019-12-18 17:15:21,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:15:21,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:21,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:15:21,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:15:21,120 INFO L87 Difference]: Start difference. First operand 26302 states. Second operand 3 states. [2019-12-18 17:15:21,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:21,541 INFO L93 Difference]: Finished difference Result 25630 states and 112008 transitions. [2019-12-18 17:15:21,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:15:21,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:15:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:21,787 INFO L225 Difference]: With dead ends: 25630 [2019-12-18 17:15:21,787 INFO L226 Difference]: Without dead ends: 24142 [2019-12-18 17:15:21,789 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 17:15:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24142 states. [2019-12-18 17:15:22,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24142 to 24142. [2019-12-18 17:15:22,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24142 states. [2019-12-18 17:15:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24142 states to 24142 states and 105356 transitions. [2019-12-18 17:15:24,402 INFO L78 Accepts]: Start accepts. Automaton has 24142 states and 105356 transitions. Word has length 9 [2019-12-18 17:15:24,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:24,404 INFO L462 AbstractCegarLoop]: Abstraction has 24142 states and 105356 transitions. [2019-12-18 17:15:24,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:15:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 24142 states and 105356 transitions. [2019-12-18 17:15:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:15:24,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:24,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:15:24,418 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:24,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1247749362, now seen corresponding path program 1 times [2019-12-18 17:15:24,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:24,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514155141] [2019-12-18 17:15:24,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:24,507 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 17:15:24,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514155141] [2019-12-18 17:15:24,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:24,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:15:24,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897568980] [2019-12-18 17:15:24,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:15:24,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:24,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:15:24,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:15:24,511 INFO L87 Difference]: Start difference. First operand 24142 states and 105356 transitions. Second operand 3 states. [2019-12-18 17:15:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:24,758 INFO L93 Difference]: Finished difference Result 19320 states and 78413 transitions. [2019-12-18 17:15:24,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:15:24,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 17:15:24,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:24,853 INFO L225 Difference]: With dead ends: 19320 [2019-12-18 17:15:24,853 INFO L226 Difference]: Without dead ends: 19320 [2019-12-18 17:15:24,854 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 17:15:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19320 states. [2019-12-18 17:15:25,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19320 to 19320. [2019-12-18 17:15:25,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19320 states. [2019-12-18 17:15:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19320 states to 19320 states and 78413 transitions. [2019-12-18 17:15:25,812 INFO L78 Accepts]: Start accepts. Automaton has 19320 states and 78413 transitions. Word has length 15 [2019-12-18 17:15:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:25,813 INFO L462 AbstractCegarLoop]: Abstraction has 19320 states and 78413 transitions. [2019-12-18 17:15:25,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:15:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 19320 states and 78413 transitions. [2019-12-18 17:15:25,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:15:25,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:25,817 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:15:25,817 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:25,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:25,818 INFO L82 PathProgramCache]: Analyzing trace with hash -321510213, now seen corresponding path program 1 times [2019-12-18 17:15:25,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:25,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841038463] [2019-12-18 17:15:25,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:25,926 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 17:15:25,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841038463] [2019-12-18 17:15:25,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:25,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:15:25,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521465359] [2019-12-18 17:15:25,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:15:25,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:25,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:15:25,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:15:25,931 INFO L87 Difference]: Start difference. First operand 19320 states and 78413 transitions. Second operand 4 states. [2019-12-18 17:15:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:26,009 INFO L93 Difference]: Finished difference Result 8957 states and 30876 transitions. [2019-12-18 17:15:26,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:15:26,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:15:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:26,034 INFO L225 Difference]: With dead ends: 8957 [2019-12-18 17:15:26,035 INFO L226 Difference]: Without dead ends: 8957 [2019-12-18 17:15:26,035 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 17:15:26,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8957 states. [2019-12-18 17:15:26,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8957 to 8957. [2019-12-18 17:15:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8957 states. [2019-12-18 17:15:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8957 states to 8957 states and 30876 transitions. [2019-12-18 17:15:26,254 INFO L78 Accepts]: Start accepts. Automaton has 8957 states and 30876 transitions. Word has length 16 [2019-12-18 17:15:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:26,254 INFO L462 AbstractCegarLoop]: Abstraction has 8957 states and 30876 transitions. [2019-12-18 17:15:26,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:15:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 8957 states and 30876 transitions. [2019-12-18 17:15:26,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 17:15:26,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:26,257 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 17:15:26,257 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:26,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1192067329, now seen corresponding path program 1 times [2019-12-18 17:15:26,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:26,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465753788] [2019-12-18 17:15:26,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:15:26,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465753788] [2019-12-18 17:15:26,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:26,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:15:26,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474505476] [2019-12-18 17:15:26,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:15:26,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:26,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:15:26,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:15:26,330 INFO L87 Difference]: Start difference. First operand 8957 states and 30876 transitions. Second operand 5 states. [2019-12-18 17:15:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:26,386 INFO L93 Difference]: Finished difference Result 2671 states and 8332 transitions. [2019-12-18 17:15:26,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:15:26,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 17:15:26,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:26,395 INFO L225 Difference]: With dead ends: 2671 [2019-12-18 17:15:26,395 INFO L226 Difference]: Without dead ends: 2671 [2019-12-18 17:15:26,396 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 17:15:26,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2019-12-18 17:15:26,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2671. [2019-12-18 17:15:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2019-12-18 17:15:26,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 8332 transitions. [2019-12-18 17:15:26,447 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 8332 transitions. Word has length 17 [2019-12-18 17:15:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:26,448 INFO L462 AbstractCegarLoop]: Abstraction has 2671 states and 8332 transitions. [2019-12-18 17:15:26,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:15:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 8332 transitions. [2019-12-18 17:15:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 17:15:26,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:26,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:15:26,451 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:26,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:26,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1635073164, now seen corresponding path program 1 times [2019-12-18 17:15:26,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:26,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131770134] [2019-12-18 17:15:26,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:26,506 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 17:15:26,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131770134] [2019-12-18 17:15:26,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:26,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:15:26,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783890983] [2019-12-18 17:15:26,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:15:26,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:26,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:15:26,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:15:26,510 INFO L87 Difference]: Start difference. First operand 2671 states and 8332 transitions. Second operand 3 states. [2019-12-18 17:15:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:26,579 INFO L93 Difference]: Finished difference Result 3677 states and 11111 transitions. [2019-12-18 17:15:26,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:15:26,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 17:15:26,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:26,591 INFO L225 Difference]: With dead ends: 3677 [2019-12-18 17:15:26,592 INFO L226 Difference]: Without dead ends: 3677 [2019-12-18 17:15:26,592 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 17:15:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2019-12-18 17:15:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 2975. [2019-12-18 17:15:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2975 states. [2019-12-18 17:15:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 9196 transitions. [2019-12-18 17:15:26,970 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 9196 transitions. Word has length 18 [2019-12-18 17:15:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:26,971 INFO L462 AbstractCegarLoop]: Abstraction has 2975 states and 9196 transitions. [2019-12-18 17:15:26,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:15:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 9196 transitions. [2019-12-18 17:15:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 17:15:26,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:26,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:15:26,973 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:26,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:26,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1634952543, now seen corresponding path program 1 times [2019-12-18 17:15:26,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:26,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168190962] [2019-12-18 17:15:26,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:27,030 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 17:15:27,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168190962] [2019-12-18 17:15:27,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:27,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:15:27,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781279048] [2019-12-18 17:15:27,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:15:27,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:27,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:15:27,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:15:27,033 INFO L87 Difference]: Start difference. First operand 2975 states and 9196 transitions. Second operand 4 states. [2019-12-18 17:15:27,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:27,199 INFO L93 Difference]: Finished difference Result 3817 states and 11515 transitions. [2019-12-18 17:15:27,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:15:27,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 17:15:27,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:27,209 INFO L225 Difference]: With dead ends: 3817 [2019-12-18 17:15:27,210 INFO L226 Difference]: Without dead ends: 3817 [2019-12-18 17:15:27,211 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 17:15:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3817 states. [2019-12-18 17:15:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3817 to 3609. [2019-12-18 17:15:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3609 states. [2019-12-18 17:15:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 11065 transitions. [2019-12-18 17:15:27,307 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 11065 transitions. Word has length 18 [2019-12-18 17:15:27,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:27,308 INFO L462 AbstractCegarLoop]: Abstraction has 3609 states and 11065 transitions. [2019-12-18 17:15:27,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:15:27,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 11065 transitions. [2019-12-18 17:15:27,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 17:15:27,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:27,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:15:27,311 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:27,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1770652005, now seen corresponding path program 1 times [2019-12-18 17:15:27,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:27,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528156727] [2019-12-18 17:15:27,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:27,384 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 17:15:27,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528156727] [2019-12-18 17:15:27,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:27,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:15:27,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859225312] [2019-12-18 17:15:27,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:15:27,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:27,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:15:27,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:15:27,386 INFO L87 Difference]: Start difference. First operand 3609 states and 11065 transitions. Second operand 4 states. [2019-12-18 17:15:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:27,582 INFO L93 Difference]: Finished difference Result 4536 states and 13681 transitions. [2019-12-18 17:15:27,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:15:27,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 17:15:27,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:27,591 INFO L225 Difference]: With dead ends: 4536 [2019-12-18 17:15:27,591 INFO L226 Difference]: Without dead ends: 4536 [2019-12-18 17:15:27,592 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 17:15:27,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2019-12-18 17:15:27,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3800. [2019-12-18 17:15:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3800 states. [2019-12-18 17:15:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 11664 transitions. [2019-12-18 17:15:27,677 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 11664 transitions. Word has length 18 [2019-12-18 17:15:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:27,678 INFO L462 AbstractCegarLoop]: Abstraction has 3800 states and 11664 transitions. [2019-12-18 17:15:27,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:15:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 11664 transitions. [2019-12-18 17:15:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 17:15:27,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:27,689 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] [2019-12-18 17:15:27,689 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:27,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:27,690 INFO L82 PathProgramCache]: Analyzing trace with hash 808807491, now seen corresponding path program 1 times [2019-12-18 17:15:27,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:27,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289022225] [2019-12-18 17:15:27,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:27,756 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 17:15:27,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289022225] [2019-12-18 17:15:27,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:27,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:15:27,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043552798] [2019-12-18 17:15:27,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:15:27,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:27,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:15:27,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:15:27,758 INFO L87 Difference]: Start difference. First operand 3800 states and 11664 transitions. Second operand 6 states. [2019-12-18 17:15:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:27,825 INFO L93 Difference]: Finished difference Result 2862 states and 9250 transitions. [2019-12-18 17:15:27,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:15:27,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 17:15:27,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:27,832 INFO L225 Difference]: With dead ends: 2862 [2019-12-18 17:15:27,833 INFO L226 Difference]: Without dead ends: 2862 [2019-12-18 17:15:27,833 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 17:15:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-12-18 17:15:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2702. [2019-12-18 17:15:27,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2702 states. [2019-12-18 17:15:27,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 8770 transitions. [2019-12-18 17:15:27,889 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 8770 transitions. Word has length 32 [2019-12-18 17:15:27,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:27,891 INFO L462 AbstractCegarLoop]: Abstraction has 2702 states and 8770 transitions. [2019-12-18 17:15:27,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:15:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 8770 transitions. [2019-12-18 17:15:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:15:27,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:27,904 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] [2019-12-18 17:15:27,904 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:27,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2084522499, now seen corresponding path program 1 times [2019-12-18 17:15:27,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:27,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284279908] [2019-12-18 17:15:27,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:28,074 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 17:15:28,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284279908] [2019-12-18 17:15:28,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:28,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:15:28,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550841716] [2019-12-18 17:15:28,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:15:28,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:28,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:15:28,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:15:28,078 INFO L87 Difference]: Start difference. First operand 2702 states and 8770 transitions. Second operand 6 states. [2019-12-18 17:15:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:28,322 INFO L93 Difference]: Finished difference Result 7070 states and 22784 transitions. [2019-12-18 17:15:28,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:15:28,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-18 17:15:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:28,332 INFO L225 Difference]: With dead ends: 7070 [2019-12-18 17:15:28,332 INFO L226 Difference]: Without dead ends: 4700 [2019-12-18 17:15:28,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:15:28,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4700 states. [2019-12-18 17:15:28,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4700 to 3034. [2019-12-18 17:15:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3034 states. [2019-12-18 17:15:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 9866 transitions. [2019-12-18 17:15:28,407 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 9866 transitions. Word has length 47 [2019-12-18 17:15:28,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:28,407 INFO L462 AbstractCegarLoop]: Abstraction has 3034 states and 9866 transitions. [2019-12-18 17:15:28,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:15:28,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 9866 transitions. [2019-12-18 17:15:28,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:15:28,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:28,417 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] [2019-12-18 17:15:28,418 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:28,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:28,418 INFO L82 PathProgramCache]: Analyzing trace with hash 797062781, now seen corresponding path program 2 times [2019-12-18 17:15:28,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:28,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253122205] [2019-12-18 17:15:28,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:28,503 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 17:15:28,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253122205] [2019-12-18 17:15:28,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:28,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:15:28,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77785689] [2019-12-18 17:15:28,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:15:28,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:28,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:15:28,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:15:28,506 INFO L87 Difference]: Start difference. First operand 3034 states and 9866 transitions. Second operand 4 states. [2019-12-18 17:15:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:28,544 INFO L93 Difference]: Finished difference Result 4244 states and 13199 transitions. [2019-12-18 17:15:28,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:15:28,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 17:15:28,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:28,550 INFO L225 Difference]: With dead ends: 4244 [2019-12-18 17:15:28,550 INFO L226 Difference]: Without dead ends: 2716 [2019-12-18 17:15:28,551 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 17:15:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2019-12-18 17:15:28,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2019-12-18 17:15:28,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-12-18 17:15:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 8680 transitions. [2019-12-18 17:15:28,816 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 8680 transitions. Word has length 47 [2019-12-18 17:15:28,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:28,816 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 8680 transitions. [2019-12-18 17:15:28,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:15:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 8680 transitions. [2019-12-18 17:15:28,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:15:28,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:28,825 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] [2019-12-18 17:15:28,825 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:28,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:28,826 INFO L82 PathProgramCache]: Analyzing trace with hash -699186775, now seen corresponding path program 3 times [2019-12-18 17:15:28,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:28,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400856851] [2019-12-18 17:15:28,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:28,903 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 17:15:28,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400856851] [2019-12-18 17:15:28,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:28,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:15:28,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008784832] [2019-12-18 17:15:28,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:15:28,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:28,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:15:28,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:15:28,906 INFO L87 Difference]: Start difference. First operand 2716 states and 8680 transitions. Second operand 4 states. [2019-12-18 17:15:28,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:28,935 INFO L93 Difference]: Finished difference Result 3334 states and 10072 transitions. [2019-12-18 17:15:28,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:15:28,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 17:15:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:28,942 INFO L225 Difference]: With dead ends: 3334 [2019-12-18 17:15:28,943 INFO L226 Difference]: Without dead ends: 1966 [2019-12-18 17:15:28,943 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 17:15:28,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2019-12-18 17:15:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1966. [2019-12-18 17:15:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2019-12-18 17:15:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 5635 transitions. [2019-12-18 17:15:28,977 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 5635 transitions. Word has length 47 [2019-12-18 17:15:28,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:28,977 INFO L462 AbstractCegarLoop]: Abstraction has 1966 states and 5635 transitions. [2019-12-18 17:15:28,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:15:28,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 5635 transitions. [2019-12-18 17:15:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:15:28,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:28,985 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] [2019-12-18 17:15:28,985 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:28,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:28,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1157951545, now seen corresponding path program 4 times [2019-12-18 17:15:28,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:28,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439417572] [2019-12-18 17:15:28,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:29,083 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 17:15:29,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439417572] [2019-12-18 17:15:29,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:29,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:15:29,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551165214] [2019-12-18 17:15:29,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:15:29,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:29,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:15:29,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:15:29,085 INFO L87 Difference]: Start difference. First operand 1966 states and 5635 transitions. Second operand 4 states. [2019-12-18 17:15:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:29,110 INFO L93 Difference]: Finished difference Result 2394 states and 6598 transitions. [2019-12-18 17:15:29,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:15:29,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 17:15:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:29,111 INFO L225 Difference]: With dead ends: 2394 [2019-12-18 17:15:29,111 INFO L226 Difference]: Without dead ends: 476 [2019-12-18 17:15:29,111 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 17:15:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-18 17:15:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2019-12-18 17:15:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-18 17:15:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1048 transitions. [2019-12-18 17:15:29,119 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1048 transitions. Word has length 47 [2019-12-18 17:15:29,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:29,119 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 1048 transitions. [2019-12-18 17:15:29,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:15:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1048 transitions. [2019-12-18 17:15:29,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:15:29,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:29,121 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] [2019-12-18 17:15:29,121 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:29,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:29,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1554022263, now seen corresponding path program 5 times [2019-12-18 17:15:29,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:29,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063111549] [2019-12-18 17:15:29,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:29,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 17:15:29,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063111549] [2019-12-18 17:15:29,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:29,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:15:29,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273407446] [2019-12-18 17:15:29,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:15:29,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:29,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:15:29,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:15:29,221 INFO L87 Difference]: Start difference. First operand 476 states and 1048 transitions. Second operand 7 states. [2019-12-18 17:15:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:29,448 INFO L93 Difference]: Finished difference Result 848 states and 1836 transitions. [2019-12-18 17:15:29,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:15:29,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-18 17:15:29,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:29,450 INFO L225 Difference]: With dead ends: 848 [2019-12-18 17:15:29,450 INFO L226 Difference]: Without dead ends: 568 [2019-12-18 17:15:29,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:15:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-12-18 17:15:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 508. [2019-12-18 17:15:29,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-12-18 17:15:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1108 transitions. [2019-12-18 17:15:29,462 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1108 transitions. Word has length 47 [2019-12-18 17:15:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:29,463 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 1108 transitions. [2019-12-18 17:15:29,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:15:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1108 transitions. [2019-12-18 17:15:29,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:15:29,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:29,464 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] [2019-12-18 17:15:29,465 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:29,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:29,465 INFO L82 PathProgramCache]: Analyzing trace with hash 768924829, now seen corresponding path program 6 times [2019-12-18 17:15:29,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:29,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875292751] [2019-12-18 17:15:29,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:29,732 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 17:15:29,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875292751] [2019-12-18 17:15:29,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:29,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:15:29,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012333737] [2019-12-18 17:15:29,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:15:29,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:29,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:15:29,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:15:29,734 INFO L87 Difference]: Start difference. First operand 508 states and 1108 transitions. Second operand 9 states. [2019-12-18 17:15:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:30,207 INFO L93 Difference]: Finished difference Result 728 states and 1468 transitions. [2019-12-18 17:15:30,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:15:30,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-12-18 17:15:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:30,209 INFO L225 Difference]: With dead ends: 728 [2019-12-18 17:15:30,209 INFO L226 Difference]: Without dead ends: 704 [2019-12-18 17:15:30,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:15:30,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-12-18 17:15:30,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 577. [2019-12-18 17:15:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-12-18 17:15:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1199 transitions. [2019-12-18 17:15:30,217 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1199 transitions. Word has length 47 [2019-12-18 17:15:30,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:30,217 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 1199 transitions. [2019-12-18 17:15:30,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:15:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1199 transitions. [2019-12-18 17:15:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:15:30,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:30,218 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] [2019-12-18 17:15:30,218 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:30,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:30,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1543063203, now seen corresponding path program 1 times [2019-12-18 17:15:30,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:30,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884659452] [2019-12-18 17:15:30,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:30,263 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 17:15:30,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884659452] [2019-12-18 17:15:30,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:30,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:15:30,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309694574] [2019-12-18 17:15:30,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:15:30,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:30,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:15:30,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:15:30,265 INFO L87 Difference]: Start difference. First operand 577 states and 1199 transitions. Second operand 3 states. [2019-12-18 17:15:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:30,305 INFO L93 Difference]: Finished difference Result 644 states and 1250 transitions. [2019-12-18 17:15:30,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:15:30,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 17:15:30,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:30,306 INFO L225 Difference]: With dead ends: 644 [2019-12-18 17:15:30,307 INFO L226 Difference]: Without dead ends: 644 [2019-12-18 17:15:30,307 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 17:15:30,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-12-18 17:15:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 564. [2019-12-18 17:15:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-12-18 17:15:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1108 transitions. [2019-12-18 17:15:30,315 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1108 transitions. Word has length 47 [2019-12-18 17:15:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:30,315 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 1108 transitions. [2019-12-18 17:15:30,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:15:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1108 transitions. [2019-12-18 17:15:30,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:15:30,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:30,317 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] [2019-12-18 17:15:30,317 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:30,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:30,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2061863151, now seen corresponding path program 7 times [2019-12-18 17:15:30,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:30,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996513643] [2019-12-18 17:15:30,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:15:30,383 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 17:15:30,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996513643] [2019-12-18 17:15:30,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:15:30,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:15:30,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673385309] [2019-12-18 17:15:30,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:15:30,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:15:30,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:15:30,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:15:30,385 INFO L87 Difference]: Start difference. First operand 564 states and 1108 transitions. Second operand 3 states. [2019-12-18 17:15:30,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:15:30,397 INFO L93 Difference]: Finished difference Result 562 states and 1103 transitions. [2019-12-18 17:15:30,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:15:30,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 17:15:30,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:15:30,399 INFO L225 Difference]: With dead ends: 562 [2019-12-18 17:15:30,399 INFO L226 Difference]: Without dead ends: 562 [2019-12-18 17:15:30,399 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 17:15:30,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-12-18 17:15:30,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 480. [2019-12-18 17:15:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-12-18 17:15:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 949 transitions. [2019-12-18 17:15:30,406 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 949 transitions. Word has length 47 [2019-12-18 17:15:30,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:15:30,407 INFO L462 AbstractCegarLoop]: Abstraction has 480 states and 949 transitions. [2019-12-18 17:15:30,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:15:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 949 transitions. [2019-12-18 17:15:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 17:15:30,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:15:30,408 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] [2019-12-18 17:15:30,408 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:15:30,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:15:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash 477153033, now seen corresponding path program 1 times [2019-12-18 17:15:30,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:15:30,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345838295] [2019-12-18 17:15:30,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:15:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:15:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:15:30,534 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:15:30,534 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:15:30,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_99| 0 0))) (and (< 0 |v_#StackHeapBarrier_23|) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~z$r_buff0_thd3~0_325) (= 0 v_~z$r_buff0_thd4~0_238) (= v_~weak$$choice2~0_127 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= 0 |v_ULTIMATE.start_main_~#t949~0.offset_29|) (= v_~z$w_buff0~0_307 0) (= v_~__unbuffered_p3_EAX~0_136 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= 0 v_~__unbuffered_p3_EBX~0_136) (= |v_#valid_97| (store .cse0 |v_ULTIMATE.start_main_~#t949~0.base_44| 1)) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff1_thd0~0_179 0) (= 0 v_~z$r_buff1_thd4~0_175) (= v_~z$w_buff0_used~0_604 0) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t949~0.base_44|) 0) (= v_~z~0_135 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~weak$$choice0~0_20) (= v_~z$w_buff1~0_205 0) (= v_~z$r_buff1_thd1~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_119 0) (= v_~b~0_92 0) (= v_~z$r_buff0_thd2~0_73 0) (= v_~z$r_buff0_thd1~0_73 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t949~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t949~0.base_44|) |v_ULTIMATE.start_main_~#t949~0.offset_29| 0)) |v_#memory_int_29|) (= v_~a~0_119 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_37 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t949~0.base_44| 4)) (= v_~z$w_buff1_used~0_405 0) (= 0 v_~z$flush_delayed~0_40) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff1_thd3~0_260) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_31 0) (= v_~__unbuffered_cnt~0_126 0) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#t949~0.base_44|) (= v_~z$mem_tmp~0_21 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t950~0.base=|v_ULTIMATE.start_main_~#t950~0.base_39|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_119, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_119, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ULTIMATE.start_main_~#t951~0.offset=|v_ULTIMATE.start_main_~#t951~0.offset_26|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_238, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_136, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ULTIMATE.start_main_~#t949~0.offset=|v_ULTIMATE.start_main_~#t949~0.offset_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_~#t949~0.base=|v_ULTIMATE.start_main_~#t949~0.base_44|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_85|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_405, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_43|, ULTIMATE.start_main_~#t950~0.offset=|v_ULTIMATE.start_main_~#t950~0.offset_26|, ~z$flush_delayed~0=v_~z$flush_delayed~0_40, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_31|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_119, ~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_325, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_37, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_175, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_21|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t952~0.offset=|v_ULTIMATE.start_main_~#t952~0.offset_20|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_179, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_73, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_604, ~z$w_buff0~0=v_~z$w_buff0~0_307, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_260, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_59|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_~#t952~0.base=|v_ULTIMATE.start_main_~#t952~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_136, ULTIMATE.start_main_~#t951~0.base=|v_ULTIMATE.start_main_~#t951~0.base_39|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_63|, ~b~0=v_~b~0_92, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_127, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_73} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t950~0.base, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t951~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t949~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t949~0.base, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t950~0.offset, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t952~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t952~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t951~0.base, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:15:30,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L845-1-->L847: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t950~0.base_12| 4)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t950~0.base_12|)) (= |v_ULTIMATE.start_main_~#t950~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t950~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t950~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t950~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t950~0.base_12|) |v_ULTIMATE.start_main_~#t950~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t950~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t950~0.base=|v_ULTIMATE.start_main_~#t950~0.base_12|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t950~0.offset=|v_ULTIMATE.start_main_~#t950~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t950~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t950~0.offset] because there is no mapped edge [2019-12-18 17:15:30,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L847-1-->L849: Formula: (and (= (store |v_#valid_55| |v_ULTIMATE.start_main_~#t951~0.base_13| 1) |v_#valid_54|) (= 0 (select |v_#valid_55| |v_ULTIMATE.start_main_~#t951~0.base_13|)) (= |v_ULTIMATE.start_main_~#t951~0.offset_11| 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t951~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t951~0.base_13|) |v_ULTIMATE.start_main_~#t951~0.offset_11| 2))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t951~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t951~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t951~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t951~0.offset=|v_ULTIMATE.start_main_~#t951~0.offset_11|, #length=|v_#length_23|, ULTIMATE.start_main_~#t951~0.base=|v_ULTIMATE.start_main_~#t951~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t951~0.offset, #length, ULTIMATE.start_main_~#t951~0.base] because there is no mapped edge [2019-12-18 17:15:30,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L849-1-->L851: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t952~0.base_10| 4)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t952~0.base_10| 1) |v_#valid_46|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t952~0.base_10|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t952~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t952~0.base_10|) |v_ULTIMATE.start_main_~#t952~0.offset_9| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t952~0.base_10|) (= |v_ULTIMATE.start_main_~#t952~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t952~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t952~0.base=|v_ULTIMATE.start_main_~#t952~0.base_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t952~0.offset=|v_ULTIMATE.start_main_~#t952~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t952~0.base, #length, ULTIMATE.start_main_~#t952~0.offset] because there is no mapped edge [2019-12-18 17:15:30,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L4-->L822: Formula: (and (= v_~z$r_buff0_thd4~0_24 v_~z$r_buff1_thd4~0_12) (= 1 v_~a~0_5) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_16 0)) (= v_~__unbuffered_p3_EBX~0_6 v_~b~0_6) (= v_~z$r_buff1_thd1~0_5 v_~z$r_buff0_thd1~0_6) (= v_~z$r_buff0_thd0~0_23 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff1_thd2~0_5 v_~z$r_buff0_thd2~0_6) (= v_~__unbuffered_p3_EAX~0_7 v_~a~0_5) (= v_~z$r_buff0_thd3~0_49 v_~z$r_buff1_thd3~0_27) (= v_~z$r_buff0_thd4~0_23 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_16, ~b~0=v_~b~0_6, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_16, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_12, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_6, ~a~0=v_~a~0_5, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~b~0=v_~b~0_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_5, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_23, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} 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 17:15:30,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_112 (+ v_~__unbuffered_cnt~0_113 1)) (= v_P0Thread1of1ForFork3_~arg.base_22 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_27) (= v_~b~0_68 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_22) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ~b~0=v_~b~0_68, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_22, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_22, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-18 17:15:30,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_15 |v_P1Thread1of1ForFork0_#in~arg.base_15|) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_19) (= 0 |v_P1Thread1of1ForFork0_#res.offset_9|) (= 0 |v_P1Thread1of1ForFork0_#res.base_9|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_15| v_P1Thread1of1ForFork0_~arg.offset_15) (= v_~x~0_30 1) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1))) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_9|, ~y~0=v_~y~0_25, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_9|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-18 17:15:30,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In262522824 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_In262522824| |P2Thread1of1ForFork1_#t~ite8_Out262522824|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite9_Out262522824| ~z$w_buff0~0_In262522824)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In262522824 256) 0))) (or (= (mod ~z$w_buff0_used~0_In262522824 256) 0) (and (= (mod ~z$r_buff1_thd3~0_In262522824 256) 0) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In262522824 256) 0)))) (= |P2Thread1of1ForFork1_#t~ite8_Out262522824| ~z$w_buff0~0_In262522824) .cse0 (= |P2Thread1of1ForFork1_#t~ite9_Out262522824| |P2Thread1of1ForFork1_#t~ite8_Out262522824|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In262522824, ~z$w_buff0_used~0=~z$w_buff0_used~0_In262522824, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In262522824, ~z$w_buff1_used~0=~z$w_buff1_used~0_In262522824, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In262522824, ~weak$$choice2~0=~weak$$choice2~0_In262522824, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In262522824|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In262522824, ~z$w_buff0_used~0=~z$w_buff0_used~0_In262522824, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In262522824, ~z$w_buff1_used~0=~z$w_buff1_used~0_In262522824, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In262522824, ~weak$$choice2~0=~weak$$choice2~0_In262522824, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out262522824|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out262522824|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 17:15:30,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L784-->L785: Formula: (and (= v_~z$r_buff0_thd3~0_131 v_~z$r_buff0_thd3~0_130) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_12|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_38, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-18 17:15:30,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L787-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_14 256))) (= 0 v_~z$flush_delayed~0_13) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~z~0_40 v_~z$mem_tmp~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z$flush_delayed~0=v_~z$flush_delayed~0_14} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 17:15:30,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In303924333 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In303924333 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out303924333|)) (and (= ~z$w_buff0_used~0_In303924333 |P3Thread1of1ForFork2_#t~ite28_Out303924333|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In303924333, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In303924333} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out303924333|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In303924333, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In303924333} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 17:15:30,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2109895297 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-2109895297 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-2109895297 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2109895297 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite29_Out-2109895297| ~z$w_buff1_used~0_In-2109895297) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork2_#t~ite29_Out-2109895297| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2109895297, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2109895297, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2109895297, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2109895297} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-2109895297|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2109895297, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2109895297, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2109895297, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2109895297} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 17:15:30,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L825-->L826: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-903747690 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-903747690 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-903747690 ~z$r_buff0_thd4~0_In-903747690)) (and (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-903747690) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-903747690, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-903747690} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-903747690, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-903747690, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-903747690|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-18 17:15:30,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L826-->L826-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In-1024395512 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1024395512 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1024395512 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1024395512 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite31_Out-1024395512| 0)) (and (= |P3Thread1of1ForFork2_#t~ite31_Out-1024395512| ~z$r_buff1_thd4~0_In-1024395512) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1024395512, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1024395512, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1024395512, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1024395512} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1024395512, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1024395512, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1024395512, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1024395512, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-1024395512|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 17:15:30,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L826-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_44| v_~z$r_buff1_thd4~0_61) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_44|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_61, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_43|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 17:15:30,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L851-1-->L857: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 4 v_~__unbuffered_cnt~0_50)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:15:30,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L857-2-->L857-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1765229514 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1765229514 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1765229514 |ULTIMATE.start_main_#t~ite36_Out1765229514|)) (and (or .cse0 .cse1) (= ~z~0_In1765229514 |ULTIMATE.start_main_#t~ite36_Out1765229514|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1765229514, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1765229514, ~z$w_buff1~0=~z$w_buff1~0_In1765229514, ~z~0=~z~0_In1765229514} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1765229514, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1765229514, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1765229514|, ~z$w_buff1~0=~z$w_buff1~0_In1765229514, ~z~0=~z~0_In1765229514} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 17:15:30,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L857-4-->L858: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite36_15|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_6|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-18 17:15:30,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In358440910 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In358440910 256)))) (or (and (= ~z$w_buff0_used~0_In358440910 |ULTIMATE.start_main_#t~ite38_Out358440910|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out358440910|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In358440910, ~z$w_buff0_used~0=~z$w_buff0_used~0_In358440910} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In358440910, ~z$w_buff0_used~0=~z$w_buff0_used~0_In358440910, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out358440910|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 17:15:30,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-730729293 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-730729293 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-730729293 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-730729293 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-730729293|)) (and (= ~z$w_buff1_used~0_In-730729293 |ULTIMATE.start_main_#t~ite39_Out-730729293|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-730729293, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-730729293, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-730729293, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-730729293} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-730729293, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-730729293|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-730729293, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-730729293, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-730729293} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:15:30,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L860-->L860-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1920918439 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1920918439 256)))) (or (and (= ~z$r_buff0_thd0~0_In-1920918439 |ULTIMATE.start_main_#t~ite40_Out-1920918439|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1920918439| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1920918439, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1920918439} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1920918439, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1920918439|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1920918439} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 17:15:30,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L861-->L861-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1771834974 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1771834974 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1771834974 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1771834974 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite41_Out1771834974|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In1771834974 |ULTIMATE.start_main_#t~ite41_Out1771834974|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1771834974, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1771834974, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1771834974, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1771834974} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1771834974|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1771834974, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1771834974, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1771834974, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1771834974} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 17:15:30,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p3_EBX~0_117) (= v_~__unbuffered_p3_EAX~0_117 1) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_23 256)) (= 0 v_~__unbuffered_p2_EAX~0_31) (= v_~z$r_buff1_thd0~0_157 |v_ULTIMATE.start_main_#t~ite41_37|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~__unbuffered_p0_EAX~0_34) (= 0 v_~__unbuffered_p1_EAX~0_26)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_157, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:15:30,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:15:30 BasicIcfg [2019-12-18 17:15:30,681 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:15:30,683 INFO L168 Benchmark]: Toolchain (without parser) took 19821.27 ms. Allocated memory was 136.8 MB in the beginning and 926.4 MB in the end (delta: 789.6 MB). Free memory was 99.3 MB in the beginning and 177.3 MB in the end (delta: -78.0 MB). Peak memory consumption was 711.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:30,684 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:15:30,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.93 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 98.8 MB in the beginning and 154.1 MB in the end (delta: -55.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:30,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.62 ms. Allocated memory is still 200.3 MB. Free memory was 154.1 MB in the beginning and 151.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:30,687 INFO L168 Benchmark]: Boogie Preprocessor took 43.03 ms. Allocated memory is still 200.3 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:30,688 INFO L168 Benchmark]: RCFGBuilder took 812.74 ms. Allocated memory is still 200.3 MB. Free memory was 149.2 MB in the beginning and 102.6 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:30,692 INFO L168 Benchmark]: TraceAbstraction took 18168.67 ms. Allocated memory was 200.3 MB in the beginning and 926.4 MB in the end (delta: 726.1 MB). Free memory was 102.6 MB in the beginning and 177.3 MB in the end (delta: -74.7 MB). Peak memory consumption was 651.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:15:30,698 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.46 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.93 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 98.8 MB in the beginning and 154.1 MB in the end (delta: -55.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.62 ms. Allocated memory is still 200.3 MB. Free memory was 154.1 MB in the beginning and 151.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.03 ms. Allocated memory is still 200.3 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 812.74 ms. Allocated memory is still 200.3 MB. Free memory was 149.2 MB in the beginning and 102.6 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18168.67 ms. Allocated memory was 200.3 MB in the beginning and 926.4 MB in the end (delta: 726.1 MB). Free memory was 102.6 MB in the beginning and 177.3 MB in the end (delta: -74.7 MB). Peak memory consumption was 651.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 171 ProgramPointsBefore, 79 ProgramPointsAfterwards, 193 TransitionsBefore, 87 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 19 ChoiceCompositions, 5629 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 54 SemBasedMoverChecksPositive, 182 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 48496 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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] [L847] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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] [L849] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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] [L851] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 1 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L822] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 y = 1 [L775] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 3 z$flush_delayed = weak$$choice2 [L778] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L780] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 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) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 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 [L857] 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}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 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 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 159 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2029 SDtfs, 2315 SDslu, 3438 SDs, 0 SdLazy, 1023 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26302occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 3821 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 567 NumberOfCodeBlocks, 567 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 503 ConstructedInterpolants, 0 QuantifiedInterpolants, 61839 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...