/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:27:23,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:27:23,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:27:23,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:27:23,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:27:23,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:27:23,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:27:23,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:27:23,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:27:23,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:27:23,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:27:23,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:27:23,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:27:23,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:27:23,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:27:23,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:27:23,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:27:23,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:27:23,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:27:23,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:27:23,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:27:23,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:27:23,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:27:23,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:27:23,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:27:23,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:27:23,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:27:23,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:27:23,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:27:23,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:27:23,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:27:23,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:27:23,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:27:23,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:27:23,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:27:23,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:27:23,228 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:27:23,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:27:23,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:27:23,230 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:27:23,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:27:23,232 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:27:23,245 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:27:23,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:27:23,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:27:23,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:27:23,247 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:27:23,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:27:23,248 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:27:23,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:27:23,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:27:23,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:27:23,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:27:23,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:27:23,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:27:23,249 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:27:23,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:27:23,249 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:27:23,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:27:23,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:27:23,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:27:23,250 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:27:23,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:27:23,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:27:23,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:27:23,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:27:23,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:27:23,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:27:23,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:27:23,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:27:23,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:27:23,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:27:23,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:27:23,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:27:23,566 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:27:23,566 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:27:23,567 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_rmo.oepc.i [2019-12-27 01:27:23,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5571e17/8bfefda621b34188b8909365cade8421/FLAGafa81e1fd [2019-12-27 01:27:24,244 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:27:24,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_rmo.oepc.i [2019-12-27 01:27:24,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5571e17/8bfefda621b34188b8909365cade8421/FLAGafa81e1fd [2019-12-27 01:27:24,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5571e17/8bfefda621b34188b8909365cade8421 [2019-12-27 01:27:24,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:27:24,516 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:27:24,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:27:24,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:27:24,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:27:24,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:27:24" (1/1) ... [2019-12-27 01:27:24,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0a5178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:24, skipping insertion in model container [2019-12-27 01:27:24,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:27:24" (1/1) ... [2019-12-27 01:27:24,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:27:24,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:27:25,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:27:25,150 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:27:25,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:27:25,291 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:27:25,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:25 WrapperNode [2019-12-27 01:27:25,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:27:25,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:27:25,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:27:25,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:27:25,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:25" (1/1) ... [2019-12-27 01:27:25,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:25" (1/1) ... [2019-12-27 01:27:25,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:27:25,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:27:25,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:27:25,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:27:25,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:25" (1/1) ... [2019-12-27 01:27:25,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:25" (1/1) ... [2019-12-27 01:27:25,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:25" (1/1) ... [2019-12-27 01:27:25,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:25" (1/1) ... [2019-12-27 01:27:25,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:25" (1/1) ... [2019-12-27 01:27:25,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:25" (1/1) ... [2019-12-27 01:27:25,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:25" (1/1) ... [2019-12-27 01:27:25,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:27:25,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:27:25,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:27:25,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:27:25,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:25" (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 01:27:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:27:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:27:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:27:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:27:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:27:25,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:27:25,459 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:27:25,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:27:25,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:27:25,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:27:25,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:27:25,461 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 01:27:26,157 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:27:26,158 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:27:26,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:27:26 BoogieIcfgContainer [2019-12-27 01:27:26,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:27:26,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:27:26,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:27:26,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:27:26,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:27:24" (1/3) ... [2019-12-27 01:27:26,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5d0fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:27:26, skipping insertion in model container [2019-12-27 01:27:26,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:27:25" (2/3) ... [2019-12-27 01:27:26,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5d0fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:27:26, skipping insertion in model container [2019-12-27 01:27:26,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:27:26" (3/3) ... [2019-12-27 01:27:26,171 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_rmo.oepc.i [2019-12-27 01:27:26,182 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:27:26,183 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:27:26,194 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:27:26,196 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:27:26,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,244 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,245 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,245 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,246 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,246 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,256 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,256 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,306 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,306 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,306 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,312 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,315 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:27:26,331 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 01:27:26,351 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:27:26,352 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:27:26,352 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:27:26,352 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:27:26,352 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:27:26,352 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:27:26,352 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:27:26,353 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:27:26,370 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 01:27:26,372 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 01:27:26,458 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 01:27:26,458 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:27:26,473 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 01:27:26,494 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 01:27:26,539 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 01:27:26,540 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:27:26,546 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 01:27:26,560 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 01:27:26,562 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:27:31,621 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 01:27:31,733 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 01:27:32,014 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77720 [2019-12-27 01:27:32,014 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 01:27:32,019 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 01:27:32,530 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8912 states. [2019-12-27 01:27:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states. [2019-12-27 01:27:32,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:27:32,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:32,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:27:32,541 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:32,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:32,548 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-27 01:27:32,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:32,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377260594] [2019-12-27 01:27:32,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:32,763 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 01:27:32,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377260594] [2019-12-27 01:27:32,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:32,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:27:32,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590711925] [2019-12-27 01:27:32,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:32,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:32,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:32,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:32,787 INFO L87 Difference]: Start difference. First operand 8912 states. Second operand 3 states. [2019-12-27 01:27:33,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:33,028 INFO L93 Difference]: Finished difference Result 8760 states and 28314 transitions. [2019-12-27 01:27:33,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:33,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:27:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:33,112 INFO L225 Difference]: With dead ends: 8760 [2019-12-27 01:27:33,112 INFO L226 Difference]: Without dead ends: 7798 [2019-12-27 01:27:33,113 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 01:27:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-12-27 01:27:33,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7798. [2019-12-27 01:27:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2019-12-27 01:27:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 25120 transitions. [2019-12-27 01:27:33,596 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 25120 transitions. Word has length 3 [2019-12-27 01:27:33,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:33,596 INFO L462 AbstractCegarLoop]: Abstraction has 7798 states and 25120 transitions. [2019-12-27 01:27:33,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 25120 transitions. [2019-12-27 01:27:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:27:33,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:33,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:33,600 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:33,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:33,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-27 01:27:33,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:33,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801022844] [2019-12-27 01:27:33,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:33,709 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 01:27:33,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801022844] [2019-12-27 01:27:33,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:33,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:27:33,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784226861] [2019-12-27 01:27:33,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:33,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:33,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:33,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:33,712 INFO L87 Difference]: Start difference. First operand 7798 states and 25120 transitions. Second operand 3 states. [2019-12-27 01:27:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:33,736 INFO L93 Difference]: Finished difference Result 1232 states and 2767 transitions. [2019-12-27 01:27:33,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:33,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 01:27:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:33,743 INFO L225 Difference]: With dead ends: 1232 [2019-12-27 01:27:33,744 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 01:27:33,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:33,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 01:27:33,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-27 01:27:33,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-27 01:27:33,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2767 transitions. [2019-12-27 01:27:33,775 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2767 transitions. Word has length 11 [2019-12-27 01:27:33,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:33,775 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2767 transitions. [2019-12-27 01:27:33,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2767 transitions. [2019-12-27 01:27:33,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 01:27:33,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:33,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:33,778 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:33,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:33,778 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-27 01:27:33,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:33,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920004550] [2019-12-27 01:27:33,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:33,933 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 01:27:33,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920004550] [2019-12-27 01:27:33,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:33,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:27:33,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845286798] [2019-12-27 01:27:33,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:27:33,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:33,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:27:33,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:27:33,935 INFO L87 Difference]: Start difference. First operand 1232 states and 2767 transitions. Second operand 5 states. [2019-12-27 01:27:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:34,227 INFO L93 Difference]: Finished difference Result 1829 states and 4038 transitions. [2019-12-27 01:27:34,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:27:34,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 01:27:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:34,237 INFO L225 Difference]: With dead ends: 1829 [2019-12-27 01:27:34,237 INFO L226 Difference]: Without dead ends: 1829 [2019-12-27 01:27:34,238 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 01:27:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-12-27 01:27:34,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1572. [2019-12-27 01:27:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-12-27 01:27:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3508 transitions. [2019-12-27 01:27:34,283 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3508 transitions. Word has length 14 [2019-12-27 01:27:34,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:34,284 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 3508 transitions. [2019-12-27 01:27:34,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:27:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3508 transitions. [2019-12-27 01:27:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 01:27:34,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:34,287 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] [2019-12-27 01:27:34,287 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:34,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:34,288 INFO L82 PathProgramCache]: Analyzing trace with hash 603755618, now seen corresponding path program 1 times [2019-12-27 01:27:34,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:34,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971936921] [2019-12-27 01:27:34,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:34,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971936921] [2019-12-27 01:27:34,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:34,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:27:34,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196706501] [2019-12-27 01:27:34,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:27:34,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:34,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:27:34,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:27:34,510 INFO L87 Difference]: Start difference. First operand 1572 states and 3508 transitions. Second operand 7 states. [2019-12-27 01:27:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:35,071 INFO L93 Difference]: Finished difference Result 2218 states and 4789 transitions. [2019-12-27 01:27:35,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:27:35,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-12-27 01:27:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:35,084 INFO L225 Difference]: With dead ends: 2218 [2019-12-27 01:27:35,085 INFO L226 Difference]: Without dead ends: 2218 [2019-12-27 01:27:35,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:27:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2019-12-27 01:27:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 1705. [2019-12-27 01:27:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-12-27 01:27:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 3772 transitions. [2019-12-27 01:27:35,138 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 3772 transitions. Word has length 24 [2019-12-27 01:27:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:35,139 INFO L462 AbstractCegarLoop]: Abstraction has 1705 states and 3772 transitions. [2019-12-27 01:27:35,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:27:35,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 3772 transitions. [2019-12-27 01:27:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 01:27:35,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:35,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:35,142 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:35,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-27 01:27:35,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:35,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436268658] [2019-12-27 01:27:35,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:35,243 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 01:27:35,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436268658] [2019-12-27 01:27:35,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:35,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:27:35,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892265951] [2019-12-27 01:27:35,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:35,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:35,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:35,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:35,246 INFO L87 Difference]: Start difference. First operand 1705 states and 3772 transitions. Second operand 3 states. [2019-12-27 01:27:35,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:35,328 INFO L93 Difference]: Finished difference Result 1704 states and 3770 transitions. [2019-12-27 01:27:35,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:35,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 01:27:35,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:35,337 INFO L225 Difference]: With dead ends: 1704 [2019-12-27 01:27:35,338 INFO L226 Difference]: Without dead ends: 1704 [2019-12-27 01:27:35,338 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 01:27:35,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2019-12-27 01:27:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1704. [2019-12-27 01:27:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-27 01:27:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3770 transitions. [2019-12-27 01:27:35,372 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3770 transitions. Word has length 26 [2019-12-27 01:27:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:35,373 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3770 transitions. [2019-12-27 01:27:35,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:35,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3770 transitions. [2019-12-27 01:27:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:27:35,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:35,376 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] [2019-12-27 01:27:35,377 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:35,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:35,378 INFO L82 PathProgramCache]: Analyzing trace with hash -691470702, now seen corresponding path program 1 times [2019-12-27 01:27:35,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:35,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179755511] [2019-12-27 01:27:35,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:35,457 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 01:27:35,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179755511] [2019-12-27 01:27:35,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:35,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:27:35,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395558235] [2019-12-27 01:27:35,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:27:35,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:35,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:27:35,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:27:35,460 INFO L87 Difference]: Start difference. First operand 1704 states and 3770 transitions. Second operand 4 states. [2019-12-27 01:27:35,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:35,488 INFO L93 Difference]: Finished difference Result 2700 states and 6022 transitions. [2019-12-27 01:27:35,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:27:35,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-27 01:27:35,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:35,505 INFO L225 Difference]: With dead ends: 2700 [2019-12-27 01:27:35,506 INFO L226 Difference]: Without dead ends: 1250 [2019-12-27 01:27:35,506 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 01:27:35,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2019-12-27 01:27:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1233. [2019-12-27 01:27:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-12-27 01:27:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 2691 transitions. [2019-12-27 01:27:35,532 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 2691 transitions. Word has length 27 [2019-12-27 01:27:35,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:35,532 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 2691 transitions. [2019-12-27 01:27:35,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:27:35,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 2691 transitions. [2019-12-27 01:27:35,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:27:35,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:35,534 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] [2019-12-27 01:27:35,535 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:35,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:35,535 INFO L82 PathProgramCache]: Analyzing trace with hash -250638352, now seen corresponding path program 2 times [2019-12-27 01:27:35,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:35,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992137682] [2019-12-27 01:27:35,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:35,628 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 01:27:35,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992137682] [2019-12-27 01:27:35,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:35,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:27:35,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768553155] [2019-12-27 01:27:35,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:27:35,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:35,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:27:35,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:27:35,630 INFO L87 Difference]: Start difference. First operand 1233 states and 2691 transitions. Second operand 5 states. [2019-12-27 01:27:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:36,083 INFO L93 Difference]: Finished difference Result 1899 states and 4075 transitions. [2019-12-27 01:27:36,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:27:36,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 01:27:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:36,092 INFO L225 Difference]: With dead ends: 1899 [2019-12-27 01:27:36,092 INFO L226 Difference]: Without dead ends: 1899 [2019-12-27 01:27:36,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:27:36,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2019-12-27 01:27:36,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1704. [2019-12-27 01:27:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-27 01:27:36,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3701 transitions. [2019-12-27 01:27:36,128 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3701 transitions. Word has length 27 [2019-12-27 01:27:36,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:36,129 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3701 transitions. [2019-12-27 01:27:36,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:27:36,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3701 transitions. [2019-12-27 01:27:36,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:27:36,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:36,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:36,132 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:36,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:36,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 1 times [2019-12-27 01:27:36,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:36,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484593486] [2019-12-27 01:27:36,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:36,181 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 01:27:36,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484593486] [2019-12-27 01:27:36,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:36,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:27:36,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892360355] [2019-12-27 01:27:36,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:27:36,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:36,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:27:36,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:27:36,184 INFO L87 Difference]: Start difference. First operand 1704 states and 3701 transitions. Second operand 4 states. [2019-12-27 01:27:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:36,198 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-12-27 01:27:36,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:27:36,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 01:27:36,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:36,203 INFO L225 Difference]: With dead ends: 921 [2019-12-27 01:27:36,203 INFO L226 Difference]: Without dead ends: 824 [2019-12-27 01:27:36,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:27:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-27 01:27:36,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-12-27 01:27:36,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-27 01:27:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-12-27 01:27:36,223 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-12-27 01:27:36,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:36,224 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-12-27 01:27:36,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:27:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-12-27 01:27:36,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 01:27:36,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:36,227 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] [2019-12-27 01:27:36,227 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:36,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:36,227 INFO L82 PathProgramCache]: Analyzing trace with hash -317989854, now seen corresponding path program 1 times [2019-12-27 01:27:36,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:36,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046417473] [2019-12-27 01:27:36,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:36,308 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 01:27:36,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046417473] [2019-12-27 01:27:36,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:36,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:27:36,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258512637] [2019-12-27 01:27:36,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:27:36,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:36,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:27:36,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:27:36,310 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 7 states. [2019-12-27 01:27:36,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:36,497 INFO L93 Difference]: Finished difference Result 1342 states and 2781 transitions. [2019-12-27 01:27:36,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:27:36,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-27 01:27:36,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:36,501 INFO L225 Difference]: With dead ends: 1342 [2019-12-27 01:27:36,501 INFO L226 Difference]: Without dead ends: 903 [2019-12-27 01:27:36,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:27:36,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-27 01:27:36,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 773. [2019-12-27 01:27:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-27 01:27:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1630 transitions. [2019-12-27 01:27:36,517 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1630 transitions. Word has length 50 [2019-12-27 01:27:36,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:36,517 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1630 transitions. [2019-12-27 01:27:36,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:27:36,517 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1630 transitions. [2019-12-27 01:27:36,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 01:27:36,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:36,519 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] [2019-12-27 01:27:36,520 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:36,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:36,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1216040192, now seen corresponding path program 2 times [2019-12-27 01:27:36,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:36,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119212499] [2019-12-27 01:27:36,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:36,712 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 01:27:36,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119212499] [2019-12-27 01:27:36,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:36,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:27:36,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297346425] [2019-12-27 01:27:36,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:27:36,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:36,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:27:36,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:27:36,715 INFO L87 Difference]: Start difference. First operand 773 states and 1630 transitions. Second operand 7 states. [2019-12-27 01:27:37,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:37,334 INFO L93 Difference]: Finished difference Result 1033 states and 2141 transitions. [2019-12-27 01:27:37,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:27:37,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-27 01:27:37,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:37,338 INFO L225 Difference]: With dead ends: 1033 [2019-12-27 01:27:37,338 INFO L226 Difference]: Without dead ends: 1027 [2019-12-27 01:27:37,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:27:37,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-12-27 01:27:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 827. [2019-12-27 01:27:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-12-27 01:27:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1729 transitions. [2019-12-27 01:27:37,355 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1729 transitions. Word has length 50 [2019-12-27 01:27:37,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:37,355 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1729 transitions. [2019-12-27 01:27:37,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:27:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1729 transitions. [2019-12-27 01:27:37,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 01:27:37,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:37,358 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] [2019-12-27 01:27:37,358 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:37,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:37,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1826446246, now seen corresponding path program 3 times [2019-12-27 01:27:37,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:37,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632034776] [2019-12-27 01:27:37,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:37,425 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 01:27:37,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632034776] [2019-12-27 01:27:37,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:37,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:27:37,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042748276] [2019-12-27 01:27:37,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:37,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:37,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:37,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:37,428 INFO L87 Difference]: Start difference. First operand 827 states and 1729 transitions. Second operand 3 states. [2019-12-27 01:27:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:37,474 INFO L93 Difference]: Finished difference Result 1100 states and 2305 transitions. [2019-12-27 01:27:37,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:37,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 01:27:37,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:37,477 INFO L225 Difference]: With dead ends: 1100 [2019-12-27 01:27:37,477 INFO L226 Difference]: Without dead ends: 1100 [2019-12-27 01:27:37,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 01:27:37,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2019-12-27 01:27:37,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 884. [2019-12-27 01:27:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-12-27 01:27:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1865 transitions. [2019-12-27 01:27:37,495 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1865 transitions. Word has length 50 [2019-12-27 01:27:37,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:37,496 INFO L462 AbstractCegarLoop]: Abstraction has 884 states and 1865 transitions. [2019-12-27 01:27:37,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1865 transitions. [2019-12-27 01:27:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 01:27:37,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:37,500 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] [2019-12-27 01:27:37,500 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:37,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:37,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1408508718, now seen corresponding path program 1 times [2019-12-27 01:27:37,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:37,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432680518] [2019-12-27 01:27:37,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:37,722 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 01:27:37,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432680518] [2019-12-27 01:27:37,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:37,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:27:37,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084219644] [2019-12-27 01:27:37,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:27:37,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:37,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:27:37,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:27:37,725 INFO L87 Difference]: Start difference. First operand 884 states and 1865 transitions. Second operand 10 states. [2019-12-27 01:27:38,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:38,476 INFO L93 Difference]: Finished difference Result 1365 states and 2801 transitions. [2019-12-27 01:27:38,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:27:38,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-12-27 01:27:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:38,481 INFO L225 Difference]: With dead ends: 1365 [2019-12-27 01:27:38,481 INFO L226 Difference]: Without dead ends: 1365 [2019-12-27 01:27:38,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:27:38,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-12-27 01:27:38,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 956. [2019-12-27 01:27:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-12-27 01:27:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2014 transitions. [2019-12-27 01:27:38,502 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2014 transitions. Word has length 51 [2019-12-27 01:27:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:38,503 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2014 transitions. [2019-12-27 01:27:38,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:27:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2014 transitions. [2019-12-27 01:27:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 01:27:38,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:38,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:27:38,506 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:38,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:38,506 INFO L82 PathProgramCache]: Analyzing trace with hash 544395700, now seen corresponding path program 2 times [2019-12-27 01:27:38,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:38,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768984005] [2019-12-27 01:27:38,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:38,622 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 01:27:38,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768984005] [2019-12-27 01:27:38,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:38,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:27:38,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025884323] [2019-12-27 01:27:38,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:38,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:38,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:38,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:38,626 INFO L87 Difference]: Start difference. First operand 956 states and 2014 transitions. Second operand 3 states. [2019-12-27 01:27:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:38,641 INFO L93 Difference]: Finished difference Result 955 states and 2012 transitions. [2019-12-27 01:27:38,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:38,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 01:27:38,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:38,644 INFO L225 Difference]: With dead ends: 955 [2019-12-27 01:27:38,644 INFO L226 Difference]: Without dead ends: 955 [2019-12-27 01:27:38,645 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 01:27:38,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-12-27 01:27:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 789. [2019-12-27 01:27:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-27 01:27:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1685 transitions. [2019-12-27 01:27:38,669 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1685 transitions. Word has length 51 [2019-12-27 01:27:38,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:38,671 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1685 transitions. [2019-12-27 01:27:38,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1685 transitions. [2019-12-27 01:27:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 01:27:38,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:38,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:38,675 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:38,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:38,676 INFO L82 PathProgramCache]: Analyzing trace with hash 355104308, now seen corresponding path program 1 times [2019-12-27 01:27:38,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:38,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70146982] [2019-12-27 01:27:38,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:27:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:27:38,850 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:27:38,850 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:27:38,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t313~0.base_27|) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t313~0.base_27| 1) |v_#valid_61|) (< 0 |v_#StackHeapBarrier_15|) (= (select .cse0 |v_ULTIMATE.start_main_~#t313~0.base_27|) 0) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t313~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t313~0.base_27|) |v_ULTIMATE.start_main_~#t313~0.offset_19| 0)) |v_#memory_int_11|) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= 0 |v_ULTIMATE.start_main_~#t313~0.offset_19|) (= v_~x~0_99 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t313~0.base_27| 4)) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t313~0.base=|v_ULTIMATE.start_main_~#t313~0.base_27|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t314~0.offset=|v_ULTIMATE.start_main_~#t314~0.offset_20|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_~#t314~0.base=|v_ULTIMATE.start_main_~#t314~0.base_28|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ULTIMATE.start_main_~#t313~0.offset=|v_ULTIMATE.start_main_~#t313~0.offset_19|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t313~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t314~0.offset, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t314~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t313~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 01:27:38,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_ULTIMATE.start_main_~#t314~0.offset_9| 0) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t314~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t314~0.base_10| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t314~0.base_10| 4)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t314~0.base_10|) 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t314~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t314~0.base_10|) |v_ULTIMATE.start_main_~#t314~0.offset_9| 1))) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t314~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t314~0.offset=|v_ULTIMATE.start_main_~#t314~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t314~0.base=|v_ULTIMATE.start_main_~#t314~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t314~0.offset, ULTIMATE.start_main_~#t314~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 01:27:38,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In827651146 0)) (= ~y$r_buff0_thd1~0_In827651146 ~y$r_buff1_thd1~0_Out827651146) (= ~y$r_buff0_thd1~0_Out827651146 1) (= ~y$r_buff1_thd0~0_Out827651146 ~y$r_buff0_thd0~0_In827651146) (= ~y$r_buff1_thd2~0_Out827651146 ~y$r_buff0_thd2~0_In827651146) (= ~x~0_In827651146 ~__unbuffered_p0_EAX~0_Out827651146)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In827651146, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In827651146, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In827651146, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In827651146, ~x~0=~x~0_In827651146} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out827651146, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out827651146, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out827651146, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In827651146, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out827651146, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In827651146, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In827651146, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out827651146, ~x~0=~x~0_In827651146} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 01:27:38,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-558041887 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-558041887 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-558041887| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-558041887| ~y$w_buff0_used~0_In-558041887)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-558041887, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-558041887} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-558041887|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-558041887, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-558041887} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 01:27:38,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-903509337 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-903509337 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-903509337 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-903509337 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-903509337|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-903509337 |P0Thread1of1ForFork0_#t~ite6_Out-903509337|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-903509337, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-903509337, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-903509337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-903509337} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-903509337|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-903509337, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-903509337, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-903509337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-903509337} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 01:27:38,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-2118544688 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2118544688 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out-2118544688 0)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-2118544688 ~y$r_buff0_thd1~0_Out-2118544688)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2118544688, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2118544688} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2118544688, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2118544688|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2118544688} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:27:38,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1685808975 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-1685808975 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1685808975 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1685808975 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1685808975|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1685808975| ~y$r_buff1_thd1~0_In-1685808975) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1685808975, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1685808975, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1685808975, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1685808975} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1685808975, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1685808975, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1685808975|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1685808975, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1685808975} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 01:27:38,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:27:38,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1839991372 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite17_Out1839991372| ~y$w_buff1~0_In1839991372) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1839991372 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1839991372 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In1839991372 256) 0)) (= (mod ~y$w_buff0_used~0_In1839991372 256) 0))) (= |P1Thread1of1ForFork1_#t~ite17_Out1839991372| |P1Thread1of1ForFork1_#t~ite18_Out1839991372|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In1839991372| |P1Thread1of1ForFork1_#t~ite17_Out1839991372|) (= |P1Thread1of1ForFork1_#t~ite18_Out1839991372| ~y$w_buff1~0_In1839991372)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1839991372, ~y$w_buff1~0=~y$w_buff1~0_In1839991372, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1839991372, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1839991372, ~weak$$choice2~0=~weak$$choice2~0_In1839991372, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1839991372|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1839991372} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1839991372, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1839991372|, ~y$w_buff1~0=~y$w_buff1~0_In1839991372, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1839991372, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1839991372, ~weak$$choice2~0=~weak$$choice2~0_In1839991372, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1839991372|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1839991372} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 01:27:38,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1046800782 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out1046800782| |P1Thread1of1ForFork1_#t~ite21_Out1046800782|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1046800782 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In1046800782 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1046800782 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1046800782 256))))) (= |P1Thread1of1ForFork1_#t~ite20_Out1046800782| ~y$w_buff0_used~0_In1046800782)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In1046800782| |P1Thread1of1ForFork1_#t~ite20_Out1046800782|) (= |P1Thread1of1ForFork1_#t~ite21_Out1046800782| ~y$w_buff0_used~0_In1046800782)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1046800782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1046800782, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1046800782|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1046800782, ~weak$$choice2~0=~weak$$choice2~0_In1046800782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1046800782} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1046800782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1046800782, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1046800782|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1046800782, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1046800782|, ~weak$$choice2~0=~weak$$choice2~0_In1046800782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1046800782} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 01:27:38,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse3 (= |P1Thread1of1ForFork1_#t~ite24_Out-82093615| |P1Thread1of1ForFork1_#t~ite23_Out-82093615|)) (.cse4 (= 0 (mod ~weak$$choice2~0_In-82093615 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-82093615 256))) (.cse5 (= 0 (mod ~y$r_buff1_thd2~0_In-82093615 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-82093615 256))) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-82093615 256) 0))) (or (let ((.cse1 (not .cse6))) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-82093615| |P1Thread1of1ForFork1_#t~ite22_Out-82093615|) (or (not .cse0) .cse1) (not .cse2) .cse3 .cse4 (or (not .cse5) .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-82093615|))) (and (or (and (= ~y$w_buff1_used~0_In-82093615 |P1Thread1of1ForFork1_#t~ite24_Out-82093615|) (not .cse4) (= |P1Thread1of1ForFork1_#t~ite23_In-82093615| |P1Thread1of1ForFork1_#t~ite23_Out-82093615|)) (and (= ~y$w_buff1_used~0_In-82093615 |P1Thread1of1ForFork1_#t~ite23_Out-82093615|) .cse3 .cse4 (or .cse2 (and .cse5 .cse6) (and .cse0 .cse6)))) (= |P1Thread1of1ForFork1_#t~ite22_In-82093615| |P1Thread1of1ForFork1_#t~ite22_Out-82093615|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-82093615, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-82093615, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-82093615, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-82093615|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-82093615|, ~weak$$choice2~0=~weak$$choice2~0_In-82093615, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-82093615} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-82093615, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-82093615, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-82093615, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-82093615|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-82093615|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-82093615|, ~weak$$choice2~0=~weak$$choice2~0_In-82093615, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-82093615} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 01:27:38,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_25|) (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_25|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_22|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_24|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_20|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_35|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_28|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 01:27:38,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1169313820 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In1169313820 |P1Thread1of1ForFork1_#t~ite30_Out1169313820|) (= |P1Thread1of1ForFork1_#t~ite29_In1169313820| |P1Thread1of1ForFork1_#t~ite29_Out1169313820|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_In1169313820| |P1Thread1of1ForFork1_#t~ite28_Out1169313820|)) (let ((.cse1 (not (= 0 (mod ~y$r_buff0_thd2~0_In1169313820 256))))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out1169313820| |P1Thread1of1ForFork1_#t~ite28_Out1169313820|) (= |P1Thread1of1ForFork1_#t~ite29_Out1169313820| |P1Thread1of1ForFork1_#t~ite30_Out1169313820|) (or .cse1 (not (= 0 (mod ~y$r_buff1_thd2~0_In1169313820 256)))) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out1169313820|) (not (= (mod ~y$w_buff0_used~0_In1169313820 256) 0)) (or (not (= 0 (mod ~y$w_buff1_used~0_In1169313820 256))) .cse1) .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1169313820, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1169313820|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1169313820, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1169313820, ~weak$$choice2~0=~weak$$choice2~0_In1169313820, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1169313820|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1169313820} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1169313820, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1169313820|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1169313820|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1169313820, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1169313820, ~weak$$choice2~0=~weak$$choice2~0_In1169313820, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1169313820|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1169313820} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 01:27:38,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 01:27:38,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out-2031968153| |P1Thread1of1ForFork1_#t~ite32_Out-2031968153|)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2031968153 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-2031968153 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In-2031968153 |P1Thread1of1ForFork1_#t~ite32_Out-2031968153|)) (and .cse1 (= ~y~0_In-2031968153 |P1Thread1of1ForFork1_#t~ite32_Out-2031968153|) (or .cse0 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2031968153, ~y$w_buff1~0=~y$w_buff1~0_In-2031968153, ~y~0=~y~0_In-2031968153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2031968153} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2031968153, ~y$w_buff1~0=~y$w_buff1~0_In-2031968153, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-2031968153|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-2031968153|, ~y~0=~y~0_In-2031968153, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2031968153} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 01:27:38,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1940759474 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1940759474 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1940759474| ~y$w_buff0_used~0_In-1940759474) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-1940759474| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1940759474, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1940759474} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1940759474, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1940759474, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1940759474|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 01:27:38,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1392361782 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1392361782 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1392361782 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1392361782 256) 0))) (or (and (= ~y$w_buff1_used~0_In-1392361782 |P1Thread1of1ForFork1_#t~ite35_Out-1392361782|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1392361782|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1392361782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1392361782, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1392361782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1392361782} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1392361782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1392361782, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1392361782, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1392361782|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1392361782} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 01:27:38,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1525477992 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1525477992 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1525477992|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In1525477992 |P1Thread1of1ForFork1_#t~ite36_Out1525477992|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1525477992, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1525477992} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1525477992, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1525477992, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1525477992|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 01:27:38,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1006918166 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1006918166 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1006918166 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1006918166 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In1006918166 |P1Thread1of1ForFork1_#t~ite37_Out1006918166|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1006918166|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1006918166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1006918166, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1006918166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1006918166} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1006918166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1006918166, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1006918166, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1006918166|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1006918166} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 01:27:38,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_34|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_33|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 01:27:38,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (= 2 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 01:27:38,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1691234303 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1691234303 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1691234303| ~y$w_buff1~0_In-1691234303)) (and (= ~y~0_In-1691234303 |ULTIMATE.start_main_#t~ite40_Out-1691234303|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1691234303, ~y~0=~y~0_In-1691234303, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1691234303, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1691234303} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1691234303|, ~y$w_buff1~0=~y$w_buff1~0_In-1691234303, ~y~0=~y~0_In-1691234303, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1691234303, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1691234303} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 01:27:38,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 01:27:38,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In524239560 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In524239560 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out524239560|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In524239560 |ULTIMATE.start_main_#t~ite42_Out524239560|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In524239560, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In524239560} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In524239560, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In524239560, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out524239560|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 01:27:38,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1985592263 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1985592263 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1985592263 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1985592263 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1985592263|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1985592263 |ULTIMATE.start_main_#t~ite43_Out1985592263|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1985592263, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1985592263, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1985592263, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1985592263} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1985592263, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1985592263, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1985592263|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1985592263, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1985592263} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 01:27:38,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1811947452 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1811947452 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1811947452| ~y$r_buff0_thd0~0_In-1811947452)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1811947452| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1811947452, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1811947452} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1811947452, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1811947452, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1811947452|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 01:27:38,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In488410477 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In488410477 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In488410477 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In488410477 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out488410477| ~y$r_buff1_thd0~0_In488410477)) (and (= |ULTIMATE.start_main_#t~ite45_Out488410477| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In488410477, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In488410477, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In488410477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In488410477} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In488410477, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In488410477, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In488410477, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out488410477|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In488410477} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 01:27:38,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_28 0) (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:27:38,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:27:38 BasicIcfg [2019-12-27 01:27:38,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:27:38,965 INFO L168 Benchmark]: Toolchain (without parser) took 14448.96 ms. Allocated memory was 138.9 MB in the beginning and 439.9 MB in the end (delta: 300.9 MB). Free memory was 102.2 MB in the beginning and 309.0 MB in the end (delta: -206.8 MB). Peak memory consumption was 94.1 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:38,967 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 01:27:38,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.47 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.0 MB in the beginning and 157.4 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:38,969 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.94 ms. Allocated memory is still 202.9 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:38,969 INFO L168 Benchmark]: Boogie Preprocessor took 35.88 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 152.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:38,975 INFO L168 Benchmark]: RCFGBuilder took 767.66 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 107.9 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:38,976 INFO L168 Benchmark]: TraceAbstraction took 12800.84 ms. Allocated memory was 202.9 MB in the beginning and 439.9 MB in the end (delta: 237.0 MB). Free memory was 107.3 MB in the beginning and 309.0 MB in the end (delta: -201.7 MB). Peak memory consumption was 35.3 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:38,983 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.47 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.0 MB in the beginning and 157.4 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.94 ms. Allocated memory is still 202.9 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.88 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 152.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 767.66 ms. Allocated memory is still 202.9 MB. Free memory was 152.2 MB in the beginning and 107.9 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12800.84 ms. Allocated memory was 202.9 MB in the beginning and 439.9 MB in the end (delta: 237.0 MB). Free memory was 107.3 MB in the beginning and 309.0 MB in the end (delta: -201.7 MB). Peak memory consumption was 35.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 148 ProgramPointsBefore, 75 ProgramPointsAfterwards, 182 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 4966 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 167 SemBasedMoverChecksPositive, 218 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 77720 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t313, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t314, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1586 SDtfs, 1534 SDslu, 3136 SDs, 0 SdLazy, 2462 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 21 SyntacticMatches, 12 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8912occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 2145 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 399 ConstructedInterpolants, 0 QuantifiedInterpolants, 59230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...