/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/mix022_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:18:15,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:18:15,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:18:15,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:18:15,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:18:15,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:18:15,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:18:15,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:18:15,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:18:15,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:18:15,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:18:15,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:18:15,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:18:15,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:18:15,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:18:15,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:18:15,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:18:15,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:18:15,138 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:18:15,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:18:15,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:18:15,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:18:15,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:18:15,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:18:15,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:18:15,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:18:15,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:18:15,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:18:15,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:18:15,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:18:15,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:18:15,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:18:15,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:18:15,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:18:15,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:18:15,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:18:15,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:18:15,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:18:15,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:18:15,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:18:15,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:18:15,169 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:18:15,193 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:18:15,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:18:15,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:18:15,194 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:18:15,195 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:18:15,195 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:18:15,195 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:18:15,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:18:15,195 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:18:15,196 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:18:15,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:18:15,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:18:15,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:18:15,196 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:18:15,197 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:18:15,197 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:18:15,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:18:15,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:18:15,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:18:15,197 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:18:15,198 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:18:15,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:18:15,198 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:18:15,198 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:18:15,198 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:18:15,199 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:18:15,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:18:15,199 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:18:15,199 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:18:15,199 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:18:15,200 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:18:15,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:18:15,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:18:15,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:18:15,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:18:15,474 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:18:15,475 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.oepc.i [2019-12-27 16:18:15,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a09c456d1/2ae4880aadf34427a96eddd457944797/FLAGdd7b00eb4 [2019-12-27 16:18:16,122 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:18:16,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_rmo.oepc.i [2019-12-27 16:18:16,138 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a09c456d1/2ae4880aadf34427a96eddd457944797/FLAGdd7b00eb4 [2019-12-27 16:18:16,360 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a09c456d1/2ae4880aadf34427a96eddd457944797 [2019-12-27 16:18:16,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:18:16,371 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:18:16,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:18:16,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:18:16,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:18:16,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:18:16" (1/1) ... [2019-12-27 16:18:16,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b036ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:16, skipping insertion in model container [2019-12-27 16:18:16,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:18:16" (1/1) ... [2019-12-27 16:18:16,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:18:16,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:18:16,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:18:16,960 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:18:17,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:18:17,105 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:18:17,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:17 WrapperNode [2019-12-27 16:18:17,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:18:17,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:18:17,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:18:17,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:18:17,117 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:18:17" (1/1) ... [2019-12-27 16:18:17,137 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:18:17" (1/1) ... [2019-12-27 16:18:17,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:18:17,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:18:17,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:18:17,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:18:17,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:17" (1/1) ... [2019-12-27 16:18:17,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:17" (1/1) ... [2019-12-27 16:18:17,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:17" (1/1) ... [2019-12-27 16:18:17,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:17" (1/1) ... [2019-12-27 16:18:17,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:17" (1/1) ... [2019-12-27 16:18:17,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:17" (1/1) ... [2019-12-27 16:18:17,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:17" (1/1) ... [2019-12-27 16:18:17,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:18:17,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:18:17,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:18:17,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:18:17,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:17" (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:18:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:18:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:18:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:18:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:18:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:18:17,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:18:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:18:17,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:18:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:18:17,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:18:17,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:18:17,276 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:18:18,027 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:18:18,028 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:18:18,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:18:18 BoogieIcfgContainer [2019-12-27 16:18:18,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:18:18,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:18:18,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:18:18,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:18:18,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:18:16" (1/3) ... [2019-12-27 16:18:18,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611c7f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:18:18, skipping insertion in model container [2019-12-27 16:18:18,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:17" (2/3) ... [2019-12-27 16:18:18,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611c7f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:18:18, skipping insertion in model container [2019-12-27 16:18:18,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:18:18" (3/3) ... [2019-12-27 16:18:18,039 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_rmo.oepc.i [2019-12-27 16:18:18,049 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:18:18,050 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:18:18,057 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:18:18,059 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:18:18,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,097 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,097 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,098 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,098 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,098 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,107 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,108 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,142 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,142 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,143 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,166 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,169 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:18,184 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 16:18:18,204 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:18:18,204 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:18:18,204 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:18:18,204 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:18:18,205 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:18:18,205 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:18:18,205 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:18:18,205 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:18:18,221 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 16:18:18,223 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 16:18:18,315 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 16:18:18,315 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:18:18,337 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 16:18:18,360 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 16:18:18,414 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 16:18:18,414 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:18:18,420 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 16:18:18,434 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 16:18:18,435 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:18:23,541 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 16:18:23,676 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-27 16:18:23,677 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 16:18:23,680 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-27 16:18:24,115 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-27 16:18:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-27 16:18:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:18:24,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:24,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:18:24,125 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:24,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:24,131 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-27 16:18:24,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:24,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541579469] [2019-12-27 16:18:24,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:24,368 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:18:24,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541579469] [2019-12-27 16:18:24,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:24,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:18:24,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [766852117] [2019-12-27 16:18:24,378 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:24,384 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:24,397 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:18:24,397 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:24,401 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:24,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:18:24,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:24,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:18:24,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:18:24,421 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-27 16:18:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:24,679 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-27 16:18:24,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:18:24,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:18:24,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:24,838 INFO L225 Difference]: With dead ends: 8468 [2019-12-27 16:18:24,838 INFO L226 Difference]: Without dead ends: 7976 [2019-12-27 16:18:24,840 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:18:25,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-27 16:18:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-27 16:18:25,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-27 16:18:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-27 16:18:25,369 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-27 16:18:25,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:25,371 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-27 16:18:25,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:18:25,371 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-27 16:18:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:18:25,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:25,377 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:25,378 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:25,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:25,378 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-27 16:18:25,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:25,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018304884] [2019-12-27 16:18:25,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:25,545 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:18:25,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018304884] [2019-12-27 16:18:25,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:25,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:18:25,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1343720073] [2019-12-27 16:18:25,548 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:25,551 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:25,556 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:18:25,561 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:25,562 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:25,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:18:25,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:25,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:18:25,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:18:25,564 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-27 16:18:26,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:26,038 INFO L93 Difference]: Finished difference Result 12178 states and 37599 transitions. [2019-12-27 16:18:26,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:18:26,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:18:26,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:26,135 INFO L225 Difference]: With dead ends: 12178 [2019-12-27 16:18:26,136 INFO L226 Difference]: Without dead ends: 12171 [2019-12-27 16:18:26,138 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:18:26,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-27 16:18:27,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 10893. [2019-12-27 16:18:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10893 states. [2019-12-27 16:18:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10893 states to 10893 states and 34228 transitions. [2019-12-27 16:18:27,228 INFO L78 Accepts]: Start accepts. Automaton has 10893 states and 34228 transitions. Word has length 11 [2019-12-27 16:18:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:27,228 INFO L462 AbstractCegarLoop]: Abstraction has 10893 states and 34228 transitions. [2019-12-27 16:18:27,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:18:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 10893 states and 34228 transitions. [2019-12-27 16:18:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:18:27,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:27,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:27,240 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:27,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-27 16:18:27,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:27,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375748268] [2019-12-27 16:18:27,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:27,372 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:18:27,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375748268] [2019-12-27 16:18:27,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:27,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:18:27,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [798685494] [2019-12-27 16:18:27,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:27,375 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:27,378 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 16:18:27,378 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:27,379 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:27,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:18:27,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:27,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:18:27,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:18:27,380 INFO L87 Difference]: Start difference. First operand 10893 states and 34228 transitions. Second operand 4 states. [2019-12-27 16:18:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:27,699 INFO L93 Difference]: Finished difference Result 13366 states and 41774 transitions. [2019-12-27 16:18:27,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:18:27,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 16:18:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:27,759 INFO L225 Difference]: With dead ends: 13366 [2019-12-27 16:18:27,760 INFO L226 Difference]: Without dead ends: 13366 [2019-12-27 16:18:27,760 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:18:27,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-27 16:18:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11878. [2019-12-27 16:18:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11878 states. [2019-12-27 16:18:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11878 states to 11878 states and 37348 transitions. [2019-12-27 16:18:28,382 INFO L78 Accepts]: Start accepts. Automaton has 11878 states and 37348 transitions. Word has length 14 [2019-12-27 16:18:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:28,386 INFO L462 AbstractCegarLoop]: Abstraction has 11878 states and 37348 transitions. [2019-12-27 16:18:28,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:18:28,386 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states and 37348 transitions. [2019-12-27 16:18:28,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:18:28,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:28,391 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:18:28,391 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:28,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:28,392 INFO L82 PathProgramCache]: Analyzing trace with hash 525416671, now seen corresponding path program 1 times [2019-12-27 16:18:28,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:28,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492982711] [2019-12-27 16:18:28,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:28,485 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:18:28,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492982711] [2019-12-27 16:18:28,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:28,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:18:28,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1683826238] [2019-12-27 16:18:28,489 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:28,491 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:28,493 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 16:18:28,494 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:28,495 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:28,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:18:28,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:28,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:18:28,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:18:28,497 INFO L87 Difference]: Start difference. First operand 11878 states and 37348 transitions. Second operand 3 states. [2019-12-27 16:18:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:28,601 INFO L93 Difference]: Finished difference Result 11853 states and 37274 transitions. [2019-12-27 16:18:28,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:18:28,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 16:18:28,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:28,642 INFO L225 Difference]: With dead ends: 11853 [2019-12-27 16:18:28,643 INFO L226 Difference]: Without dead ends: 11853 [2019-12-27 16:18:28,643 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:18:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2019-12-27 16:18:29,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 11853. [2019-12-27 16:18:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11853 states. [2019-12-27 16:18:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11853 states to 11853 states and 37274 transitions. [2019-12-27 16:18:29,157 INFO L78 Accepts]: Start accepts. Automaton has 11853 states and 37274 transitions. Word has length 16 [2019-12-27 16:18:29,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:29,157 INFO L462 AbstractCegarLoop]: Abstraction has 11853 states and 37274 transitions. [2019-12-27 16:18:29,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:18:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 11853 states and 37274 transitions. [2019-12-27 16:18:29,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 16:18:29,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:29,162 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:18:29,162 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:29,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:29,162 INFO L82 PathProgramCache]: Analyzing trace with hash -886588009, now seen corresponding path program 1 times [2019-12-27 16:18:29,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:29,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566611099] [2019-12-27 16:18:29,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:29,259 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:18:29,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566611099] [2019-12-27 16:18:29,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:29,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:18:29,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [25170589] [2019-12-27 16:18:29,261 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:29,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:29,267 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 16:18:29,267 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:29,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:29,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:18:29,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:29,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:18:29,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:18:29,269 INFO L87 Difference]: Start difference. First operand 11853 states and 37274 transitions. Second operand 3 states. [2019-12-27 16:18:29,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:29,362 INFO L93 Difference]: Finished difference Result 11207 states and 34674 transitions. [2019-12-27 16:18:29,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:18:29,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 16:18:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:29,401 INFO L225 Difference]: With dead ends: 11207 [2019-12-27 16:18:29,402 INFO L226 Difference]: Without dead ends: 11207 [2019-12-27 16:18:29,402 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:18:29,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11207 states. [2019-12-27 16:18:29,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11207 to 11127. [2019-12-27 16:18:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11127 states. [2019-12-27 16:18:29,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11127 states to 11127 states and 34442 transitions. [2019-12-27 16:18:29,730 INFO L78 Accepts]: Start accepts. Automaton has 11127 states and 34442 transitions. Word has length 17 [2019-12-27 16:18:29,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:29,731 INFO L462 AbstractCegarLoop]: Abstraction has 11127 states and 34442 transitions. [2019-12-27 16:18:29,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:18:29,731 INFO L276 IsEmpty]: Start isEmpty. Operand 11127 states and 34442 transitions. [2019-12-27 16:18:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 16:18:29,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:29,735 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:18:29,736 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:29,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:29,736 INFO L82 PathProgramCache]: Analyzing trace with hash -851147492, now seen corresponding path program 1 times [2019-12-27 16:18:29,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:29,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850312277] [2019-12-27 16:18:29,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:29,794 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:18:29,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850312277] [2019-12-27 16:18:29,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:29,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:18:29,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1389920556] [2019-12-27 16:18:29,796 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:29,798 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:29,802 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 31 transitions. [2019-12-27 16:18:29,802 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:29,803 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:29,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:18:29,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:29,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:18:29,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:18:29,804 INFO L87 Difference]: Start difference. First operand 11127 states and 34442 transitions. Second operand 4 states. [2019-12-27 16:18:29,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:29,848 INFO L93 Difference]: Finished difference Result 2147 states and 5357 transitions. [2019-12-27 16:18:29,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:18:29,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 16:18:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:29,853 INFO L225 Difference]: With dead ends: 2147 [2019-12-27 16:18:29,853 INFO L226 Difference]: Without dead ends: 1515 [2019-12-27 16:18:29,853 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:18:29,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2019-12-27 16:18:29,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1515. [2019-12-27 16:18:29,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2019-12-27 16:18:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 3348 transitions. [2019-12-27 16:18:29,883 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 3348 transitions. Word has length 17 [2019-12-27 16:18:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:29,884 INFO L462 AbstractCegarLoop]: Abstraction has 1515 states and 3348 transitions. [2019-12-27 16:18:29,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:18:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 3348 transitions. [2019-12-27 16:18:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:18:29,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:29,886 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] [2019-12-27 16:18:29,886 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:29,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:29,887 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-27 16:18:29,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:29,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280610219] [2019-12-27 16:18:29,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:29,999 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:18:29,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280610219] [2019-12-27 16:18:30,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:30,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:18:30,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [556880393] [2019-12-27 16:18:30,000 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:30,008 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:30,106 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 16:18:30,106 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:30,106 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:30,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:18:30,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:30,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:18:30,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:18:30,107 INFO L87 Difference]: Start difference. First operand 1515 states and 3348 transitions. Second operand 6 states. [2019-12-27 16:18:30,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:30,746 INFO L93 Difference]: Finished difference Result 4210 states and 9198 transitions. [2019-12-27 16:18:30,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 16:18:30,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 16:18:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:30,757 INFO L225 Difference]: With dead ends: 4210 [2019-12-27 16:18:30,758 INFO L226 Difference]: Without dead ends: 4175 [2019-12-27 16:18:30,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:18:30,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4175 states. [2019-12-27 16:18:30,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4175 to 1849. [2019-12-27 16:18:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2019-12-27 16:18:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 4161 transitions. [2019-12-27 16:18:30,809 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 4161 transitions. Word has length 25 [2019-12-27 16:18:30,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:30,810 INFO L462 AbstractCegarLoop]: Abstraction has 1849 states and 4161 transitions. [2019-12-27 16:18:30,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:18:30,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 4161 transitions. [2019-12-27 16:18:30,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:18:30,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:30,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:30,813 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:30,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:30,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-27 16:18:30,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:30,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875180262] [2019-12-27 16:18:30,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:30,908 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:18:30,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875180262] [2019-12-27 16:18:30,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:30,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:18:30,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1641511984] [2019-12-27 16:18:30,909 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:30,915 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:30,922 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 16:18:30,922 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:30,922 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:30,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:18:30,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:30,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:18:30,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:18:30,923 INFO L87 Difference]: Start difference. First operand 1849 states and 4161 transitions. Second operand 6 states. [2019-12-27 16:18:31,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:31,448 INFO L93 Difference]: Finished difference Result 3919 states and 8500 transitions. [2019-12-27 16:18:31,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 16:18:31,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 16:18:31,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:31,457 INFO L225 Difference]: With dead ends: 3919 [2019-12-27 16:18:31,457 INFO L226 Difference]: Without dead ends: 3890 [2019-12-27 16:18:31,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:18:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2019-12-27 16:18:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 1828. [2019-12-27 16:18:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1828 states. [2019-12-27 16:18:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 4133 transitions. [2019-12-27 16:18:31,501 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 4133 transitions. Word has length 26 [2019-12-27 16:18:31,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:31,502 INFO L462 AbstractCegarLoop]: Abstraction has 1828 states and 4133 transitions. [2019-12-27 16:18:31,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:18:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 4133 transitions. [2019-12-27 16:18:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:18:31,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:31,505 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] [2019-12-27 16:18:31,505 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:31,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:31,505 INFO L82 PathProgramCache]: Analyzing trace with hash 382543579, now seen corresponding path program 1 times [2019-12-27 16:18:31,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:31,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568791143] [2019-12-27 16:18:31,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:31,543 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:18:31,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568791143] [2019-12-27 16:18:31,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:31,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:18:31,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1785622762] [2019-12-27 16:18:31,544 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:31,551 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:31,559 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 44 transitions. [2019-12-27 16:18:31,559 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:31,559 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:31,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:18:31,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:31,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:18:31,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:18:31,561 INFO L87 Difference]: Start difference. First operand 1828 states and 4133 transitions. Second operand 3 states. [2019-12-27 16:18:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:31,585 INFO L93 Difference]: Finished difference Result 3313 states and 7495 transitions. [2019-12-27 16:18:31,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:18:31,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-27 16:18:31,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:31,590 INFO L225 Difference]: With dead ends: 3313 [2019-12-27 16:18:31,590 INFO L226 Difference]: Without dead ends: 1754 [2019-12-27 16:18:31,591 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:18:31,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2019-12-27 16:18:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1726. [2019-12-27 16:18:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-12-27 16:18:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3821 transitions. [2019-12-27 16:18:31,622 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3821 transitions. Word has length 28 [2019-12-27 16:18:31,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:31,622 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 3821 transitions. [2019-12-27 16:18:31,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:18:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3821 transitions. [2019-12-27 16:18:31,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:18:31,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:31,625 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] [2019-12-27 16:18:31,625 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:31,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:31,626 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 2 times [2019-12-27 16:18:31,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:31,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363549868] [2019-12-27 16:18:31,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:31,704 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:18:31,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363549868] [2019-12-27 16:18:31,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:31,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:18:31,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2021413269] [2019-12-27 16:18:31,705 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:31,711 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:31,814 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 16:18:31,815 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:31,868 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:18:31,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:18:31,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:31,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:18:31,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:18:31,869 INFO L87 Difference]: Start difference. First operand 1726 states and 3821 transitions. Second operand 6 states. [2019-12-27 16:18:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:31,924 INFO L93 Difference]: Finished difference Result 890 states and 1927 transitions. [2019-12-27 16:18:31,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:18:31,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 16:18:31,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:31,927 INFO L225 Difference]: With dead ends: 890 [2019-12-27 16:18:31,927 INFO L226 Difference]: Without dead ends: 722 [2019-12-27 16:18:31,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:18:31,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-12-27 16:18:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2019-12-27 16:18:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-12-27 16:18:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1611 transitions. [2019-12-27 16:18:31,943 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1611 transitions. Word has length 28 [2019-12-27 16:18:31,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:31,943 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1611 transitions. [2019-12-27 16:18:31,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:18:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1611 transitions. [2019-12-27 16:18:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 16:18:31,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:31,947 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] [2019-12-27 16:18:31,947 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:31,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:31,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1412598433, now seen corresponding path program 1 times [2019-12-27 16:18:31,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:31,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951070826] [2019-12-27 16:18:31,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:32,043 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:18:32,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951070826] [2019-12-27 16:18:32,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:32,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:18:32,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [131397882] [2019-12-27 16:18:32,044 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:32,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:32,124 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 136 transitions. [2019-12-27 16:18:32,124 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:32,181 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:18:32,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:18:32,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:32,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:18:32,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:18:32,182 INFO L87 Difference]: Start difference. First operand 722 states and 1611 transitions. Second operand 9 states. [2019-12-27 16:18:32,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:32,425 INFO L93 Difference]: Finished difference Result 1443 states and 3133 transitions. [2019-12-27 16:18:32,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:18:32,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 16:18:32,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:32,427 INFO L225 Difference]: With dead ends: 1443 [2019-12-27 16:18:32,427 INFO L226 Difference]: Without dead ends: 966 [2019-12-27 16:18:32,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:18:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-12-27 16:18:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 795. [2019-12-27 16:18:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-12-27 16:18:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1734 transitions. [2019-12-27 16:18:32,440 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1734 transitions. Word has length 52 [2019-12-27 16:18:32,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:32,440 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1734 transitions. [2019-12-27 16:18:32,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:18:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1734 transitions. [2019-12-27 16:18:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 16:18:32,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:32,443 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] [2019-12-27 16:18:32,443 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:32,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:32,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1409603297, now seen corresponding path program 2 times [2019-12-27 16:18:32,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:32,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728839703] [2019-12-27 16:18:32,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:32,590 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:18:32,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728839703] [2019-12-27 16:18:32,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:32,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:18:32,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [928953047] [2019-12-27 16:18:32,592 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:32,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:32,684 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 140 transitions. [2019-12-27 16:18:32,685 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:32,752 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:18:32,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:18:32,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:32,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:18:32,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:18:32,754 INFO L87 Difference]: Start difference. First operand 795 states and 1734 transitions. Second operand 8 states. [2019-12-27 16:18:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:34,270 INFO L93 Difference]: Finished difference Result 2118 states and 4465 transitions. [2019-12-27 16:18:34,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 16:18:34,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 16:18:34,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:34,275 INFO L225 Difference]: With dead ends: 2118 [2019-12-27 16:18:34,275 INFO L226 Difference]: Without dead ends: 2094 [2019-12-27 16:18:34,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-27 16:18:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2019-12-27 16:18:34,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1005. [2019-12-27 16:18:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2019-12-27 16:18:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 2191 transitions. [2019-12-27 16:18:34,299 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 2191 transitions. Word has length 52 [2019-12-27 16:18:34,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:34,299 INFO L462 AbstractCegarLoop]: Abstraction has 1005 states and 2191 transitions. [2019-12-27 16:18:34,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:18:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 2191 transitions. [2019-12-27 16:18:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 16:18:34,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:34,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:34,303 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:34,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2078058895, now seen corresponding path program 3 times [2019-12-27 16:18:34,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:34,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524929768] [2019-12-27 16:18:34,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:34,401 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:18:34,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524929768] [2019-12-27 16:18:34,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:34,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:18:34,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1193245211] [2019-12-27 16:18:34,402 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:34,427 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:34,482 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 114 transitions. [2019-12-27 16:18:34,482 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:34,483 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:34,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:18:34,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:34,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:18:34,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:18:34,484 INFO L87 Difference]: Start difference. First operand 1005 states and 2191 transitions. Second operand 3 states. [2019-12-27 16:18:34,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:34,534 INFO L93 Difference]: Finished difference Result 1232 states and 2667 transitions. [2019-12-27 16:18:34,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:18:34,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 16:18:34,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:34,536 INFO L225 Difference]: With dead ends: 1232 [2019-12-27 16:18:34,536 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 16:18:34,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 3 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:18:34,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 16:18:34,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 901. [2019-12-27 16:18:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-12-27 16:18:34,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1955 transitions. [2019-12-27 16:18:34,551 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1955 transitions. Word has length 52 [2019-12-27 16:18:34,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:34,551 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1955 transitions. [2019-12-27 16:18:34,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:18:34,551 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1955 transitions. [2019-12-27 16:18:34,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 16:18:34,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:34,555 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] [2019-12-27 16:18:34,555 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:34,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:34,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 1 times [2019-12-27 16:18:34,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:34,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428368141] [2019-12-27 16:18:34,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:18:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:18:34,737 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:18:34,737 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:18:34,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t593~0.base_29| 1) |v_#valid_52|) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= v_~y$mem_tmp~0_26 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t593~0.base_29|) 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t593~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t593~0.base_29|) |v_ULTIMATE.start_main_~#t593~0.offset_20| 0)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t593~0.base_29|) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t593~0.base_29| 4)) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= |v_ULTIMATE.start_main_~#t593~0.offset_20| 0) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t594~0.offset=|v_ULTIMATE.start_main_~#t594~0.offset_14|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_~#t593~0.base=|v_ULTIMATE.start_main_~#t593~0.base_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t594~0.base=|v_ULTIMATE.start_main_~#t594~0.base_17|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ULTIMATE.start_main_~#t593~0.offset=|v_ULTIMATE.start_main_~#t593~0.offset_20|, #length=|v_#length_15|, ~y~0=v_~y~0_149, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t594~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t593~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t594~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t593~0.offset, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 16:18:34,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t594~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t594~0.base_12|) |v_ULTIMATE.start_main_~#t594~0.offset_10| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t594~0.base_12|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t594~0.base_12|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t594~0.base_12|)) (= |v_ULTIMATE.start_main_~#t594~0.offset_10| 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t594~0.base_12| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t594~0.base_12| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t594~0.base=|v_ULTIMATE.start_main_~#t594~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t594~0.offset=|v_ULTIMATE.start_main_~#t594~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t594~0.base, ULTIMATE.start_main_~#t594~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 16:18:34,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66 0)) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_66, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 16:18:34,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In946197832 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In946197832 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out946197832|) (not .cse1)) (and (= ~y$w_buff0_used~0_In946197832 |P0Thread1of1ForFork0_#t~ite5_Out946197832|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In946197832, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In946197832} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out946197832|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In946197832, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In946197832} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 16:18:34,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1497949920 256)))) (or (and (not .cse0) (= ~y$w_buff0~0_In-1497949920 |P1Thread1of1ForFork1_#t~ite15_Out-1497949920|) (= |P1Thread1of1ForFork1_#t~ite14_In-1497949920| |P1Thread1of1ForFork1_#t~ite14_Out-1497949920|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1497949920 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1497949920 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1497949920 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-1497949920 256) 0))) .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out-1497949920| |P1Thread1of1ForFork1_#t~ite15_Out-1497949920|) (= |P1Thread1of1ForFork1_#t~ite14_Out-1497949920| ~y$w_buff0~0_In-1497949920)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1497949920, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1497949920, ~y$w_buff0~0=~y$w_buff0~0_In-1497949920, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1497949920, ~weak$$choice2~0=~weak$$choice2~0_In-1497949920, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1497949920|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1497949920} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1497949920, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1497949920, ~y$w_buff0~0=~y$w_buff0~0_In-1497949920, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1497949920, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1497949920|, ~weak$$choice2~0=~weak$$choice2~0_In-1497949920, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1497949920|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1497949920} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 16:18:34,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1217025614 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1217025614 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1217025614 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1217025614 256)) .cse0) (and (= 0 (mod ~y$w_buff1_used~0_In-1217025614 256)) .cse0))) (= |P1Thread1of1ForFork1_#t~ite17_Out-1217025614| ~y$w_buff1~0_In-1217025614) .cse1 (= |P1Thread1of1ForFork1_#t~ite18_Out-1217025614| |P1Thread1of1ForFork1_#t~ite17_Out-1217025614|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite18_Out-1217025614| ~y$w_buff1~0_In-1217025614) (= |P1Thread1of1ForFork1_#t~ite17_In-1217025614| |P1Thread1of1ForFork1_#t~ite17_Out-1217025614|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1217025614, ~y$w_buff1~0=~y$w_buff1~0_In-1217025614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1217025614, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1217025614, ~weak$$choice2~0=~weak$$choice2~0_In-1217025614, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1217025614|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1217025614} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1217025614, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1217025614|, ~y$w_buff1~0=~y$w_buff1~0_In-1217025614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1217025614, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1217025614, ~weak$$choice2~0=~weak$$choice2~0_In-1217025614, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1217025614|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1217025614} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 16:18:34,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In149784839 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In149784839 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In149784839 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In149784839 256) 0))) (or (and (= ~y$w_buff1_used~0_In149784839 |P0Thread1of1ForFork0_#t~ite6_Out149784839|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out149784839|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In149784839, ~y$w_buff0_used~0=~y$w_buff0_used~0_In149784839, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In149784839, ~y$w_buff1_used~0=~y$w_buff1_used~0_In149784839} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out149784839|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In149784839, ~y$w_buff0_used~0=~y$w_buff0_used~0_In149784839, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In149784839, ~y$w_buff1_used~0=~y$w_buff1_used~0_In149784839} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 16:18:34,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1854467361 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1854467361 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out1854467361 0)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_Out1854467361 ~y$r_buff0_thd1~0_In1854467361)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1854467361, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1854467361} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1854467361, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1854467361|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1854467361} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:18:34,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-148623877 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-148623877 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-148623877 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-148623877 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In-148623877 |P0Thread1of1ForFork0_#t~ite8_Out-148623877|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-148623877|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-148623877, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-148623877, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-148623877, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-148623877} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-148623877, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-148623877, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-148623877|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-148623877, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-148623877} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 16:18:34,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-536000277 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-536000277 256)))) (or (= (mod ~y$w_buff0_used~0_In-536000277 256) 0) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In-536000277 256) 0)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-536000277 256))))) (= ~y$w_buff0_used~0_In-536000277 |P1Thread1of1ForFork1_#t~ite20_Out-536000277|) .cse1 (= |P1Thread1of1ForFork1_#t~ite21_Out-536000277| |P1Thread1of1ForFork1_#t~ite20_Out-536000277|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-536000277| ~y$w_buff0_used~0_In-536000277) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In-536000277| |P1Thread1of1ForFork1_#t~ite20_Out-536000277|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-536000277, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-536000277, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-536000277|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-536000277, ~weak$$choice2~0=~weak$$choice2~0_In-536000277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-536000277} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-536000277, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-536000277, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-536000277|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-536000277, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-536000277|, ~weak$$choice2~0=~weak$$choice2~0_In-536000277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-536000277} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 16:18:34,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 16:18:34,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1605495669 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In1605495669| |P1Thread1of1ForFork1_#t~ite29_Out1605495669|) (= ~y$r_buff1_thd2~0_In1605495669 |P1Thread1of1ForFork1_#t~ite30_Out1605495669|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1605495669 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1605495669 256))) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1605495669 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1605495669 256)))) .cse0 (= ~y$r_buff1_thd2~0_In1605495669 |P1Thread1of1ForFork1_#t~ite29_Out1605495669|) (= |P1Thread1of1ForFork1_#t~ite30_Out1605495669| |P1Thread1of1ForFork1_#t~ite29_Out1605495669|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1605495669, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1605495669|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1605495669, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1605495669, ~weak$$choice2~0=~weak$$choice2~0_In1605495669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1605495669} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1605495669, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1605495669|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1605495669|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1605495669, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1605495669, ~weak$$choice2~0=~weak$$choice2~0_In1605495669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1605495669} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 16:18:34,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:18:34,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 16:18:34,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1548127054 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1548127054 256)))) (or (and (= ~y~0_In1548127054 |P1Thread1of1ForFork1_#t~ite32_Out1548127054|) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff1~0_In1548127054 |P1Thread1of1ForFork1_#t~ite32_Out1548127054|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1548127054, ~y$w_buff1~0=~y$w_buff1~0_In1548127054, ~y~0=~y~0_In1548127054, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1548127054} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1548127054, ~y$w_buff1~0=~y$w_buff1~0_In1548127054, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1548127054|, ~y~0=~y~0_In1548127054, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1548127054} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 16:18:34,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 16:18:34,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1865500119 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1865500119 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-1865500119| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1865500119 |P1Thread1of1ForFork1_#t~ite34_Out-1865500119|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1865500119, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1865500119} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1865500119, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1865500119, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1865500119|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 16:18:34,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1118010344 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1118010344 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1118010344 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1118010344 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1118010344 |P1Thread1of1ForFork1_#t~ite35_Out-1118010344|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1118010344|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1118010344, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1118010344, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1118010344, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1118010344} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1118010344, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1118010344, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1118010344, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1118010344|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1118010344} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 16:18:34,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1433280653 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1433280653 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out1433280653| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In1433280653 |P1Thread1of1ForFork1_#t~ite36_Out1433280653|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1433280653, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1433280653} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1433280653, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1433280653, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1433280653|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 16:18:34,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1362027859 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1362027859 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1362027859 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1362027859 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out1362027859| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out1362027859| ~y$r_buff1_thd2~0_In1362027859) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1362027859, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1362027859, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1362027859, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1362027859} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1362027859, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1362027859, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1362027859, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1362027859|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1362027859} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:18:34,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:18:34,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 16:18:34,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1120537434 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1120537434 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1120537434 |ULTIMATE.start_main_#t~ite40_Out-1120537434|) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-1120537434 |ULTIMATE.start_main_#t~ite40_Out-1120537434|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1120537434, ~y~0=~y~0_In-1120537434, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1120537434, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1120537434} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1120537434|, ~y$w_buff1~0=~y$w_buff1~0_In-1120537434, ~y~0=~y~0_In-1120537434, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1120537434, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1120537434} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:18:34,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 16:18:34,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In388369111 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In388369111 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out388369111| 0)) (and (= |ULTIMATE.start_main_#t~ite42_Out388369111| ~y$w_buff0_used~0_In388369111) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In388369111, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In388369111} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In388369111, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In388369111, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out388369111|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:18:34,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In360623629 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In360623629 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In360623629 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In360623629 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out360623629| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In360623629 |ULTIMATE.start_main_#t~ite43_Out360623629|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In360623629, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In360623629, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In360623629, ~y$w_buff1_used~0=~y$w_buff1_used~0_In360623629} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In360623629, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In360623629, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out360623629|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In360623629, ~y$w_buff1_used~0=~y$w_buff1_used~0_In360623629} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 16:18:34,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1057767915 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1057767915 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1057767915| ~y$r_buff0_thd0~0_In1057767915)) (and (= |ULTIMATE.start_main_#t~ite44_Out1057767915| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1057767915, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1057767915} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1057767915, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1057767915, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1057767915|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:18:34,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-99120966 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-99120966 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-99120966 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-99120966 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-99120966 |ULTIMATE.start_main_#t~ite45_Out-99120966|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-99120966|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-99120966, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-99120966, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-99120966, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99120966} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-99120966, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-99120966, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-99120966, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-99120966|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-99120966} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:18:34,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p1_EBX~0_24 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:18:34,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:18:34 BasicIcfg [2019-12-27 16:18:34,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:18:34,868 INFO L168 Benchmark]: Toolchain (without parser) took 18496.39 ms. Allocated memory was 138.4 MB in the beginning and 684.7 MB in the end (delta: 546.3 MB). Free memory was 100.9 MB in the beginning and 262.7 MB in the end (delta: -161.8 MB). Peak memory consumption was 384.5 MB. Max. memory is 7.1 GB. [2019-12-27 16:18:34,868 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 16:18:34,869 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.18 ms. Allocated memory was 138.4 MB in the beginning and 203.9 MB in the end (delta: 65.5 MB). Free memory was 100.4 MB in the beginning and 157.9 MB in the end (delta: -57.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 16:18:34,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.59 ms. Allocated memory is still 203.9 MB. Free memory was 157.9 MB in the beginning and 155.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:18:34,872 INFO L168 Benchmark]: Boogie Preprocessor took 36.25 ms. Allocated memory is still 203.9 MB. Free memory was 155.9 MB in the beginning and 153.2 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:18:34,874 INFO L168 Benchmark]: RCFGBuilder took 826.29 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 109.2 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:18:34,877 INFO L168 Benchmark]: TraceAbstraction took 16834.50 ms. Allocated memory was 203.9 MB in the beginning and 684.7 MB in the end (delta: 480.8 MB). Free memory was 108.6 MB in the beginning and 262.7 MB in the end (delta: -154.1 MB). Peak memory consumption was 326.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:18:34,884 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.19 ms. Allocated memory is still 138.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 734.18 ms. Allocated memory was 138.4 MB in the beginning and 203.9 MB in the end (delta: 65.5 MB). Free memory was 100.4 MB in the beginning and 157.9 MB in the end (delta: -57.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.59 ms. Allocated memory is still 203.9 MB. Free memory was 157.9 MB in the beginning and 155.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.25 ms. Allocated memory is still 203.9 MB. Free memory was 155.9 MB in the beginning and 153.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 826.29 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 109.2 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16834.50 ms. Allocated memory was 203.9 MB in the beginning and 684.7 MB in the end (delta: 480.8 MB). Free memory was 108.6 MB in the beginning and 262.7 MB in the end (delta: -154.1 MB). Peak memory consumption was 326.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t593, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t594, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1669 SDtfs, 2009 SDslu, 3172 SDs, 0 SdLazy, 2172 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 30 SyntacticMatches, 12 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11878occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 8853 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 394 NumberOfCodeBlocks, 394 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 43766 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...