/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:42:52,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:42:52,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:42:52,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:42:52,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:42:52,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:42:52,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:42:52,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:42:52,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:42:52,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:42:52,643 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:42:52,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:42:52,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:42:52,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:42:52,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:42:52,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:42:52,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:42:52,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:42:52,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:42:52,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:42:52,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:42:52,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:42:52,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:42:52,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:42:52,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:42:52,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:42:52,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:42:52,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:42:52,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:42:52,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:42:52,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:42:52,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:42:52,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:42:52,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:42:52,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:42:52,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:42:52,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:42:52,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:42:52,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:42:52,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:42:52,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:42:52,685 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:42:52,720 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:42:52,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:42:52,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:42:52,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:42:52,722 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:42:52,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:42:52,723 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:42:52,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:42:52,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:42:52,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:42:52,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:42:52,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:42:52,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:42:52,726 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:42:52,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:42:52,727 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:42:52,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:42:52,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:42:52,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:42:52,727 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:42:52,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:42:52,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:42:52,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:42:52,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:42:52,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:42:52,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:42:52,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:42:52,730 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:42:52,730 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:42:52,730 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:42:52,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:42:53,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:42:53,032 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:42:53,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:42:53,037 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:42:53,037 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:42:53,038 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i [2019-12-27 16:42:53,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9664c4716/1e4ce5d032ef4878a7435ed619c8ac01/FLAGbfcfeb817 [2019-12-27 16:42:53,714 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:42:53,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i [2019-12-27 16:42:53,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9664c4716/1e4ce5d032ef4878a7435ed619c8ac01/FLAGbfcfeb817 [2019-12-27 16:42:53,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9664c4716/1e4ce5d032ef4878a7435ed619c8ac01 [2019-12-27 16:42:53,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:42:53,987 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:42:53,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:42:53,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:42:53,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:42:53,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:42:53" (1/1) ... [2019-12-27 16:42:53,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:42:53, skipping insertion in model container [2019-12-27 16:42:53,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:42:53" (1/1) ... [2019-12-27 16:42:54,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:42:54,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:42:54,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:42:54,678 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:42:54,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:42:54,838 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:42:54,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:42:54 WrapperNode [2019-12-27 16:42:54,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:42:54,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:42:54,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:42:54,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:42:54,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:42:54" (1/1) ... [2019-12-27 16:42:54,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:42:54" (1/1) ... [2019-12-27 16:42:54,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:42:54,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:42:54,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:42:54,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:42:54,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:42:54" (1/1) ... [2019-12-27 16:42:54,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:42:54" (1/1) ... [2019-12-27 16:42:54,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:42:54" (1/1) ... [2019-12-27 16:42:54,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:42:54" (1/1) ... [2019-12-27 16:42:54,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:42:54" (1/1) ... [2019-12-27 16:42:54,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:42:54" (1/1) ... [2019-12-27 16:42:54,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:42:54" (1/1) ... [2019-12-27 16:42:54,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:42:54,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:42:54,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:42:54,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:42:54,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:42:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:42:55,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:42:55,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:42:55,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:42:55,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:42:55,091 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:42:55,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:42:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:42:55,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:42:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:42:55,094 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:42:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 16:42:55,094 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 16:42:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:42:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:42:55,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:42:55,098 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:42:56,195 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:42:56,195 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:42:56,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:42:56 BoogieIcfgContainer [2019-12-27 16:42:56,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:42:56,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:42:56,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:42:56,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:42:56,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:42:53" (1/3) ... [2019-12-27 16:42:56,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e3e2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:42:56, skipping insertion in model container [2019-12-27 16:42:56,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:42:54" (2/3) ... [2019-12-27 16:42:56,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e3e2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:42:56, skipping insertion in model container [2019-12-27 16:42:56,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:42:56" (3/3) ... [2019-12-27 16:42:56,205 INFO L109 eAbstractionObserver]: Analyzing ICFG mix030_tso.oepc.i [2019-12-27 16:42:56,214 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:42:56,214 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:42:56,222 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:42:56,223 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:42:56,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,269 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,269 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,272 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,272 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,275 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,275 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,287 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,287 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,288 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,288 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,288 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,290 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,290 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,290 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,290 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,290 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,291 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,292 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,292 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,292 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,292 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,292 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,293 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,294 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,295 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,308 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,308 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,308 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,308 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,308 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,315 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,316 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,318 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,319 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,322 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,322 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,325 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,325 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,325 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,326 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,326 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,326 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,326 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,327 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,327 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,327 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,327 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,327 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,328 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,328 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,328 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,328 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,328 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,328 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,329 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,329 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,329 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,329 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,329 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,330 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,330 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,330 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,330 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,330 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,331 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,331 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,331 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,331 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,331 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,332 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,332 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:42:56,351 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 16:42:56,375 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:42:56,375 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:42:56,375 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:42:56,375 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:42:56,376 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:42:56,376 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:42:56,376 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:42:56,376 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:42:56,396 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 270 transitions [2019-12-27 16:42:56,398 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 221 places, 270 transitions [2019-12-27 16:42:56,584 INFO L132 PetriNetUnfolder]: 62/266 cut-off events. [2019-12-27 16:42:56,585 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:42:56,617 INFO L76 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 62/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 528 event pairs. 0/202 useless extension candidates. Maximal degree in co-relation 235. Up to 2 conditions per place. [2019-12-27 16:42:56,678 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 221 places, 270 transitions [2019-12-27 16:42:56,795 INFO L132 PetriNetUnfolder]: 62/266 cut-off events. [2019-12-27 16:42:56,795 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:42:56,812 INFO L76 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 62/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 528 event pairs. 0/202 useless extension candidates. Maximal degree in co-relation 235. Up to 2 conditions per place. [2019-12-27 16:42:56,852 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 28796 [2019-12-27 16:42:56,854 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:43:03,470 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 16:43:03,620 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 16:43:03,730 INFO L206 etLargeBlockEncoding]: Checked pairs total: 145015 [2019-12-27 16:43:03,730 INFO L214 etLargeBlockEncoding]: Total number of compositions: 133 [2019-12-27 16:43:03,734 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 122 places, 142 transitions [2019-12-27 16:43:16,285 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 105210 states. [2019-12-27 16:43:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 105210 states. [2019-12-27 16:43:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 16:43:16,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:43:16,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:43:16,297 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:43:16,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:43:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash 487193979, now seen corresponding path program 1 times [2019-12-27 16:43:16,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:43:16,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263652985] [2019-12-27 16:43:16,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:43:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:43:16,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:43:16,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263652985] [2019-12-27 16:43:16,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:43:16,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:43:16,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1973479437] [2019-12-27 16:43:16,664 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:43:16,671 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:43:16,690 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 16:43:16,690 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:43:16,694 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:43:16,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:43:16,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:43:16,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:43:16,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:43:16,712 INFO L87 Difference]: Start difference. First operand 105210 states. Second operand 3 states. [2019-12-27 16:43:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:43:20,015 INFO L93 Difference]: Finished difference Result 105018 states and 475984 transitions. [2019-12-27 16:43:20,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:43:20,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 16:43:20,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:43:20,947 INFO L225 Difference]: With dead ends: 105018 [2019-12-27 16:43:20,947 INFO L226 Difference]: Without dead ends: 102886 [2019-12-27 16:43:20,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:43:23,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102886 states. [2019-12-27 16:43:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102886 to 102886. [2019-12-27 16:43:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102886 states. [2019-12-27 16:43:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102886 states to 102886 states and 466780 transitions. [2019-12-27 16:43:26,578 INFO L78 Accepts]: Start accepts. Automaton has 102886 states and 466780 transitions. Word has length 9 [2019-12-27 16:43:26,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:43:26,579 INFO L462 AbstractCegarLoop]: Abstraction has 102886 states and 466780 transitions. [2019-12-27 16:43:26,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:43:26,579 INFO L276 IsEmpty]: Start isEmpty. Operand 102886 states and 466780 transitions. [2019-12-27 16:43:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:43:26,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:43:26,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:43:26,587 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:43:26,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:43:26,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1814849602, now seen corresponding path program 1 times [2019-12-27 16:43:26,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:43:26,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293898289] [2019-12-27 16:43:26,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:43:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:43:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:43:26,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293898289] [2019-12-27 16:43:26,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:43:26,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:43:26,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [187574150] [2019-12-27 16:43:26,707 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:43:26,709 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:43:26,717 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 16:43:26,717 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:43:26,718 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:43:26,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:43:26,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:43:26,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:43:26,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:43:26,720 INFO L87 Difference]: Start difference. First operand 102886 states and 466780 transitions. Second operand 4 states. [2019-12-27 16:43:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:43:32,011 INFO L93 Difference]: Finished difference Result 165574 states and 725216 transitions. [2019-12-27 16:43:32,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:43:32,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 16:43:32,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:43:33,527 INFO L225 Difference]: With dead ends: 165574 [2019-12-27 16:43:33,527 INFO L226 Difference]: Without dead ends: 165546 [2019-12-27 16:43:33,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:43:35,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165546 states. [2019-12-27 16:43:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165546 to 160294. [2019-12-27 16:43:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160294 states. [2019-12-27 16:43:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160294 states to 160294 states and 705940 transitions. [2019-12-27 16:43:44,439 INFO L78 Accepts]: Start accepts. Automaton has 160294 states and 705940 transitions. Word has length 15 [2019-12-27 16:43:44,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:43:44,440 INFO L462 AbstractCegarLoop]: Abstraction has 160294 states and 705940 transitions. [2019-12-27 16:43:44,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:43:44,440 INFO L276 IsEmpty]: Start isEmpty. Operand 160294 states and 705940 transitions. [2019-12-27 16:43:44,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:43:44,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:43:44,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:43:44,443 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:43:44,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:43:44,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1261715161, now seen corresponding path program 1 times [2019-12-27 16:43:44,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:43:44,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808193556] [2019-12-27 16:43:44,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:43:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:43:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:43:44,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808193556] [2019-12-27 16:43:44,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:43:44,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:43:44,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1913809518] [2019-12-27 16:43:44,488 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:43:44,493 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:43:44,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:43:44,495 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:43:44,495 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:43:44,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:43:44,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:43:44,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:43:44,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:43:44,496 INFO L87 Difference]: Start difference. First operand 160294 states and 705940 transitions. Second operand 3 states. [2019-12-27 16:43:50,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:43:50,219 INFO L93 Difference]: Finished difference Result 124009 states and 506087 transitions. [2019-12-27 16:43:50,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:43:50,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 16:43:50,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:43:50,747 INFO L225 Difference]: With dead ends: 124009 [2019-12-27 16:43:50,747 INFO L226 Difference]: Without dead ends: 124009 [2019-12-27 16:43:50,748 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-27 16:43:52,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124009 states. [2019-12-27 16:43:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124009 to 124009. [2019-12-27 16:43:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124009 states. [2019-12-27 16:43:55,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124009 states to 124009 states and 506087 transitions. [2019-12-27 16:43:55,139 INFO L78 Accepts]: Start accepts. Automaton has 124009 states and 506087 transitions. Word has length 15 [2019-12-27 16:43:55,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:43:55,139 INFO L462 AbstractCegarLoop]: Abstraction has 124009 states and 506087 transitions. [2019-12-27 16:43:55,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:43:55,139 INFO L276 IsEmpty]: Start isEmpty. Operand 124009 states and 506087 transitions. [2019-12-27 16:43:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:43:55,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:43:55,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:43:55,142 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:43:55,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:43:55,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2125901826, now seen corresponding path program 1 times [2019-12-27 16:43:55,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:43:55,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177876313] [2019-12-27 16:43:55,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:43:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:43:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:43:55,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177876313] [2019-12-27 16:43:55,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:43:55,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:43:55,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [76142568] [2019-12-27 16:43:55,200 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:43:55,202 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:43:55,205 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 16:43:55,205 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:43:55,205 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:43:55,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:43:55,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:43:55,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:43:55,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:43:55,207 INFO L87 Difference]: Start difference. First operand 124009 states and 506087 transitions. Second operand 4 states. [2019-12-27 16:43:55,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:43:55,433 INFO L93 Difference]: Finished difference Result 48600 states and 166166 transitions. [2019-12-27 16:43:55,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:43:55,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:43:55,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:43:55,520 INFO L225 Difference]: With dead ends: 48600 [2019-12-27 16:43:55,520 INFO L226 Difference]: Without dead ends: 48600 [2019-12-27 16:43:55,520 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-27 16:43:55,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48600 states. [2019-12-27 16:43:57,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48600 to 48600. [2019-12-27 16:43:57,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48600 states. [2019-12-27 16:43:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48600 states to 48600 states and 166166 transitions. [2019-12-27 16:43:57,660 INFO L78 Accepts]: Start accepts. Automaton has 48600 states and 166166 transitions. Word has length 16 [2019-12-27 16:43:57,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:43:57,660 INFO L462 AbstractCegarLoop]: Abstraction has 48600 states and 166166 transitions. [2019-12-27 16:43:57,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:43:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 48600 states and 166166 transitions. [2019-12-27 16:43:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 16:43:57,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:43:57,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:43:57,662 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:43:57,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:43:57,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2082717748, now seen corresponding path program 1 times [2019-12-27 16:43:57,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:43:57,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194077729] [2019-12-27 16:43:57,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:43:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:43:57,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:43:57,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194077729] [2019-12-27 16:43:57,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:43:57,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:43:57,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [367727205] [2019-12-27 16:43:57,762 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:43:57,764 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:43:57,767 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 16:43:57,767 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:43:57,800 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:43:57,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:43:57,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:43:57,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:43:57,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:43:57,801 INFO L87 Difference]: Start difference. First operand 48600 states and 166166 transitions. Second operand 6 states. [2019-12-27 16:43:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:43:57,879 INFO L93 Difference]: Finished difference Result 6591 states and 18839 transitions. [2019-12-27 16:43:57,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:43:57,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 16:43:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:43:57,888 INFO L225 Difference]: With dead ends: 6591 [2019-12-27 16:43:57,888 INFO L226 Difference]: Without dead ends: 6591 [2019-12-27 16:43:57,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-27 16:43:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6591 states. [2019-12-27 16:43:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6591 to 6591. [2019-12-27 16:43:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6591 states. [2019-12-27 16:43:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6591 states to 6591 states and 18839 transitions. [2019-12-27 16:43:57,969 INFO L78 Accepts]: Start accepts. Automaton has 6591 states and 18839 transitions. Word has length 17 [2019-12-27 16:43:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:43:57,970 INFO L462 AbstractCegarLoop]: Abstraction has 6591 states and 18839 transitions. [2019-12-27 16:43:57,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:43:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 6591 states and 18839 transitions. [2019-12-27 16:43:57,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 16:43:57,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:43:57,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:43:57,976 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:43:57,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:43:57,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1699372313, now seen corresponding path program 1 times [2019-12-27 16:43:57,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:43:57,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542110228] [2019-12-27 16:43:57,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:43:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:43:58,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:43:58,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542110228] [2019-12-27 16:43:58,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:43:58,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:43:58,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1074297310] [2019-12-27 16:43:58,067 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:43:58,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:43:58,095 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 181 transitions. [2019-12-27 16:43:58,095 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:43:58,096 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:43:58,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:43:58,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:43:58,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:43:58,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:43:58,097 INFO L87 Difference]: Start difference. First operand 6591 states and 18839 transitions. Second operand 6 states. [2019-12-27 16:43:58,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:43:58,161 INFO L93 Difference]: Finished difference Result 3660 states and 11520 transitions. [2019-12-27 16:43:58,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:43:58,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 16:43:58,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:43:58,168 INFO L225 Difference]: With dead ends: 3660 [2019-12-27 16:43:58,169 INFO L226 Difference]: Without dead ends: 3660 [2019-12-27 16:43:58,169 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-27 16:43:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2019-12-27 16:43:58,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3464. [2019-12-27 16:43:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2019-12-27 16:43:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 10960 transitions. [2019-12-27 16:43:58,233 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 10960 transitions. Word has length 29 [2019-12-27 16:43:58,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:43:58,233 INFO L462 AbstractCegarLoop]: Abstraction has 3464 states and 10960 transitions. [2019-12-27 16:43:58,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:43:58,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 10960 transitions. [2019-12-27 16:43:58,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:43:58,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:43:58,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:43:58,242 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:43:58,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:43:58,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1142900950, now seen corresponding path program 1 times [2019-12-27 16:43:58,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:43:58,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653364911] [2019-12-27 16:43:58,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:43:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:43:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:43:58,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653364911] [2019-12-27 16:43:58,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:43:58,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:43:58,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [580832006] [2019-12-27 16:43:58,442 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:43:58,468 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:43:59,895 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 324 states and 647 transitions. [2019-12-27 16:43:59,896 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:00,112 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 16:44:00,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:44:00,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:00,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:44:00,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:44:00,114 INFO L87 Difference]: Start difference. First operand 3464 states and 10960 transitions. Second operand 11 states. [2019-12-27 16:44:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:02,345 INFO L93 Difference]: Finished difference Result 10676 states and 32986 transitions. [2019-12-27 16:44:02,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 16:44:02,346 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2019-12-27 16:44:02,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:02,364 INFO L225 Difference]: With dead ends: 10676 [2019-12-27 16:44:02,364 INFO L226 Difference]: Without dead ends: 10676 [2019-12-27 16:44:02,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2019-12-27 16:44:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10676 states. [2019-12-27 16:44:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10676 to 4901. [2019-12-27 16:44:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4901 states. [2019-12-27 16:44:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4901 states to 4901 states and 15405 transitions. [2019-12-27 16:44:02,464 INFO L78 Accepts]: Start accepts. Automaton has 4901 states and 15405 transitions. Word has length 74 [2019-12-27 16:44:02,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:02,465 INFO L462 AbstractCegarLoop]: Abstraction has 4901 states and 15405 transitions. [2019-12-27 16:44:02,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:44:02,465 INFO L276 IsEmpty]: Start isEmpty. Operand 4901 states and 15405 transitions. [2019-12-27 16:44:02,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:44:02,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:02,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:02,475 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:02,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:02,475 INFO L82 PathProgramCache]: Analyzing trace with hash -617148552, now seen corresponding path program 2 times [2019-12-27 16:44:02,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:02,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255703107] [2019-12-27 16:44:02,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:02,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255703107] [2019-12-27 16:44:02,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:02,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:44:02,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1794991142] [2019-12-27 16:44:02,583 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:02,608 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:02,762 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 395 transitions. [2019-12-27 16:44:02,763 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:02,766 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:44:02,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:44:02,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:02,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:44:02,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:44:02,768 INFO L87 Difference]: Start difference. First operand 4901 states and 15405 transitions. Second operand 5 states. [2019-12-27 16:44:03,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:03,030 INFO L93 Difference]: Finished difference Result 5462 states and 16995 transitions. [2019-12-27 16:44:03,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:44:03,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-27 16:44:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:03,041 INFO L225 Difference]: With dead ends: 5462 [2019-12-27 16:44:03,041 INFO L226 Difference]: Without dead ends: 5462 [2019-12-27 16:44:03,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:44:03,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5462 states. [2019-12-27 16:44:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5462 to 5141. [2019-12-27 16:44:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5141 states. [2019-12-27 16:44:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5141 states to 5141 states and 16117 transitions. [2019-12-27 16:44:03,130 INFO L78 Accepts]: Start accepts. Automaton has 5141 states and 16117 transitions. Word has length 74 [2019-12-27 16:44:03,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:03,131 INFO L462 AbstractCegarLoop]: Abstraction has 5141 states and 16117 transitions. [2019-12-27 16:44:03,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:44:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 5141 states and 16117 transitions. [2019-12-27 16:44:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:44:03,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:03,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:03,140 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:03,141 INFO L82 PathProgramCache]: Analyzing trace with hash -115763946, now seen corresponding path program 3 times [2019-12-27 16:44:03,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:03,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86780111] [2019-12-27 16:44:03,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:03,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86780111] [2019-12-27 16:44:03,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:03,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:44:03,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [690365566] [2019-12-27 16:44:03,258 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:03,285 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:03,561 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 420 transitions. [2019-12-27 16:44:03,561 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:03,706 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 16:44:03,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:44:03,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:03,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:44:03,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:44:03,707 INFO L87 Difference]: Start difference. First operand 5141 states and 16117 transitions. Second operand 10 states. [2019-12-27 16:44:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:05,839 INFO L93 Difference]: Finished difference Result 12947 states and 39430 transitions. [2019-12-27 16:44:05,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 16:44:05,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-12-27 16:44:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:05,860 INFO L225 Difference]: With dead ends: 12947 [2019-12-27 16:44:05,860 INFO L226 Difference]: Without dead ends: 12947 [2019-12-27 16:44:05,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:44:05,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12947 states. [2019-12-27 16:44:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12947 to 5589. [2019-12-27 16:44:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5589 states. [2019-12-27 16:44:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5589 states to 5589 states and 17481 transitions. [2019-12-27 16:44:05,983 INFO L78 Accepts]: Start accepts. Automaton has 5589 states and 17481 transitions. Word has length 74 [2019-12-27 16:44:05,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:05,983 INFO L462 AbstractCegarLoop]: Abstraction has 5589 states and 17481 transitions. [2019-12-27 16:44:05,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:44:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 5589 states and 17481 transitions. [2019-12-27 16:44:05,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 16:44:05,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:05,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:05,993 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:05,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:05,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1912498904, now seen corresponding path program 4 times [2019-12-27 16:44:05,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:05,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175810302] [2019-12-27 16:44:05,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:06,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175810302] [2019-12-27 16:44:06,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:06,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:44:06,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [687982145] [2019-12-27 16:44:06,085 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:06,111 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:06,302 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 473 transitions. [2019-12-27 16:44:06,302 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:06,303 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:06,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:44:06,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:06,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:44:06,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:44:06,304 INFO L87 Difference]: Start difference. First operand 5589 states and 17481 transitions. Second operand 3 states. [2019-12-27 16:44:06,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:06,360 INFO L93 Difference]: Finished difference Result 5588 states and 17479 transitions. [2019-12-27 16:44:06,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:44:06,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-12-27 16:44:06,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:06,372 INFO L225 Difference]: With dead ends: 5588 [2019-12-27 16:44:06,372 INFO L226 Difference]: Without dead ends: 5588 [2019-12-27 16:44:06,373 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-27 16:44:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5588 states. [2019-12-27 16:44:06,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5588 to 4683. [2019-12-27 16:44:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4683 states. [2019-12-27 16:44:06,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4683 states to 4683 states and 14821 transitions. [2019-12-27 16:44:06,441 INFO L78 Accepts]: Start accepts. Automaton has 4683 states and 14821 transitions. Word has length 74 [2019-12-27 16:44:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:06,441 INFO L462 AbstractCegarLoop]: Abstraction has 4683 states and 14821 transitions. [2019-12-27 16:44:06,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:44:06,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4683 states and 14821 transitions. [2019-12-27 16:44:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 16:44:06,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:06,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:06,449 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:06,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:06,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1481768599, now seen corresponding path program 1 times [2019-12-27 16:44:06,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:06,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547468187] [2019-12-27 16:44:06,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:06,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547468187] [2019-12-27 16:44:06,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:06,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:44:06,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [113359340] [2019-12-27 16:44:06,561 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:06,586 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:06,951 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 396 transitions. [2019-12-27 16:44:06,951 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:06,953 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:06,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:44:06,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:06,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:44:06,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:44:06,955 INFO L87 Difference]: Start difference. First operand 4683 states and 14821 transitions. Second operand 4 states. [2019-12-27 16:44:07,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:07,030 INFO L93 Difference]: Finished difference Result 6893 states and 20690 transitions. [2019-12-27 16:44:07,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:44:07,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-27 16:44:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:07,037 INFO L225 Difference]: With dead ends: 6893 [2019-12-27 16:44:07,038 INFO L226 Difference]: Without dead ends: 2525 [2019-12-27 16:44:07,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:44:07,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2019-12-27 16:44:07,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2525. [2019-12-27 16:44:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2525 states. [2019-12-27 16:44:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 6708 transitions. [2019-12-27 16:44:07,098 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 6708 transitions. Word has length 75 [2019-12-27 16:44:07,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:07,098 INFO L462 AbstractCegarLoop]: Abstraction has 2525 states and 6708 transitions. [2019-12-27 16:44:07,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:44:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 6708 transitions. [2019-12-27 16:44:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 16:44:07,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:07,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:07,104 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:07,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:07,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1998741429, now seen corresponding path program 2 times [2019-12-27 16:44:07,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:07,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795580816] [2019-12-27 16:44:07,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:07,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:07,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795580816] [2019-12-27 16:44:07,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:07,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 16:44:07,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1191519879] [2019-12-27 16:44:07,597 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:07,645 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:07,911 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 346 transitions. [2019-12-27 16:44:07,912 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:07,915 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:44:07,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:44:07,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:07,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:44:07,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:44:07,917 INFO L87 Difference]: Start difference. First operand 2525 states and 6708 transitions. Second operand 12 states. [2019-12-27 16:44:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:09,004 INFO L93 Difference]: Finished difference Result 5800 states and 14078 transitions. [2019-12-27 16:44:09,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 16:44:09,004 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2019-12-27 16:44:09,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:09,008 INFO L225 Difference]: With dead ends: 5800 [2019-12-27 16:44:09,008 INFO L226 Difference]: Without dead ends: 1917 [2019-12-27 16:44:09,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:44:09,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2019-12-27 16:44:09,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1481. [2019-12-27 16:44:09,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-12-27 16:44:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 3345 transitions. [2019-12-27 16:44:09,025 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 3345 transitions. Word has length 75 [2019-12-27 16:44:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:09,026 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 3345 transitions. [2019-12-27 16:44:09,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:44:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 3345 transitions. [2019-12-27 16:44:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 16:44:09,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:09,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:09,028 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:09,028 INFO L82 PathProgramCache]: Analyzing trace with hash -423476261, now seen corresponding path program 3 times [2019-12-27 16:44:09,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:09,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287399158] [2019-12-27 16:44:09,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:09,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287399158] [2019-12-27 16:44:09,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:09,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:44:09,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520549523] [2019-12-27 16:44:09,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:09,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:09,413 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 179 states and 241 transitions. [2019-12-27 16:44:09,413 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:09,426 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:44:09,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:44:09,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:09,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:44:09,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:44:09,427 INFO L87 Difference]: Start difference. First operand 1481 states and 3345 transitions. Second operand 6 states. [2019-12-27 16:44:09,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:09,815 INFO L93 Difference]: Finished difference Result 3097 states and 7102 transitions. [2019-12-27 16:44:09,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:44:09,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-27 16:44:09,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:09,816 INFO L225 Difference]: With dead ends: 3097 [2019-12-27 16:44:09,816 INFO L226 Difference]: Without dead ends: 509 [2019-12-27 16:44:09,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:44:09,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-12-27 16:44:09,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 311. [2019-12-27 16:44:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-12-27 16:44:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 547 transitions. [2019-12-27 16:44:09,823 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 547 transitions. Word has length 75 [2019-12-27 16:44:09,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:09,823 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 547 transitions. [2019-12-27 16:44:09,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:44:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 547 transitions. [2019-12-27 16:44:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 16:44:09,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:09,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:09,824 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:09,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:09,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1429844161, now seen corresponding path program 4 times [2019-12-27 16:44:09,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:09,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364739663] [2019-12-27 16:44:09,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:09,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364739663] [2019-12-27 16:44:09,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:09,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:44:09,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [948867707] [2019-12-27 16:44:09,950 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:09,973 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:10,226 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 182 states and 262 transitions. [2019-12-27 16:44:10,227 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:10,227 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:10,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:44:10,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:10,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:44:10,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:44:10,228 INFO L87 Difference]: Start difference. First operand 311 states and 547 transitions. Second operand 6 states. [2019-12-27 16:44:10,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:10,320 INFO L93 Difference]: Finished difference Result 609 states and 1080 transitions. [2019-12-27 16:44:10,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:44:10,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-27 16:44:10,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:10,321 INFO L225 Difference]: With dead ends: 609 [2019-12-27 16:44:10,321 INFO L226 Difference]: Without dead ends: 311 [2019-12-27 16:44:10,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:44:10,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-12-27 16:44:10,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-12-27 16:44:10,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-12-27 16:44:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 546 transitions. [2019-12-27 16:44:10,326 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 546 transitions. Word has length 75 [2019-12-27 16:44:10,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:10,326 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 546 transitions. [2019-12-27 16:44:10,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:44:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 546 transitions. [2019-12-27 16:44:10,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-27 16:44:10,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:10,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:10,327 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:10,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:10,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1721238743, now seen corresponding path program 1 times [2019-12-27 16:44:10,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:10,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513219763] [2019-12-27 16:44:10,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:10,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513219763] [2019-12-27 16:44:10,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:10,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:44:10,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [67988260] [2019-12-27 16:44:10,396 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:10,418 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:10,631 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 267 transitions. [2019-12-27 16:44:10,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:10,643 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:44:10,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:44:10,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:10,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:44:10,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:44:10,644 INFO L87 Difference]: Start difference. First operand 311 states and 546 transitions. Second operand 4 states. [2019-12-27 16:44:10,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:10,839 INFO L93 Difference]: Finished difference Result 391 states and 659 transitions. [2019-12-27 16:44:10,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:44:10,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-27 16:44:10,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:10,841 INFO L225 Difference]: With dead ends: 391 [2019-12-27 16:44:10,841 INFO L226 Difference]: Without dead ends: 391 [2019-12-27 16:44:10,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:44:10,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-12-27 16:44:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 277. [2019-12-27 16:44:10,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-12-27 16:44:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 462 transitions. [2019-12-27 16:44:10,852 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 462 transitions. Word has length 76 [2019-12-27 16:44:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:10,853 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 462 transitions. [2019-12-27 16:44:10,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:44:10,853 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 462 transitions. [2019-12-27 16:44:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 16:44:10,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:10,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:10,855 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:10,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:10,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1125574762, now seen corresponding path program 1 times [2019-12-27 16:44:10,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:10,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508666585] [2019-12-27 16:44:10,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:44:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:44:11,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508666585] [2019-12-27 16:44:11,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:44:11,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 16:44:11,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1819335070] [2019-12-27 16:44:11,278 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:44:11,309 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:44:11,535 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 242 transitions. [2019-12-27 16:44:11,536 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:44:11,536 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:44:11,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:44:11,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:44:11,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:44:11,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:44:11,538 INFO L87 Difference]: Start difference. First operand 277 states and 462 transitions. Second operand 13 states. [2019-12-27 16:44:11,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:44:11,966 INFO L93 Difference]: Finished difference Result 433 states and 713 transitions. [2019-12-27 16:44:11,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 16:44:11,967 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-12-27 16:44:11,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:44:11,968 INFO L225 Difference]: With dead ends: 433 [2019-12-27 16:44:11,968 INFO L226 Difference]: Without dead ends: 395 [2019-12-27 16:44:11,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:44:11,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-12-27 16:44:11,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 385. [2019-12-27 16:44:11,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-12-27 16:44:11,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 647 transitions. [2019-12-27 16:44:11,973 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 647 transitions. Word has length 77 [2019-12-27 16:44:11,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:44:11,973 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 647 transitions. [2019-12-27 16:44:11,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:44:11,973 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 647 transitions. [2019-12-27 16:44:11,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 16:44:11,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:44:11,974 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:44:11,975 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:44:11,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:44:11,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1455854044, now seen corresponding path program 2 times [2019-12-27 16:44:11,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:44:11,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913959786] [2019-12-27 16:44:11,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:44:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:44:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:44:12,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:44:12,113 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:44:12,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1075] [1075] ULTIMATE.startENTRY-->L839: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t825~0.base_24|) 0) (= 0 v_~z$flush_delayed~0_273) (= v_~z$r_buff0_thd1~0_51 0) (= 0 v_~z$r_buff1_thd3~0_297) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t825~0.base_24|) (= v_~z$r_buff1_thd1~0_205 0) (= 0 v_~z$r_buff1_thd4~0_383) (= v_~z$r_buff0_thd0~0_482 0) (= v_~main$tmp_guard0~0_25 0) (= v_~z$w_buff1~0_315 0) (= 0 v_~__unbuffered_p3_EBX~0_63) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff0_thd4~0_518) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t825~0.base_24| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t825~0.base_24|) |v_ULTIMATE.start_main_~#t825~0.offset_19| 0)) |v_#memory_int_27|) (= 0 v_~__unbuffered_p3_EAX~0_73) (= v_~y~0_126 0) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff0~0_383 0) (= 0 v_~x~0_106) (= 0 v_~z$mem_tmp~0_243) (= v_~z$r_buff0_thd2~0_50 0) (= v_~z~0_295 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~z$r_buff0_thd3~0_133) (< 0 |v_#StackHeapBarrier_20|) (= v_~weak$$choice2~0_323 0) (= v_~main$tmp_guard1~0_64 0) (= v_~__unbuffered_cnt~0_220 0) (= v_~z$w_buff1_used~0_723 0) (= 0 v_~weak$$choice0~0_232) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t825~0.base_24| 4)) (= v_~z$w_buff0_used~0_1076 0) (= v_~a~0_53 0) (= v_~z$r_buff1_thd2~0_205 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t825~0.base_24| 1)) (= v_~z$r_buff1_thd0~0_494 0) (= |v_ULTIMATE.start_main_~#t825~0.offset_19| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t825~0.offset=|v_ULTIMATE.start_main_~#t825~0.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_76|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_94|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_52|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_44|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_42|, ~a~0=v_~a~0_53, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_95|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_482, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_518, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ULTIMATE.start_main_~#t828~0.base=|v_ULTIMATE.start_main_~#t828~0.base_16|, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet48=|v_ULTIMATE.start_main_#t~nondet48_60|, ~z$mem_tmp~0=v_~z$mem_tmp~0_243, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t827~0.offset=|v_ULTIMATE.start_main_~#t827~0.offset_18|, ULTIMATE.start_main_~#t825~0.base=|v_ULTIMATE.start_main_~#t825~0.base_24|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_34|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_723, ~z$flush_delayed~0=v_~z$flush_delayed~0_273, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_139|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_60|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_226|, ~weak$$choice0~0=v_~weak$$choice0~0_232, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_154|, ULTIMATE.start_main_~#t828~0.offset=|v_ULTIMATE.start_main_~#t828~0.offset_14|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_205, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~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_133, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_220, ~x~0=v_~x~0_106, ULTIMATE.start_main_~#t826~0.base=|v_ULTIMATE.start_main_~#t826~0.base_23|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_383, ~z$read_delayed~0=v_~z$read_delayed~0_6, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~z$w_buff1~0=v_~z$w_buff1~0_315, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_64, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_83|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_79|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_224|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ULTIMATE.start_main_~#t826~0.offset=|v_ULTIMATE.start_main_~#t826~0.offset_18|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_494, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_60|, ~y~0=v_~y~0_126, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_50, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1076, ~z$w_buff0~0=v_~z$w_buff0~0_383, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_297, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_70|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_41|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_63, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_133|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_53|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_147|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_55|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_295, ~weak$$choice2~0=v_~weak$$choice2~0_323, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_51, ULTIMATE.start_main_~#t827~0.base=|v_ULTIMATE.start_main_~#t827~0.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t825~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t828~0.base, #length, ULTIMATE.start_main_#t~nondet48, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t827~0.offset, ULTIMATE.start_main_~#t825~0.base, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t828~0.offset, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t826~0.base, ~z$r_buff1_thd4~0, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_~#t826~0.offset, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_#t~ite70, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet49, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet40, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t827~0.base] because there is no mapped edge [2019-12-27 16:44:12,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L839-1-->L841: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t826~0.base_10|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t826~0.base_10| 4) |v_#length_17|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t826~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t826~0.base_10| 0)) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t826~0.base_10|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t826~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t826~0.base_10|) |v_ULTIMATE.start_main_~#t826~0.offset_9| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t826~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t826~0.offset=|v_ULTIMATE.start_main_~#t826~0.offset_9|, ULTIMATE.start_main_~#t826~0.base=|v_ULTIMATE.start_main_~#t826~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t826~0.offset, ULTIMATE.start_main_~#t826~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 16:44:12,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L841-1-->L843: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t827~0.base_12| 1) |v_#valid_46|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t827~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t827~0.base_12|) |v_ULTIMATE.start_main_~#t827~0.offset_10| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t827~0.base_12|) (= |v_ULTIMATE.start_main_~#t827~0.offset_10| 0) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t827~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t827~0.base_12|)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t827~0.base_12| 4) |v_#length_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t827~0.offset=|v_ULTIMATE.start_main_~#t827~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t827~0.base=|v_ULTIMATE.start_main_~#t827~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t827~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t827~0.base] because there is no mapped edge [2019-12-27 16:44:12,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] L843-1-->L845: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t828~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t828~0.base_13|) |v_ULTIMATE.start_main_~#t828~0.offset_11| 3)) |v_#memory_int_21|) (= |v_#valid_52| (store |v_#valid_53| |v_ULTIMATE.start_main_~#t828~0.base_13| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t828~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t828~0.base_13| 0)) (= 0 (select |v_#valid_53| |v_ULTIMATE.start_main_~#t828~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t828~0.offset_11|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t828~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t828~0.offset=|v_ULTIMATE.start_main_~#t828~0.offset_11|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t828~0.base=|v_ULTIMATE.start_main_~#t828~0.base_13|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t828~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t828~0.base, #length] because there is no mapped edge [2019-12-27 16:44:12,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6| 1) (= (mod v_~z$w_buff1_used~0_154 256) 0) (= v_~z$w_buff0~0_62 v_~z$w_buff1~0_45) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6| v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8) (= v_~z$w_buff0_used~0_302 v_~z$w_buff1_used~0_154) (= 2 v_~z$w_buff0~0_61) (= v_P3Thread1of1ForFork3_~arg.offset_6 |v_P3Thread1of1ForFork3_#in~arg.offset_6|) (= v_P3Thread1of1ForFork3_~arg.base_6 |v_P3Thread1of1ForFork3_#in~arg.base_6|) (= v_~z$w_buff0_used~0_301 1)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_302, ~z$w_buff0~0=v_~z$w_buff0~0_62, P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_6|, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_6|} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_301, ~z$w_buff0~0=v_~z$w_buff0~0_61, P3Thread1of1ForFork3_~arg.offset=v_P3Thread1of1ForFork3_~arg.offset_6, P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_6|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_154, ~z$w_buff1~0=v_~z$w_buff1~0_45, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6|, P3Thread1of1ForFork3_~arg.base=v_P3Thread1of1ForFork3_~arg.base_6, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_6|} AuxVars[] AssignedVars[P3Thread1of1ForFork3___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P3Thread1of1ForFork3_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression, P3Thread1of1ForFork3_~arg.base] because there is no mapped edge [2019-12-27 16:44:12,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L801-2-->L801-5: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-833881700 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-833881700 256))) (.cse2 (= |P3Thread1of1ForFork3_#t~ite11_Out-833881700| |P3Thread1of1ForFork3_#t~ite12_Out-833881700|))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out-833881700| ~z$w_buff1~0_In-833881700) (or .cse0 .cse1) .cse2) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-833881700| ~z$w_buff0~0_In-833881700) .cse2))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-833881700, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-833881700, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-833881700, ~z$w_buff1~0=~z$w_buff1~0_In-833881700} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-833881700, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-833881700, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-833881700|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-833881700, ~z$w_buff1~0=~z$w_buff1~0_In-833881700, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-833881700|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12, P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 16:44:12,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L806-->L807: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_42 256))) (= v_~z$r_buff0_thd4~0_99 v_~z$r_buff0_thd4~0_100)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_42} OutVars{P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_9|, P3Thread1of1ForFork3_#t~ite26=|v_P3Thread1of1ForFork3_#t~ite26_7|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_11|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_99, ~weak$$choice2~0=v_~weak$$choice2~0_42} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite27, P3Thread1of1ForFork3_#t~ite26, P3Thread1of1ForFork3_#t~ite25, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 16:44:12,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In606269978 256)))) (or (and .cse0 (= |P3Thread1of1ForFork3_#t~ite31_Out606269978| ~z~0_In606269978)) (and (not .cse0) (= ~z$mem_tmp~0_In606269978 |P3Thread1of1ForFork3_#t~ite31_Out606269978|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In606269978, ~z$flush_delayed~0=~z$flush_delayed~0_In606269978, ~z~0=~z~0_In606269978} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In606269978, ~z$flush_delayed~0=~z$flush_delayed~0_In606269978, ~z~0=~z~0_In606269978, P3Thread1of1ForFork3_#t~ite31=|P3Thread1of1ForFork3_#t~ite31_Out606269978|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 16:44:12,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~a~0_21 1) (= v_~x~0_33 1) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_18 |v_P0Thread1of1ForFork0_#in~arg.base_18|) (= v_P0Thread1of1ForFork0_~arg.offset_18 |v_P0Thread1of1ForFork0_#in~arg.offset_18|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_18|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} OutVars{~a~0=v_~a~0_21, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_18|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_18|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_18, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_18} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 16:44:12,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1054] [1054] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_54 2) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_83 1) (= v_~__unbuffered_cnt~0_140 (+ v_~__unbuffered_cnt~0_141 1)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_14) (= v_P1Thread1of1ForFork1_~arg.base_14 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_14, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_14, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~y~0=v_~y~0_83, ~x~0=v_~x~0_54, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 16:44:12,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L770-2-->L770-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork2_#t~ite4_Out794345453| |P2Thread1of1ForFork2_#t~ite3_Out794345453|)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In794345453 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In794345453 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite3_Out794345453| ~z$w_buff1~0_In794345453) (not .cse1) .cse2) (and .cse2 (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out794345453| ~z~0_In794345453)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In794345453, ~z$w_buff1_used~0=~z$w_buff1_used~0_In794345453, ~z$w_buff1~0=~z$w_buff1~0_In794345453, ~z~0=~z~0_In794345453} OutVars{P2Thread1of1ForFork2_#t~ite4=|P2Thread1of1ForFork2_#t~ite4_Out794345453|, P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out794345453|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In794345453, ~z$w_buff1_used~0=~z$w_buff1_used~0_In794345453, ~z$w_buff1~0=~z$w_buff1~0_In794345453, ~z~0=~z~0_In794345453} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 16:44:12,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-521652890 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-521652890 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite5_Out-521652890| ~z$w_buff0_used~0_In-521652890) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out-521652890| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-521652890, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-521652890} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-521652890|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-521652890, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-521652890} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 16:44:12,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1428862373 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1428862373 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1428862373 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1428862373 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-1428862373|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-1428862373 |P2Thread1of1ForFork2_#t~ite6_Out-1428862373|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1428862373, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1428862373, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1428862373, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1428862373} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1428862373|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1428862373, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1428862373, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1428862373, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1428862373} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 16:44:12,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In716198529 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In716198529 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out716198529|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd3~0_In716198529 |P2Thread1of1ForFork2_#t~ite7_Out716198529|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In716198529, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In716198529} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In716198529, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In716198529, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out716198529|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 16:44:12,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L774-->L774-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1443966000 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1443966000 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1443966000 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1443966000 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out1443966000|)) (and (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1443966000 |P2Thread1of1ForFork2_#t~ite8_Out1443966000|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1443966000, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1443966000, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1443966000, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1443966000} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1443966000, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1443966000, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1443966000, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1443966000, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out1443966000|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 16:44:12,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= |v_P2Thread1of1ForFork2_#t~ite8_54| v_~z$r_buff1_thd3~0_177) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_54|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_177, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_53|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 16:44:12,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-208129942 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-208129942 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite34_Out-208129942| 0) (not .cse1)) (and (= |P3Thread1of1ForFork3_#t~ite34_Out-208129942| ~z$w_buff0_used~0_In-208129942) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-208129942, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-208129942} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-208129942, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-208129942, P3Thread1of1ForFork3_#t~ite34=|P3Thread1of1ForFork3_#t~ite34_Out-208129942|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite34] because there is no mapped edge [2019-12-27 16:44:12,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L818-->L818-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In-2101816383 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2101816383 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-2101816383 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2101816383 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-2101816383 |P3Thread1of1ForFork3_#t~ite35_Out-2101816383|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P3Thread1of1ForFork3_#t~ite35_Out-2101816383|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2101816383, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2101816383, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2101816383, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2101816383} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2101816383, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2101816383, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2101816383, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2101816383, P3Thread1of1ForFork3_#t~ite35=|P3Thread1of1ForFork3_#t~ite35_Out-2101816383|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite35] because there is no mapped edge [2019-12-27 16:44:12,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L819-->L820: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1989266569 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1989266569 256) 0))) (or (and (= ~z$r_buff0_thd4~0_In1989266569 ~z$r_buff0_thd4~0_Out1989266569) (or .cse0 .cse1)) (and (= 0 ~z$r_buff0_thd4~0_Out1989266569) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1989266569, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1989266569} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1989266569, P3Thread1of1ForFork3_#t~ite36=|P3Thread1of1ForFork3_#t~ite36_Out1989266569|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1989266569} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite36, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 16:44:12,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In1863472904 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1863472904 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1863472904 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1863472904 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite37_Out1863472904| ~z$r_buff1_thd4~0_In1863472904)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite37_Out1863472904| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1863472904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1863472904, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1863472904, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1863472904} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1863472904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1863472904, P3Thread1of1ForFork3_#t~ite37=|P3Thread1of1ForFork3_#t~ite37_Out1863472904|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1863472904, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1863472904} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite37] because there is no mapped edge [2019-12-27 16:44:12,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1052] [1052] L820-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite37_52| v_~z$r_buff1_thd4~0_255) (= v_~__unbuffered_cnt~0_134 (+ v_~__unbuffered_cnt~0_135 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_255, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_51|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite37, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 16:44:12,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L845-1-->L851: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:44:12,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L851-2-->L851-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-410680053 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-410680053 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In-410680053 |ULTIMATE.start_main_#t~ite42_Out-410680053|) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In-410680053 |ULTIMATE.start_main_#t~ite42_Out-410680053|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-410680053, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-410680053, ~z$w_buff1~0=~z$w_buff1~0_In-410680053, ~z~0=~z~0_In-410680053} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-410680053, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-410680053, ~z$w_buff1~0=~z$w_buff1~0_In-410680053, ~z~0=~z~0_In-410680053, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-410680053|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:44:12,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] L851-4-->L852: Formula: (= v_~z~0_85 |v_ULTIMATE.start_main_#t~ite42_10|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} OutVars{~z~0=v_~z~0_85, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[~z~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:44:12,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L852-->L852-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1916753556 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1916753556 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1916753556| ~z$w_buff0_used~0_In1916753556)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1916753556| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1916753556, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1916753556} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1916753556, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1916753556, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1916753556|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:44:12,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L853-->L853-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1941014819 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1941014819 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1941014819 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1941014819 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1941014819|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1941014819 |ULTIMATE.start_main_#t~ite45_Out1941014819|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1941014819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1941014819, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1941014819, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1941014819} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1941014819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1941014819, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1941014819, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1941014819, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1941014819|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:44:12,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1809124911 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1809124911 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-1809124911| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-1809124911| ~z$r_buff0_thd0~0_In-1809124911)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1809124911, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1809124911} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1809124911, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1809124911, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1809124911|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 16:44:12,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1014] [1014] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In106082462 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In106082462 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In106082462 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In106082462 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite47_Out106082462|)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In106082462 |ULTIMATE.start_main_#t~ite47_Out106082462|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In106082462, ~z$w_buff0_used~0=~z$w_buff0_used~0_In106082462, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In106082462, ~z$w_buff1_used~0=~z$w_buff1_used~0_In106082462} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In106082462, ~z$w_buff0_used~0=~z$w_buff0_used~0_In106082462, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In106082462, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out106082462|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In106082462} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:44:12,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L870-->L870-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-2139636773 256) 0))) (or (and (not .cse0) (= ~z$mem_tmp~0_In-2139636773 |ULTIMATE.start_main_#t~ite70_Out-2139636773|)) (and (= ~z~0_In-2139636773 |ULTIMATE.start_main_#t~ite70_Out-2139636773|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-2139636773, ~z$flush_delayed~0=~z$flush_delayed~0_In-2139636773, ~z~0=~z~0_In-2139636773} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-2139636773, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out-2139636773|, ~z$flush_delayed~0=~z$flush_delayed~0_In-2139636773, ~z~0=~z~0_In-2139636773} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70] because there is no mapped edge [2019-12-27 16:44:12,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1070] [1070] L870-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= 0 v_~z$flush_delayed~0_270) (= v_~z~0_292 |v_ULTIMATE.start_main_#t~ite70_48|) (= (mod v_~main$tmp_guard1~0_61 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_48|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_270, ~z~0=v_~z~0_292, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite70, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:44:12,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:44:12 BasicIcfg [2019-12-27 16:44:12,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:44:12,290 INFO L168 Benchmark]: Toolchain (without parser) took 78304.31 ms. Allocated memory was 137.9 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 100.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 16:44:12,291 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 16:44:12,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 851.62 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.2 MB in the beginning and 153.6 MB in the end (delta: -53.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 16:44:12,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.73 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 150.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 16:44:12,293 INFO L168 Benchmark]: Boogie Preprocessor took 45.84 ms. Allocated memory is still 202.4 MB. Free memory was 150.2 MB in the beginning and 147.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:44:12,294 INFO L168 Benchmark]: RCFGBuilder took 1222.98 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 147.5 MB in the beginning and 201.8 MB in the end (delta: -54.3 MB). Peak memory consumption was 66.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:44:12,295 INFO L168 Benchmark]: TraceAbstraction took 76087.41 ms. Allocated memory was 234.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 201.8 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 16:44:12,299 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.17 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 851.62 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.2 MB in the beginning and 153.6 MB in the end (delta: -53.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.73 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 150.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.84 ms. Allocated memory is still 202.4 MB. Free memory was 150.2 MB in the beginning and 147.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1222.98 ms. Allocated memory was 202.4 MB in the beginning and 234.9 MB in the end (delta: 32.5 MB). Free memory was 147.5 MB in the beginning and 201.8 MB in the end (delta: -54.3 MB). Peak memory consumption was 66.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76087.41 ms. Allocated memory was 234.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 201.8 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.3s, 221 ProgramPointsBefore, 122 ProgramPointsAfterwards, 270 TransitionsBefore, 142 TransitionsAfterwards, 28796 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 34 ChoiceCompositions, 10428 VarBasedMoverChecksPositive, 374 VarBasedMoverChecksNegative, 122 SemBasedMoverChecksPositive, 390 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 0 MoverChecksTotal, 145015 CheckedPairsTotal, 133 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L839] FCALL, FORK 0 pthread_create(&t825, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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] [L841] FCALL, FORK 0 pthread_create(&t826, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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] [L843] FCALL, FORK 0 pthread_create(&t827, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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] [L845] FCALL, FORK 0 pthread_create(&t828, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0: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] [L789] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L794] 4 z$r_buff0_thd4 = (_Bool)1 [L797] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 4 z$flush_delayed = weak$$choice2 [L800] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L802] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L803] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L804] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L805] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L808] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z = z$flush_delayed ? z$mem_tmp : z [L810] 4 z$flush_delayed = (_Bool)0 [L813] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 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_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 2 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 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) [L770] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L818] 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 [L851] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] 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 [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 z$flush_delayed = weak$$choice2 [L861] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L863] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L865] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L866] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L868] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 209 locations, 2 error locations. Result: UNSAFE, OverallTime: 75.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3004 SDtfs, 5138 SDslu, 7736 SDs, 0 SdLazy, 4599 SolverSat, 434 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 110 SyntacticMatches, 18 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160294occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 20565 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 927 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 834 ConstructedInterpolants, 0 QuantifiedInterpolants, 215332 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...