/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:25:42,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:25:42,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:25:42,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:25:42,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:25:42,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:25:42,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:25:42,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:25:42,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:25:42,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:25:42,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:25:42,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:25:42,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:25:42,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:25:42,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:25:42,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:25:42,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:25:42,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:25:42,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:25:42,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:25:42,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:25:42,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:25:42,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:25:42,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:25:42,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:25:42,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:25:42,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:25:42,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:25:42,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:25:42,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:25:42,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:25:42,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:25:42,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:25:42,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:25:42,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:25:42,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:25:42,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:25:42,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:25:42,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:25:42,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:25:42,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:25:42,105 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:25:42,120 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:25:42,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:25:42,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:25:42,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:25:42,122 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:25:42,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:25:42,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:25:42,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:25:42,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:25:42,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:25:42,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:25:42,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:25:42,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:25:42,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:25:42,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:25:42,124 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:25:42,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:25:42,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:25:42,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:25:42,124 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:25:42,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:25:42,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:25:42,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:25:42,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:25:42,125 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:25:42,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:25:42,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:25:42,126 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:25:42,126 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:25:42,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:25:42,127 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:25:42,127 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:25:42,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:25:42,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:25:42,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:25:42,428 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:25:42,428 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:25:42,429 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_pso.opt.i [2019-12-27 22:25:42,500 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/269300b3e/a2593253d03649628066369f9d71b994/FLAGa022e5c77 [2019-12-27 22:25:43,115 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:25:43,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_pso.opt.i [2019-12-27 22:25:43,131 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/269300b3e/a2593253d03649628066369f9d71b994/FLAGa022e5c77 [2019-12-27 22:25:43,345 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/269300b3e/a2593253d03649628066369f9d71b994 [2019-12-27 22:25:43,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:25:43,355 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:25:43,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:25:43,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:25:43,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:25:43,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:25:43" (1/1) ... [2019-12-27 22:25:43,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7e5a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:43, skipping insertion in model container [2019-12-27 22:25:43,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:25:43" (1/1) ... [2019-12-27 22:25:43,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:25:43,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:25:43,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:25:43,963 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:25:44,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:25:44,168 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:25:44,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:44 WrapperNode [2019-12-27 22:25:44,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:25:44,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:25:44,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:25:44,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:25:44,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:44" (1/1) ... [2019-12-27 22:25:44,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:44" (1/1) ... [2019-12-27 22:25:44,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:25:44,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:25:44,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:25:44,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:25:44,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:44" (1/1) ... [2019-12-27 22:25:44,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:44" (1/1) ... [2019-12-27 22:25:44,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:44" (1/1) ... [2019-12-27 22:25:44,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:44" (1/1) ... [2019-12-27 22:25:44,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:44" (1/1) ... [2019-12-27 22:25:44,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:44" (1/1) ... [2019-12-27 22:25:44,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:44" (1/1) ... [2019-12-27 22:25:44,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:25:44,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:25:44,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:25:44,310 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:25:44,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:25:44,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:25:44,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:25:44,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:25:44,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:25:44,393 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:25:44,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:25:44,394 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:25:44,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:25:44,394 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:25:44,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:25:44,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:25:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:25:44,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:25:44,398 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 22:25:45,114 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:25:45,115 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:25:45,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:25:45 BoogieIcfgContainer [2019-12-27 22:25:45,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:25:45,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:25:45,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:25:45,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:25:45,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:25:43" (1/3) ... [2019-12-27 22:25:45,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c0261d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:25:45, skipping insertion in model container [2019-12-27 22:25:45,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:44" (2/3) ... [2019-12-27 22:25:45,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c0261d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:25:45, skipping insertion in model container [2019-12-27 22:25:45,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:25:45" (3/3) ... [2019-12-27 22:25:45,125 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_pso.opt.i [2019-12-27 22:25:45,135 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:25:45,135 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:25:45,142 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:25:45,143 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:25:45,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,182 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,182 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,206 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,206 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,207 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,207 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,207 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,215 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,215 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,240 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,240 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,241 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,246 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,247 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,251 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,251 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:45,271 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:25:45,291 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:25:45,291 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:25:45,291 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:25:45,291 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:25:45,292 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:25:45,292 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:25:45,292 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:25:45,292 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:25:45,308 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 22:25:45,310 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 22:25:45,436 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 22:25:45,437 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:25:45,452 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:25:45,473 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 22:25:45,523 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 22:25:45,523 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:25:45,530 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:25:45,549 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 22:25:45,550 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:25:49,154 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 22:25:49,282 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 22:25:49,362 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68909 [2019-12-27 22:25:49,362 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 22:25:49,366 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions [2019-12-27 22:26:02,022 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92280 states. [2019-12-27 22:26:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 92280 states. [2019-12-27 22:26:02,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:26:02,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:02,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:26:02,032 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:02,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:02,038 INFO L82 PathProgramCache]: Analyzing trace with hash 793714210, now seen corresponding path program 1 times [2019-12-27 22:26:02,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:02,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103024826] [2019-12-27 22:26:02,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:02,319 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 22:26:02,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103024826] [2019-12-27 22:26:02,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:02,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:26:02,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1040253505] [2019-12-27 22:26:02,326 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:02,331 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:02,343 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:26:02,343 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:02,347 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:26:02,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:26:02,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:02,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:26:02,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:26:02,365 INFO L87 Difference]: Start difference. First operand 92280 states. Second operand 3 states. [2019-12-27 22:26:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:04,702 INFO L93 Difference]: Finished difference Result 90395 states and 387830 transitions. [2019-12-27 22:26:04,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:26:04,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:26:04,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:05,288 INFO L225 Difference]: With dead ends: 90395 [2019-12-27 22:26:05,288 INFO L226 Difference]: Without dead ends: 85117 [2019-12-27 22:26:05,293 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 22:26:10,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85117 states. [2019-12-27 22:26:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85117 to 85117. [2019-12-27 22:26:12,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85117 states. [2019-12-27 22:26:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85117 states to 85117 states and 364674 transitions. [2019-12-27 22:26:16,266 INFO L78 Accepts]: Start accepts. Automaton has 85117 states and 364674 transitions. Word has length 5 [2019-12-27 22:26:16,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:16,266 INFO L462 AbstractCegarLoop]: Abstraction has 85117 states and 364674 transitions. [2019-12-27 22:26:16,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:26:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand 85117 states and 364674 transitions. [2019-12-27 22:26:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:26:16,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:16,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:16,276 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:16,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:16,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1502291338, now seen corresponding path program 1 times [2019-12-27 22:26:16,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:16,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822254874] [2019-12-27 22:26:16,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:16,402 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 22:26:16,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822254874] [2019-12-27 22:26:16,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:16,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:26:16,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [721423849] [2019-12-27 22:26:16,404 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:16,406 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:16,410 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:26:16,410 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:16,411 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:26:16,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:26:16,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:16,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:26:16,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:26:16,413 INFO L87 Difference]: Start difference. First operand 85117 states and 364674 transitions. Second operand 4 states. [2019-12-27 22:26:21,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:21,339 INFO L93 Difference]: Finished difference Result 130038 states and 533020 transitions. [2019-12-27 22:26:21,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:26:21,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:26:21,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:22,008 INFO L225 Difference]: With dead ends: 130038 [2019-12-27 22:26:22,008 INFO L226 Difference]: Without dead ends: 129940 [2019-12-27 22:26:22,009 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 22:26:25,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129940 states. [2019-12-27 22:26:27,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129940 to 116665. [2019-12-27 22:26:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116665 states. [2019-12-27 22:26:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116665 states to 116665 states and 485676 transitions. [2019-12-27 22:26:28,366 INFO L78 Accepts]: Start accepts. Automaton has 116665 states and 485676 transitions. Word has length 13 [2019-12-27 22:26:28,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:28,367 INFO L462 AbstractCegarLoop]: Abstraction has 116665 states and 485676 transitions. [2019-12-27 22:26:28,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:26:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 116665 states and 485676 transitions. [2019-12-27 22:26:28,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:26:28,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:28,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:28,371 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:28,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:28,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1013715486, now seen corresponding path program 1 times [2019-12-27 22:26:28,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:28,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476408267] [2019-12-27 22:26:28,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:28,517 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 22:26:28,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476408267] [2019-12-27 22:26:28,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:28,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:26:28,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [850428271] [2019-12-27 22:26:28,518 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:28,521 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:28,523 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:26:28,523 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:28,523 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:26:28,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:26:28,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:28,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:26:28,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:26:28,524 INFO L87 Difference]: Start difference. First operand 116665 states and 485676 transitions. Second operand 4 states. [2019-12-27 22:26:32,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:32,100 INFO L93 Difference]: Finished difference Result 37434 states and 130812 transitions. [2019-12-27 22:26:32,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:26:32,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:26:32,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:32,186 INFO L225 Difference]: With dead ends: 37434 [2019-12-27 22:26:32,186 INFO L226 Difference]: Without dead ends: 29372 [2019-12-27 22:26:32,187 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 22:26:32,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29372 states. [2019-12-27 22:26:32,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29372 to 29300. [2019-12-27 22:26:32,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29300 states. [2019-12-27 22:26:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29300 states to 29300 states and 98618 transitions. [2019-12-27 22:26:32,780 INFO L78 Accepts]: Start accepts. Automaton has 29300 states and 98618 transitions. Word has length 13 [2019-12-27 22:26:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:32,780 INFO L462 AbstractCegarLoop]: Abstraction has 29300 states and 98618 transitions. [2019-12-27 22:26:32,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:26:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 29300 states and 98618 transitions. [2019-12-27 22:26:32,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:26:32,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:32,783 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:32,783 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:32,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:32,783 INFO L82 PathProgramCache]: Analyzing trace with hash -19781077, now seen corresponding path program 1 times [2019-12-27 22:26:32,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:32,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568528491] [2019-12-27 22:26:32,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:32,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:26:32,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568528491] [2019-12-27 22:26:32,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:32,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:26:32,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2105915255] [2019-12-27 22:26:32,838 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:32,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:32,843 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:26:32,843 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:32,893 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:26:32,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:26:32,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:32,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:26:32,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:26:32,894 INFO L87 Difference]: Start difference. First operand 29300 states and 98618 transitions. Second operand 5 states. [2019-12-27 22:26:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:33,116 INFO L93 Difference]: Finished difference Result 43227 states and 144586 transitions. [2019-12-27 22:26:33,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:26:33,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:26:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:33,238 INFO L225 Difference]: With dead ends: 43227 [2019-12-27 22:26:33,238 INFO L226 Difference]: Without dead ends: 43227 [2019-12-27 22:26:33,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:26:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43227 states. [2019-12-27 22:26:34,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43227 to 32227. [2019-12-27 22:26:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32227 states. [2019-12-27 22:26:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32227 states to 32227 states and 107573 transitions. [2019-12-27 22:26:34,320 INFO L78 Accepts]: Start accepts. Automaton has 32227 states and 107573 transitions. Word has length 14 [2019-12-27 22:26:34,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:34,320 INFO L462 AbstractCegarLoop]: Abstraction has 32227 states and 107573 transitions. [2019-12-27 22:26:34,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:26:34,320 INFO L276 IsEmpty]: Start isEmpty. Operand 32227 states and 107573 transitions. [2019-12-27 22:26:34,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:26:34,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:34,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:34,322 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:34,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:34,322 INFO L82 PathProgramCache]: Analyzing trace with hash -19914749, now seen corresponding path program 1 times [2019-12-27 22:26:34,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:34,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220362784] [2019-12-27 22:26:34,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:34,436 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 22:26:34,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220362784] [2019-12-27 22:26:34,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:34,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:26:34,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [76596561] [2019-12-27 22:26:34,437 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:34,440 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:34,443 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:26:34,443 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:34,482 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:26:34,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:26:34,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:34,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:26:34,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:26:34,486 INFO L87 Difference]: Start difference. First operand 32227 states and 107573 transitions. Second operand 5 states. [2019-12-27 22:26:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:34,899 INFO L93 Difference]: Finished difference Result 39628 states and 130327 transitions. [2019-12-27 22:26:34,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:26:34,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:26:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:34,968 INFO L225 Difference]: With dead ends: 39628 [2019-12-27 22:26:34,968 INFO L226 Difference]: Without dead ends: 39539 [2019-12-27 22:26:34,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:26:35,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39539 states. [2019-12-27 22:26:35,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39539 to 34645. [2019-12-27 22:26:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34645 states. [2019-12-27 22:26:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34645 states to 34645 states and 115289 transitions. [2019-12-27 22:26:35,623 INFO L78 Accepts]: Start accepts. Automaton has 34645 states and 115289 transitions. Word has length 14 [2019-12-27 22:26:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:35,623 INFO L462 AbstractCegarLoop]: Abstraction has 34645 states and 115289 transitions. [2019-12-27 22:26:35,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:26:35,623 INFO L276 IsEmpty]: Start isEmpty. Operand 34645 states and 115289 transitions. [2019-12-27 22:26:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:26:35,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:35,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:35,626 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:35,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:35,626 INFO L82 PathProgramCache]: Analyzing trace with hash 140256175, now seen corresponding path program 1 times [2019-12-27 22:26:35,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:35,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421174881] [2019-12-27 22:26:35,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:35,694 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 22:26:35,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421174881] [2019-12-27 22:26:35,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:35,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:26:35,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [172438119] [2019-12-27 22:26:35,695 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:35,696 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:35,700 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:26:35,700 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:35,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:26:35,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:26:35,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:35,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:26:35,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:26:35,968 INFO L87 Difference]: Start difference. First operand 34645 states and 115289 transitions. Second operand 5 states. [2019-12-27 22:26:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:36,374 INFO L93 Difference]: Finished difference Result 41557 states and 136749 transitions. [2019-12-27 22:26:36,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:26:36,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:26:36,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:36,453 INFO L225 Difference]: With dead ends: 41557 [2019-12-27 22:26:36,454 INFO L226 Difference]: Without dead ends: 41459 [2019-12-27 22:26:36,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:26:36,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41459 states. [2019-12-27 22:26:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41459 to 35260. [2019-12-27 22:26:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35260 states. [2019-12-27 22:26:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35260 states to 35260 states and 117020 transitions. [2019-12-27 22:26:37,153 INFO L78 Accepts]: Start accepts. Automaton has 35260 states and 117020 transitions. Word has length 14 [2019-12-27 22:26:37,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:37,154 INFO L462 AbstractCegarLoop]: Abstraction has 35260 states and 117020 transitions. [2019-12-27 22:26:37,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:26:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 35260 states and 117020 transitions. [2019-12-27 22:26:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:26:37,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:37,167 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] [2019-12-27 22:26:37,167 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:37,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:37,168 INFO L82 PathProgramCache]: Analyzing trace with hash -108369065, now seen corresponding path program 1 times [2019-12-27 22:26:37,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:37,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057501049] [2019-12-27 22:26:37,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:37,267 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 22:26:37,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057501049] [2019-12-27 22:26:37,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:37,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:26:37,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [873876569] [2019-12-27 22:26:37,270 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:37,274 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:37,288 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 112 transitions. [2019-12-27 22:26:37,288 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:37,318 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:26:37,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:26:37,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:37,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:26:37,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:26:37,319 INFO L87 Difference]: Start difference. First operand 35260 states and 117020 transitions. Second operand 6 states. [2019-12-27 22:26:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:37,998 INFO L93 Difference]: Finished difference Result 47518 states and 155149 transitions. [2019-12-27 22:26:37,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:26:37,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:26:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:38,074 INFO L225 Difference]: With dead ends: 47518 [2019-12-27 22:26:38,075 INFO L226 Difference]: Without dead ends: 47342 [2019-12-27 22:26:38,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:26:38,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47342 states. [2019-12-27 22:26:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47342 to 35974. [2019-12-27 22:26:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35974 states. [2019-12-27 22:26:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35974 states to 35974 states and 119384 transitions. [2019-12-27 22:26:39,088 INFO L78 Accepts]: Start accepts. Automaton has 35974 states and 119384 transitions. Word has length 22 [2019-12-27 22:26:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:39,088 INFO L462 AbstractCegarLoop]: Abstraction has 35974 states and 119384 transitions. [2019-12-27 22:26:39,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:26:39,089 INFO L276 IsEmpty]: Start isEmpty. Operand 35974 states and 119384 transitions. [2019-12-27 22:26:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:26:39,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:39,098 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] [2019-12-27 22:26:39,098 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:39,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:39,099 INFO L82 PathProgramCache]: Analyzing trace with hash 576586499, now seen corresponding path program 1 times [2019-12-27 22:26:39,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:39,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677346701] [2019-12-27 22:26:39,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:39,194 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 22:26:39,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677346701] [2019-12-27 22:26:39,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:39,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:26:39,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1973400506] [2019-12-27 22:26:39,196 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:39,199 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:39,212 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 112 transitions. [2019-12-27 22:26:39,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:39,255 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:26:39,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:26:39,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:39,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:26:39,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:26:39,256 INFO L87 Difference]: Start difference. First operand 35974 states and 119384 transitions. Second operand 6 states. [2019-12-27 22:26:39,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:39,968 INFO L93 Difference]: Finished difference Result 47846 states and 156183 transitions. [2019-12-27 22:26:39,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:26:39,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:26:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:40,047 INFO L225 Difference]: With dead ends: 47846 [2019-12-27 22:26:40,047 INFO L226 Difference]: Without dead ends: 47578 [2019-12-27 22:26:40,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:26:40,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47578 states. [2019-12-27 22:26:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47578 to 33984. [2019-12-27 22:26:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33984 states. [2019-12-27 22:26:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33984 states to 33984 states and 112757 transitions. [2019-12-27 22:26:41,135 INFO L78 Accepts]: Start accepts. Automaton has 33984 states and 112757 transitions. Word has length 22 [2019-12-27 22:26:41,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:41,136 INFO L462 AbstractCegarLoop]: Abstraction has 33984 states and 112757 transitions. [2019-12-27 22:26:41,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:26:41,136 INFO L276 IsEmpty]: Start isEmpty. Operand 33984 states and 112757 transitions. [2019-12-27 22:26:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:26:41,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:41,149 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 22:26:41,149 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:41,150 INFO L82 PathProgramCache]: Analyzing trace with hash -589690530, now seen corresponding path program 1 times [2019-12-27 22:26:41,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:41,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98501585] [2019-12-27 22:26:41,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:41,215 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 22:26:41,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98501585] [2019-12-27 22:26:41,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:41,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:26:41,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1554617431] [2019-12-27 22:26:41,217 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:41,220 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:41,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:26:41,225 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:41,225 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:26:41,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:26:41,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:41,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:26:41,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:26:41,226 INFO L87 Difference]: Start difference. First operand 33984 states and 112757 transitions. Second operand 5 states. [2019-12-27 22:26:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:41,344 INFO L93 Difference]: Finished difference Result 15710 states and 48416 transitions. [2019-12-27 22:26:41,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:26:41,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 22:26:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:41,363 INFO L225 Difference]: With dead ends: 15710 [2019-12-27 22:26:41,363 INFO L226 Difference]: Without dead ends: 13401 [2019-12-27 22:26:41,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:26:41,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13401 states. [2019-12-27 22:26:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13401 to 13209. [2019-12-27 22:26:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13209 states. [2019-12-27 22:26:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13209 states to 13209 states and 40432 transitions. [2019-12-27 22:26:41,549 INFO L78 Accepts]: Start accepts. Automaton has 13209 states and 40432 transitions. Word has length 25 [2019-12-27 22:26:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:41,549 INFO L462 AbstractCegarLoop]: Abstraction has 13209 states and 40432 transitions. [2019-12-27 22:26:41,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:26:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 13209 states and 40432 transitions. [2019-12-27 22:26:41,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 22:26:41,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:41,568 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] [2019-12-27 22:26:41,568 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:41,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:41,568 INFO L82 PathProgramCache]: Analyzing trace with hash -112163197, now seen corresponding path program 1 times [2019-12-27 22:26:41,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:41,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363570975] [2019-12-27 22:26:41,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:41,632 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 22:26:41,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363570975] [2019-12-27 22:26:41,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:41,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:26:41,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [920708270] [2019-12-27 22:26:41,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:41,640 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:41,676 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 143 transitions. [2019-12-27 22:26:41,677 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:41,720 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:26:41,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:26:41,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:41,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:26:41,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:26:41,721 INFO L87 Difference]: Start difference. First operand 13209 states and 40432 transitions. Second operand 4 states. [2019-12-27 22:26:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:42,021 INFO L93 Difference]: Finished difference Result 31222 states and 94972 transitions. [2019-12-27 22:26:42,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:26:42,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 22:26:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:42,059 INFO L225 Difference]: With dead ends: 31222 [2019-12-27 22:26:42,059 INFO L226 Difference]: Without dead ends: 20600 [2019-12-27 22:26:42,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:26:42,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20600 states. [2019-12-27 22:26:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20600 to 13402. [2019-12-27 22:26:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13402 states. [2019-12-27 22:26:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13402 states to 13402 states and 40153 transitions. [2019-12-27 22:26:42,326 INFO L78 Accepts]: Start accepts. Automaton has 13402 states and 40153 transitions. Word has length 39 [2019-12-27 22:26:42,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:42,327 INFO L462 AbstractCegarLoop]: Abstraction has 13402 states and 40153 transitions. [2019-12-27 22:26:42,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:26:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 13402 states and 40153 transitions. [2019-12-27 22:26:42,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:26:42,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:42,346 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] [2019-12-27 22:26:42,346 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:42,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:42,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2009375071, now seen corresponding path program 1 times [2019-12-27 22:26:42,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:42,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165611429] [2019-12-27 22:26:42,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:42,430 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 22:26:42,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165611429] [2019-12-27 22:26:42,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:42,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:26:42,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2021938713] [2019-12-27 22:26:42,431 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:42,440 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:42,494 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 202 transitions. [2019-12-27 22:26:42,495 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:42,511 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:26:42,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:26:42,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:42,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:26:42,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:26:42,513 INFO L87 Difference]: Start difference. First operand 13402 states and 40153 transitions. Second operand 7 states. [2019-12-27 22:26:42,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:42,646 INFO L93 Difference]: Finished difference Result 12245 states and 37182 transitions. [2019-12-27 22:26:42,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:26:42,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 22:26:42,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:42,665 INFO L225 Difference]: With dead ends: 12245 [2019-12-27 22:26:42,665 INFO L226 Difference]: Without dead ends: 10091 [2019-12-27 22:26:42,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:26:42,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10091 states. [2019-12-27 22:26:42,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10091 to 9467. [2019-12-27 22:26:42,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9467 states. [2019-12-27 22:26:42,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9467 states to 9467 states and 29555 transitions. [2019-12-27 22:26:42,885 INFO L78 Accepts]: Start accepts. Automaton has 9467 states and 29555 transitions. Word has length 40 [2019-12-27 22:26:42,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:42,886 INFO L462 AbstractCegarLoop]: Abstraction has 9467 states and 29555 transitions. [2019-12-27 22:26:42,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:26:42,886 INFO L276 IsEmpty]: Start isEmpty. Operand 9467 states and 29555 transitions. [2019-12-27 22:26:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:26:42,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:42,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:42,906 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:42,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:42,906 INFO L82 PathProgramCache]: Analyzing trace with hash -26633300, now seen corresponding path program 1 times [2019-12-27 22:26:42,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:42,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599216140] [2019-12-27 22:26:42,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:42,996 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 22:26:42,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599216140] [2019-12-27 22:26:42,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:42,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:26:42,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [23181412] [2019-12-27 22:26:42,998 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:43,014 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:43,338 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 436 transitions. [2019-12-27 22:26:43,338 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:43,410 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:26:43,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:26:43,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:43,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:26:43,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:26:43,412 INFO L87 Difference]: Start difference. First operand 9467 states and 29555 transitions. Second operand 7 states. [2019-12-27 22:26:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:43,783 INFO L93 Difference]: Finished difference Result 25853 states and 80397 transitions. [2019-12-27 22:26:43,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:26:43,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 22:26:43,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:43,814 INFO L225 Difference]: With dead ends: 25853 [2019-12-27 22:26:43,814 INFO L226 Difference]: Without dead ends: 19749 [2019-12-27 22:26:43,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:26:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19749 states. [2019-12-27 22:26:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19749 to 11483. [2019-12-27 22:26:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11483 states. [2019-12-27 22:26:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11483 states to 11483 states and 36134 transitions. [2019-12-27 22:26:44,045 INFO L78 Accepts]: Start accepts. Automaton has 11483 states and 36134 transitions. Word has length 54 [2019-12-27 22:26:44,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:44,045 INFO L462 AbstractCegarLoop]: Abstraction has 11483 states and 36134 transitions. [2019-12-27 22:26:44,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:26:44,045 INFO L276 IsEmpty]: Start isEmpty. Operand 11483 states and 36134 transitions. [2019-12-27 22:26:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:26:44,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:44,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:44,062 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:44,063 INFO L82 PathProgramCache]: Analyzing trace with hash 219895980, now seen corresponding path program 2 times [2019-12-27 22:26:44,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:44,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959218400] [2019-12-27 22:26:44,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:44,159 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 22:26:44,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959218400] [2019-12-27 22:26:44,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:44,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:26:44,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1795273842] [2019-12-27 22:26:44,160 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:44,183 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:44,381 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 309 states and 637 transitions. [2019-12-27 22:26:44,381 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:44,451 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:26:44,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:26:44,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:44,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:26:44,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:26:44,452 INFO L87 Difference]: Start difference. First operand 11483 states and 36134 transitions. Second operand 8 states. [2019-12-27 22:26:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:46,104 INFO L93 Difference]: Finished difference Result 38198 states and 118092 transitions. [2019-12-27 22:26:46,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 22:26:46,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 22:26:46,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:46,147 INFO L225 Difference]: With dead ends: 38198 [2019-12-27 22:26:46,148 INFO L226 Difference]: Without dead ends: 28118 [2019-12-27 22:26:46,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:26:46,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28118 states. [2019-12-27 22:26:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28118 to 14415. [2019-12-27 22:26:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14415 states. [2019-12-27 22:26:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14415 states to 14415 states and 45368 transitions. [2019-12-27 22:26:46,671 INFO L78 Accepts]: Start accepts. Automaton has 14415 states and 45368 transitions. Word has length 54 [2019-12-27 22:26:46,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:46,671 INFO L462 AbstractCegarLoop]: Abstraction has 14415 states and 45368 transitions. [2019-12-27 22:26:46,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:26:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 14415 states and 45368 transitions. [2019-12-27 22:26:46,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:26:46,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:46,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:46,688 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:46,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:46,688 INFO L82 PathProgramCache]: Analyzing trace with hash 625959458, now seen corresponding path program 3 times [2019-12-27 22:26:46,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:46,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485686029] [2019-12-27 22:26:46,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:46,792 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 22:26:46,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485686029] [2019-12-27 22:26:46,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:46,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:26:46,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [254771820] [2019-12-27 22:26:46,793 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:46,809 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:47,026 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 296 states and 614 transitions. [2019-12-27 22:26:47,026 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:47,182 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 22:26:47,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:26:47,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:47,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:26:47,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:26:47,183 INFO L87 Difference]: Start difference. First operand 14415 states and 45368 transitions. Second operand 10 states. [2019-12-27 22:26:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:49,251 INFO L93 Difference]: Finished difference Result 64957 states and 197477 transitions. [2019-12-27 22:26:49,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 22:26:49,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 22:26:49,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:49,341 INFO L225 Difference]: With dead ends: 64957 [2019-12-27 22:26:49,341 INFO L226 Difference]: Without dead ends: 56355 [2019-12-27 22:26:49,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 16 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=541, Invalid=1715, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 22:26:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56355 states. [2019-12-27 22:26:50,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56355 to 18583. [2019-12-27 22:26:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18583 states. [2019-12-27 22:26:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18583 states to 18583 states and 58671 transitions. [2019-12-27 22:26:50,243 INFO L78 Accepts]: Start accepts. Automaton has 18583 states and 58671 transitions. Word has length 54 [2019-12-27 22:26:50,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:50,243 INFO L462 AbstractCegarLoop]: Abstraction has 18583 states and 58671 transitions. [2019-12-27 22:26:50,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:26:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 18583 states and 58671 transitions. [2019-12-27 22:26:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:26:50,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:50,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:50,266 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:50,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:50,266 INFO L82 PathProgramCache]: Analyzing trace with hash 644386982, now seen corresponding path program 4 times [2019-12-27 22:26:50,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:50,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137133761] [2019-12-27 22:26:50,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:50,357 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 22:26:50,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137133761] [2019-12-27 22:26:50,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:50,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:26:50,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [684061449] [2019-12-27 22:26:50,358 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:50,374 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:50,588 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 413 transitions. [2019-12-27 22:26:50,588 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:50,602 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:26:50,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:26:50,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:50,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:26:50,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:26:50,604 INFO L87 Difference]: Start difference. First operand 18583 states and 58671 transitions. Second operand 4 states. [2019-12-27 22:26:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:50,989 INFO L93 Difference]: Finished difference Result 22208 states and 67686 transitions. [2019-12-27 22:26:50,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:26:50,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:26:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:51,044 INFO L225 Difference]: With dead ends: 22208 [2019-12-27 22:26:51,044 INFO L226 Difference]: Without dead ends: 22208 [2019-12-27 22:26:51,047 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 22:26:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22208 states. [2019-12-27 22:26:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22208 to 15403. [2019-12-27 22:26:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15403 states. [2019-12-27 22:26:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15403 states to 15403 states and 47385 transitions. [2019-12-27 22:26:51,509 INFO L78 Accepts]: Start accepts. Automaton has 15403 states and 47385 transitions. Word has length 54 [2019-12-27 22:26:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:51,509 INFO L462 AbstractCegarLoop]: Abstraction has 15403 states and 47385 transitions. [2019-12-27 22:26:51,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:26:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 15403 states and 47385 transitions. [2019-12-27 22:26:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:26:51,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:51,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:51,536 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:51,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1496178910, now seen corresponding path program 1 times [2019-12-27 22:26:51,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:51,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628842388] [2019-12-27 22:26:51,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:52,421 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 22:26:52,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628842388] [2019-12-27 22:26:52,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:52,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 22:26:52,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1615970499] [2019-12-27 22:26:52,422 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:52,441 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:52,665 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 425 transitions. [2019-12-27 22:26:52,665 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:52,857 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 22:26:52,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 22:26:52,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:52,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 22:26:52,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:26:52,859 INFO L87 Difference]: Start difference. First operand 15403 states and 47385 transitions. Second operand 17 states. [2019-12-27 22:26:58,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:58,111 INFO L93 Difference]: Finished difference Result 30519 states and 92369 transitions. [2019-12-27 22:26:58,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 22:26:58,112 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2019-12-27 22:26:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:58,148 INFO L225 Difference]: With dead ends: 30519 [2019-12-27 22:26:58,149 INFO L226 Difference]: Without dead ends: 25407 [2019-12-27 22:26:58,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 9 SyntacticMatches, 12 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=516, Invalid=2346, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 22:26:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25407 states. [2019-12-27 22:26:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25407 to 16956. [2019-12-27 22:26:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16956 states. [2019-12-27 22:26:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16956 states to 16956 states and 51842 transitions. [2019-12-27 22:26:58,450 INFO L78 Accepts]: Start accepts. Automaton has 16956 states and 51842 transitions. Word has length 55 [2019-12-27 22:26:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:58,450 INFO L462 AbstractCegarLoop]: Abstraction has 16956 states and 51842 transitions. [2019-12-27 22:26:58,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 22:26:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 16956 states and 51842 transitions. [2019-12-27 22:26:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:26:58,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:58,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:58,473 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:58,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash 684333320, now seen corresponding path program 2 times [2019-12-27 22:26:58,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:58,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632105769] [2019-12-27 22:26:58,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:58,535 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 22:26:58,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632105769] [2019-12-27 22:26:58,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:58,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:26:58,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [548412933] [2019-12-27 22:26:58,537 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:58,565 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:58,677 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 193 states and 359 transitions. [2019-12-27 22:26:58,678 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:58,678 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:26:58,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:26:58,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:58,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:26:58,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:26:58,679 INFO L87 Difference]: Start difference. First operand 16956 states and 51842 transitions. Second operand 3 states. [2019-12-27 22:26:58,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:58,730 INFO L93 Difference]: Finished difference Result 16954 states and 51837 transitions. [2019-12-27 22:26:58,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:26:58,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 22:26:58,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:58,934 INFO L225 Difference]: With dead ends: 16954 [2019-12-27 22:26:58,934 INFO L226 Difference]: Without dead ends: 16954 [2019-12-27 22:26:58,934 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 22:26:58,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16954 states. [2019-12-27 22:26:59,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16954 to 15241. [2019-12-27 22:26:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15241 states. [2019-12-27 22:26:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15241 states to 15241 states and 47062 transitions. [2019-12-27 22:26:59,164 INFO L78 Accepts]: Start accepts. Automaton has 15241 states and 47062 transitions. Word has length 55 [2019-12-27 22:26:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:59,164 INFO L462 AbstractCegarLoop]: Abstraction has 15241 states and 47062 transitions. [2019-12-27 22:26:59,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:26:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 15241 states and 47062 transitions. [2019-12-27 22:26:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:26:59,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:59,179 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:59,179 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:59,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:59,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2011437082, now seen corresponding path program 1 times [2019-12-27 22:26:59,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:59,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48443366] [2019-12-27 22:26:59,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:59,428 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 22:26:59,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48443366] [2019-12-27 22:26:59,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:59,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:26:59,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [918748579] [2019-12-27 22:26:59,433 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:59,451 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:59,639 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 360 transitions. [2019-12-27 22:26:59,639 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:59,838 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 22:26:59,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:26:59,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:59,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:26:59,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:26:59,840 INFO L87 Difference]: Start difference. First operand 15241 states and 47062 transitions. Second operand 12 states. [2019-12-27 22:27:02,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:02,060 INFO L93 Difference]: Finished difference Result 28209 states and 86453 transitions. [2019-12-27 22:27:02,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 22:27:02,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 22:27:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:02,092 INFO L225 Difference]: With dead ends: 28209 [2019-12-27 22:27:02,092 INFO L226 Difference]: Without dead ends: 20173 [2019-12-27 22:27:02,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 22:27:02,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20173 states. [2019-12-27 22:27:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20173 to 15258. [2019-12-27 22:27:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15258 states. [2019-12-27 22:27:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15258 states to 15258 states and 46827 transitions. [2019-12-27 22:27:02,351 INFO L78 Accepts]: Start accepts. Automaton has 15258 states and 46827 transitions. Word has length 56 [2019-12-27 22:27:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:02,352 INFO L462 AbstractCegarLoop]: Abstraction has 15258 states and 46827 transitions. [2019-12-27 22:27:02,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:27:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 15258 states and 46827 transitions. [2019-12-27 22:27:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:27:02,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:02,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:02,368 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:02,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:02,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1715033704, now seen corresponding path program 2 times [2019-12-27 22:27:02,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:02,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779039101] [2019-12-27 22:27:02,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:02,895 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 22:27:02,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779039101] [2019-12-27 22:27:02,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:02,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 22:27:02,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1837255522] [2019-12-27 22:27:02,896 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:02,906 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:03,290 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 311 states and 653 transitions. [2019-12-27 22:27:03,290 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:03,648 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 22:27:03,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 22:27:03,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:03,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 22:27:03,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:27:03,649 INFO L87 Difference]: Start difference. First operand 15258 states and 46827 transitions. Second operand 18 states. [2019-12-27 22:27:11,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:11,593 INFO L93 Difference]: Finished difference Result 36762 states and 110733 transitions. [2019-12-27 22:27:11,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-12-27 22:27:11,594 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-27 22:27:11,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:11,634 INFO L225 Difference]: With dead ends: 36762 [2019-12-27 22:27:11,634 INFO L226 Difference]: Without dead ends: 30104 [2019-12-27 22:27:11,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 10 SyntacticMatches, 15 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3057 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1404, Invalid=7908, Unknown=0, NotChecked=0, Total=9312 [2019-12-27 22:27:11,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30104 states. [2019-12-27 22:27:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30104 to 15506. [2019-12-27 22:27:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15506 states. [2019-12-27 22:27:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15506 states to 15506 states and 47613 transitions. [2019-12-27 22:27:11,935 INFO L78 Accepts]: Start accepts. Automaton has 15506 states and 47613 transitions. Word has length 56 [2019-12-27 22:27:11,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:11,935 INFO L462 AbstractCegarLoop]: Abstraction has 15506 states and 47613 transitions. [2019-12-27 22:27:11,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 22:27:11,935 INFO L276 IsEmpty]: Start isEmpty. Operand 15506 states and 47613 transitions. [2019-12-27 22:27:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:27:11,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:11,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:11,950 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:11,951 INFO L82 PathProgramCache]: Analyzing trace with hash -402783784, now seen corresponding path program 3 times [2019-12-27 22:27:11,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:11,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393989916] [2019-12-27 22:27:11,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:12,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393989916] [2019-12-27 22:27:12,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:12,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:27:12,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [751349050] [2019-12-27 22:27:12,201 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:12,217 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:12,364 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 169 states and 301 transitions. [2019-12-27 22:27:12,364 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:12,472 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:27:12,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:27:12,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:12,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:27:12,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:27:12,473 INFO L87 Difference]: Start difference. First operand 15506 states and 47613 transitions. Second operand 12 states. [2019-12-27 22:27:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:14,034 INFO L93 Difference]: Finished difference Result 26046 states and 79395 transitions. [2019-12-27 22:27:14,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 22:27:14,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 22:27:14,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:14,068 INFO L225 Difference]: With dead ends: 26046 [2019-12-27 22:27:14,068 INFO L226 Difference]: Without dead ends: 23564 [2019-12-27 22:27:14,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 22:27:14,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23564 states. [2019-12-27 22:27:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23564 to 14978. [2019-12-27 22:27:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14978 states. [2019-12-27 22:27:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14978 states to 14978 states and 46092 transitions. [2019-12-27 22:27:14,350 INFO L78 Accepts]: Start accepts. Automaton has 14978 states and 46092 transitions. Word has length 56 [2019-12-27 22:27:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:14,350 INFO L462 AbstractCegarLoop]: Abstraction has 14978 states and 46092 transitions. [2019-12-27 22:27:14,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:27:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 14978 states and 46092 transitions. [2019-12-27 22:27:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:27:14,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:14,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:14,368 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:14,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:14,368 INFO L82 PathProgramCache]: Analyzing trace with hash 639764934, now seen corresponding path program 4 times [2019-12-27 22:27:14,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:14,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127279521] [2019-12-27 22:27:14,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:27:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:27:14,484 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:27:14,485 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:27:14,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_26) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2082~0.base_22| 4)) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2082~0.base_22|) (= 0 v_~x$w_buff1~0_26) (= 0 v_~x$r_buff0_thd0~0_22) (= v_~z~0_14 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_34) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2082~0.base_22|)) (= |v_#valid_56| (store .cse0 |v_ULTIMATE.start_main_~#t2082~0.base_22| 1)) (= v_~x$r_buff1_thd0~0_21 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_cnt~0_19) (= 0 v_~weak$$choice0~0_7) (= 0 v_~__unbuffered_p2_EAX~0_13) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2082~0.base_22| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2082~0.base_22|) |v_ULTIMATE.start_main_~#t2082~0.offset_18| 0)) |v_#memory_int_23|) (= v_~x$r_buff1_thd2~0_19 0) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$flush_delayed~0_12 0) (= |v_ULTIMATE.start_main_~#t2082~0.offset_18| 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_22 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd1~0_70) (= 0 v_~x$w_buff0~0_31) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~x$w_buff0_used~0_112) (= v_~x$w_buff1_used~0_68 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ULTIMATE.start_main_~#t2084~0.base=|v_ULTIMATE.start_main_~#t2084~0.base_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start_main_~#t2084~0.offset=|v_ULTIMATE.start_main_~#t2084~0.offset_14|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_~#t2083~0.offset=|v_ULTIMATE.start_main_~#t2083~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2082~0.offset=|v_ULTIMATE.start_main_~#t2082~0.offset_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_70, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_20|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t2082~0.base=|v_ULTIMATE.start_main_~#t2082~0.base_22|, ~y~0=v_~y~0_9, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t2083~0.base=|v_ULTIMATE.start_main_~#t2083~0.base_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_21, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2084~0.base, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2084~0.offset, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2082~0.base, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2083~0.offset, ULTIMATE.start_main_~#t2083~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t2082~0.offset, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:27:14,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2083~0.base_10| 1)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2083~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t2083~0.base_10| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2083~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t2083~0.offset_9| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2083~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2083~0.base_10|) |v_ULTIMATE.start_main_~#t2083~0.offset_9| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2083~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2083~0.base=|v_ULTIMATE.start_main_~#t2083~0.base_10|, ULTIMATE.start_main_~#t2083~0.offset=|v_ULTIMATE.start_main_~#t2083~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2083~0.base, ULTIMATE.start_main_~#t2083~0.offset] because there is no mapped edge [2019-12-27 22:27:14,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= 1 v_~x$w_buff0~0_14) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_70) (= 1 v_~x$w_buff0_used~0_69) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= v_~x$w_buff0~0_15 v_~x$w_buff1~0_14) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_14, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_14, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 22:27:14,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2084~0.base_11|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2084~0.base_11|) (= |v_ULTIMATE.start_main_~#t2084~0.offset_10| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2084~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2084~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2084~0.base_11|) |v_ULTIMATE.start_main_~#t2084~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2084~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2084~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2084~0.offset=|v_ULTIMATE.start_main_~#t2084~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2084~0.base=|v_ULTIMATE.start_main_~#t2084~0.base_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2084~0.offset, ULTIMATE.start_main_~#t2084~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 22:27:14,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1709174072 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1709174072 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-1709174072| ~x~0_In-1709174072)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-1709174072| ~x$w_buff1~0_In-1709174072)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1709174072, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1709174072, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1709174072, ~x~0=~x~0_In-1709174072} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1709174072|, ~x$w_buff1~0=~x$w_buff1~0_In-1709174072, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1709174072, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1709174072, ~x~0=~x~0_In-1709174072} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 22:27:14,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_14 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 22:27:14,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1469600672 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1469600672 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1469600672 |P2Thread1of1ForFork1_#t~ite34_Out-1469600672|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1469600672|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1469600672, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1469600672} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1469600672|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1469600672, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1469600672} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:27:14,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-38247791 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-38247791 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-38247791|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-38247791 |P1Thread1of1ForFork0_#t~ite28_Out-38247791|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-38247791, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-38247791} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-38247791, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-38247791|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-38247791} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 22:27:14,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1658480050 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1658480050 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1658480050 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1658480050 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1658480050|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-1658480050 |P1Thread1of1ForFork0_#t~ite29_Out-1658480050|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1658480050, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1658480050, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1658480050, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1658480050} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1658480050, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1658480050, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1658480050, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1658480050|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1658480050} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 22:27:14,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-2139028039 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-2139028039 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out-2139028039 0)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-2139028039 ~x$r_buff0_thd2~0_In-2139028039)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2139028039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2139028039} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-2139028039|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2139028039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2139028039} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:27:14,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In-1815328726 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1815328726 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1815328726 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1815328726 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-1815328726| 0)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1815328726| ~x$r_buff1_thd2~0_In-1815328726) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1815328726, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1815328726, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1815328726, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1815328726} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1815328726|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1815328726, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1815328726, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1815328726, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1815328726} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 22:27:14,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 22:27:14,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In295671273 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite8_In295671273| |P0Thread1of1ForFork2_#t~ite8_Out295671273|) (= ~x$w_buff0~0_In295671273 |P0Thread1of1ForFork2_#t~ite9_Out295671273|)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out295671273| |P0Thread1of1ForFork2_#t~ite8_Out295671273|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In295671273 256)))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In295671273 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In295671273 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In295671273 256))))) .cse0 (= ~x$w_buff0~0_In295671273 |P0Thread1of1ForFork2_#t~ite8_Out295671273|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In295671273, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In295671273, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In295671273|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In295671273, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In295671273, ~weak$$choice2~0=~weak$$choice2~0_In295671273, ~x$w_buff0_used~0=~x$w_buff0_used~0_In295671273} OutVars{~x$w_buff0~0=~x$w_buff0~0_In295671273, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In295671273, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out295671273|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In295671273, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out295671273|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In295671273, ~weak$$choice2~0=~weak$$choice2~0_In295671273, ~x$w_buff0_used~0=~x$w_buff0_used~0_In295671273} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 22:27:14,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In2014518442 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2014518442 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In2014518442 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In2014518442 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite35_Out2014518442| ~x$w_buff1_used~0_In2014518442) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out2014518442| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2014518442, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2014518442, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2014518442, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2014518442} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out2014518442|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2014518442, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2014518442, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2014518442, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2014518442} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:27:14,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1111625104 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1111625104 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out1111625104| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out1111625104| ~x$r_buff0_thd3~0_In1111625104)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1111625104, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1111625104} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1111625104|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1111625104, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1111625104} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:27:14,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-669255580 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-669255580 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-669255580 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-669255580 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-669255580| ~x$r_buff1_thd3~0_In-669255580) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out-669255580| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-669255580, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-669255580, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-669255580, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-669255580} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-669255580|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-669255580, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-669255580, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-669255580, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-669255580} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:27:14,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 22:27:14,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1041442639 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In1041442639| |P0Thread1of1ForFork2_#t~ite17_Out1041442639|) (= ~x$w_buff1_used~0_In1041442639 |P0Thread1of1ForFork2_#t~ite18_Out1041442639|)) (and (= |P0Thread1of1ForFork2_#t~ite17_Out1041442639| |P0Thread1of1ForFork2_#t~ite18_Out1041442639|) (= ~x$w_buff1_used~0_In1041442639 |P0Thread1of1ForFork2_#t~ite17_Out1041442639|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1041442639 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In1041442639 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1041442639 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1041442639 256))))) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1041442639, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1041442639|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1041442639, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1041442639, ~weak$$choice2~0=~weak$$choice2~0_In1041442639, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1041442639} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1041442639, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1041442639|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1041442639|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1041442639, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1041442639, ~weak$$choice2~0=~weak$$choice2~0_In1041442639, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1041442639} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:27:14,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_53 v_~x$r_buff0_thd1~0_52) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_52, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 22:27:14,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1351844687 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1351844687 256) 0)) (.cse5 (= |P0Thread1of1ForFork2_#t~ite23_Out1351844687| |P0Thread1of1ForFork2_#t~ite24_Out1351844687|)) (.cse4 (= (mod ~x$w_buff0_used~0_In1351844687 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1351844687 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1351844687 256)))) (or (and (or (and (= |P0Thread1of1ForFork2_#t~ite24_Out1351844687| ~x$r_buff1_thd1~0_In1351844687) (= |P0Thread1of1ForFork2_#t~ite23_Out1351844687| |P0Thread1of1ForFork2_#t~ite23_In1351844687|) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite23_Out1351844687| ~x$r_buff1_thd1~0_In1351844687) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4) .cse0 .cse5)) (= |P0Thread1of1ForFork2_#t~ite22_In1351844687| |P0Thread1of1ForFork2_#t~ite22_Out1351844687|)) (let ((.cse6 (not .cse1))) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out1351844687| |P0Thread1of1ForFork2_#t~ite22_Out1351844687|) (or (not .cse2) .cse6) .cse5 (not .cse4) (or (not .cse3) .cse6) (= 0 |P0Thread1of1ForFork2_#t~ite22_Out1351844687|))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1351844687, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1351844687, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1351844687, ~weak$$choice2~0=~weak$$choice2~0_In1351844687, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1351844687|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In1351844687|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1351844687} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1351844687, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1351844687, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1351844687, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1351844687|, ~weak$$choice2~0=~weak$$choice2~0_In1351844687, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1351844687|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out1351844687|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1351844687} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-27 22:27:14,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_17) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 22:27:14,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~x$w_buff0_used~0_82 256) 0) (= (mod v_~x$r_buff0_thd0~0_14 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:27:14,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In2111531361 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In2111531361 256) 0))) (or (and (= ~x$w_buff1~0_In2111531361 |ULTIMATE.start_main_#t~ite41_Out2111531361|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out2111531361| ~x~0_In2111531361) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2111531361, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2111531361, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2111531361, ~x~0=~x~0_In2111531361} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2111531361|, ~x$w_buff1~0=~x$w_buff1~0_In2111531361, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2111531361, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2111531361, ~x~0=~x~0_In2111531361} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 22:27:14,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 22:27:14,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1544090619 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1544090619 256)))) (or (and (= ~x$w_buff0_used~0_In-1544090619 |ULTIMATE.start_main_#t~ite43_Out-1544090619|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1544090619| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1544090619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1544090619} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1544090619, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1544090619|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1544090619} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:27:14,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1441557505 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1441557505 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1441557505 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1441557505 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out1441557505|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1441557505 |ULTIMATE.start_main_#t~ite44_Out1441557505|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1441557505, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1441557505, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1441557505, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1441557505} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1441557505, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1441557505, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1441557505, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1441557505|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1441557505} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:27:14,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-929363642 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-929363642 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-929363642 |ULTIMATE.start_main_#t~ite45_Out-929363642|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-929363642|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-929363642, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-929363642} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-929363642, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-929363642|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-929363642} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:27:14,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1920108306 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1920108306 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1920108306 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1920108306 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In1920108306 |ULTIMATE.start_main_#t~ite46_Out1920108306|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite46_Out1920108306| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1920108306, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1920108306, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1920108306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1920108306} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1920108306, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1920108306|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1920108306, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1920108306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1920108306} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 22:27:14,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_11 2) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 1 v_~__unbuffered_p2_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite46_16|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:27:14,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:27:14 BasicIcfg [2019-12-27 22:27:14,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:27:14,583 INFO L168 Benchmark]: Toolchain (without parser) took 91227.97 ms. Allocated memory was 137.9 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 101.0 MB in the beginning and 926.7 MB in the end (delta: -825.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 22:27:14,583 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 22:27:14,584 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.87 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 155.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-12-27 22:27:14,585 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.70 ms. Allocated memory is still 201.9 MB. Free memory was 155.3 MB in the beginning and 153.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:27:14,585 INFO L168 Benchmark]: Boogie Preprocessor took 38.62 ms. Allocated memory is still 201.9 MB. Free memory was 152.7 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:27:14,586 INFO L168 Benchmark]: RCFGBuilder took 806.90 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 103.9 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:27:14,586 INFO L168 Benchmark]: TraceAbstraction took 89463.60 ms. Allocated memory was 201.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 103.9 MB in the beginning and 926.7 MB in the end (delta: -822.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 22:27:14,589 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.20 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.87 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 155.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 100.70 ms. Allocated memory is still 201.9 MB. Free memory was 155.3 MB in the beginning and 153.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.62 ms. Allocated memory is still 201.9 MB. Free memory was 152.7 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.90 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 103.9 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89463.60 ms. Allocated memory was 201.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 103.9 MB in the beginning and 926.7 MB in the end (delta: -822.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 27 ChoiceCompositions, 6547 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68909 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2082, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2083, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2084, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 89.1s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 37.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4504 SDtfs, 7655 SDslu, 17047 SDs, 0 SdLazy, 14884 SolverSat, 505 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 517 GetRequests, 99 SyntacticMatches, 76 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5125 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116665occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 173225 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 771 NumberOfCodeBlocks, 771 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 695 ConstructedInterpolants, 0 QuantifiedInterpolants, 163600 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...