/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:27:18,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:27:18,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:27:18,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:27:18,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:27:18,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:27:18,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:27:18,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:27:18,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:27:18,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:27:18,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:27:18,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:27:18,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:27:18,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:27:18,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:27:18,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:27:18,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:27:18,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:27:18,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:27:18,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:27:18,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:27:18,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:27:18,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:27:18,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:27:18,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:27:18,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:27:18,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:27:18,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:27:18,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:27:18,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:27:18,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:27:18,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:27:18,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:27:18,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:27:18,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:27:18,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:27:18,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:27:18,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:27:18,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:27:18,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:27:18,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:27:18,354 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:27:18,375 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:27:18,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:27:18,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:27:18,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:27:18,378 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:27:18,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:27:18,379 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:27:18,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:27:18,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:27:18,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:27:18,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:27:18,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:27:18,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:27:18,382 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:27:18,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:27:18,382 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:27:18,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:27:18,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:27:18,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:27:18,383 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:27:18,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:27:18,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:27:18,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:27:18,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:27:18,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:27:18,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:27:18,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:27:18,384 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:27:18,384 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:27:18,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:27:18,386 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:27:18,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:27:18,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:27:18,694 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:27:18,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:27:18,698 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:27:18,699 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:27:18,699 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_pso.opt.i [2019-12-27 20:27:18,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5cab014/96f88b49ec3c497080030b647f88d03c/FLAG37ab6292f [2019-12-27 20:27:19,330 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:27:19,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_pso.opt.i [2019-12-27 20:27:19,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5cab014/96f88b49ec3c497080030b647f88d03c/FLAG37ab6292f [2019-12-27 20:27:19,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5cab014/96f88b49ec3c497080030b647f88d03c [2019-12-27 20:27:19,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:27:19,615 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:27:19,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:27:19,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:27:19,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:27:19,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:27:19" (1/1) ... [2019-12-27 20:27:19,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e11d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:19, skipping insertion in model container [2019-12-27 20:27:19,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:27:19" (1/1) ... [2019-12-27 20:27:19,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:27:19,674 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:27:20,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:27:20,228 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:27:20,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:27:20,391 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:27:20,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:20 WrapperNode [2019-12-27 20:27:20,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:27:20,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:27:20,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:27:20,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:27:20,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:20" (1/1) ... [2019-12-27 20:27:20,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:20" (1/1) ... [2019-12-27 20:27:20,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:27:20,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:27:20,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:27:20,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:27:20,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:20" (1/1) ... [2019-12-27 20:27:20,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:20" (1/1) ... [2019-12-27 20:27:20,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:20" (1/1) ... [2019-12-27 20:27:20,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:20" (1/1) ... [2019-12-27 20:27:20,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:20" (1/1) ... [2019-12-27 20:27:20,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:20" (1/1) ... [2019-12-27 20:27:20,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:20" (1/1) ... [2019-12-27 20:27:20,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:27:20,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:27:20,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:27:20,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:27:20,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:20" (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 20:27:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:27:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:27:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:27:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:27:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:27:20,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:27:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:27:20,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:27:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:27:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:27:20,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:27:20,571 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 20:27:21,297 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:27:21,297 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:27:21,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:27:21 BoogieIcfgContainer [2019-12-27 20:27:21,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:27:21,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:27:21,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:27:21,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:27:21,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:27:19" (1/3) ... [2019-12-27 20:27:21,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9268c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:27:21, skipping insertion in model container [2019-12-27 20:27:21,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:27:20" (2/3) ... [2019-12-27 20:27:21,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9268c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:27:21, skipping insertion in model container [2019-12-27 20:27:21,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:27:21" (3/3) ... [2019-12-27 20:27:21,311 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_pso.opt.i [2019-12-27 20:27:21,325 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:27:21,325 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:27:21,339 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:27:21,340 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:27:21,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,404 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,405 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,405 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,407 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,408 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,409 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,417 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,417 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,465 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,465 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,471 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,474 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:27:21,490 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:27:21,511 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:27:21,511 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:27:21,511 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:27:21,511 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:27:21,511 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:27:21,511 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:27:21,511 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:27:21,512 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:27:21,528 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 20:27:21,530 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 20:27:21,621 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 20:27:21,622 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:27:21,639 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:27:21,660 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 20:27:21,706 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 20:27:21,706 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:27:21,712 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:27:21,727 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 20:27:21,728 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:27:24,879 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-27 20:27:25,107 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 20:27:25,226 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 20:27:25,252 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55625 [2019-12-27 20:27:25,252 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 20:27:25,256 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 89 transitions [2019-12-27 20:27:25,766 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-27 20:27:25,768 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-27 20:27:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:27:25,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:25,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:27:25,777 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:25,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:25,784 INFO L82 PathProgramCache]: Analyzing trace with hash 786448, now seen corresponding path program 1 times [2019-12-27 20:27:25,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:25,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201537563] [2019-12-27 20:27:25,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:26,052 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 20:27:26,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201537563] [2019-12-27 20:27:26,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:26,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:27:26,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1814258001] [2019-12-27 20:27:26,057 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:26,064 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:26,079 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:27:26,080 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:26,084 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:26,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:26,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:26,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:26,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:26,105 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-27 20:27:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:26,357 INFO L93 Difference]: Finished difference Result 9196 states and 29676 transitions. [2019-12-27 20:27:26,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:26,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:27:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:26,445 INFO L225 Difference]: With dead ends: 9196 [2019-12-27 20:27:26,446 INFO L226 Difference]: Without dead ends: 8650 [2019-12-27 20:27:26,447 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 20:27:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8650 states. [2019-12-27 20:27:26,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8650 to 8650. [2019-12-27 20:27:26,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8650 states. [2019-12-27 20:27:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 27866 transitions. [2019-12-27 20:27:27,009 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 27866 transitions. Word has length 3 [2019-12-27 20:27:27,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:27,010 INFO L462 AbstractCegarLoop]: Abstraction has 8650 states and 27866 transitions. [2019-12-27 20:27:27,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 27866 transitions. [2019-12-27 20:27:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:27:27,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:27,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:27,017 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:27,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1848805564, now seen corresponding path program 1 times [2019-12-27 20:27:27,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:27,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991186261] [2019-12-27 20:27:27,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:27,168 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 20:27:27,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991186261] [2019-12-27 20:27:27,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:27,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:27,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [741155574] [2019-12-27 20:27:27,170 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:27,171 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:27,173 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:27:27,173 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:27,173 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:27,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:27,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:27,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:27,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:27,176 INFO L87 Difference]: Start difference. First operand 8650 states and 27866 transitions. Second operand 4 states. [2019-12-27 20:27:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:27,671 INFO L93 Difference]: Finished difference Result 13062 states and 40116 transitions. [2019-12-27 20:27:27,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:27,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:27:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:27,743 INFO L225 Difference]: With dead ends: 13062 [2019-12-27 20:27:27,743 INFO L226 Difference]: Without dead ends: 13055 [2019-12-27 20:27:27,744 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 20:27:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13055 states. [2019-12-27 20:27:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13055 to 11681. [2019-12-27 20:27:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11681 states. [2019-12-27 20:27:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 36573 transitions. [2019-12-27 20:27:28,167 INFO L78 Accepts]: Start accepts. Automaton has 11681 states and 36573 transitions. Word has length 11 [2019-12-27 20:27:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:28,167 INFO L462 AbstractCegarLoop]: Abstraction has 11681 states and 36573 transitions. [2019-12-27 20:27:28,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:28,167 INFO L276 IsEmpty]: Start isEmpty. Operand 11681 states and 36573 transitions. [2019-12-27 20:27:28,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:27:28,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:28,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:28,172 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:28,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:28,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1479508104, now seen corresponding path program 1 times [2019-12-27 20:27:28,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:28,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018882017] [2019-12-27 20:27:28,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:28,260 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 20:27:28,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018882017] [2019-12-27 20:27:28,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:28,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:28,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1842801002] [2019-12-27 20:27:28,262 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:28,265 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:28,383 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:27:28,383 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:28,383 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:28,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:28,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:28,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:28,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:28,385 INFO L87 Difference]: Start difference. First operand 11681 states and 36573 transitions. Second operand 4 states. [2019-12-27 20:27:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:28,662 INFO L93 Difference]: Finished difference Result 13877 states and 43308 transitions. [2019-12-27 20:27:28,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:28,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:27:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:28,708 INFO L225 Difference]: With dead ends: 13877 [2019-12-27 20:27:28,709 INFO L226 Difference]: Without dead ends: 13877 [2019-12-27 20:27:28,709 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 20:27:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13877 states. [2019-12-27 20:27:29,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13877 to 12389. [2019-12-27 20:27:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12389 states. [2019-12-27 20:27:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12389 states to 12389 states and 38882 transitions. [2019-12-27 20:27:29,154 INFO L78 Accepts]: Start accepts. Automaton has 12389 states and 38882 transitions. Word has length 14 [2019-12-27 20:27:29,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:29,155 INFO L462 AbstractCegarLoop]: Abstraction has 12389 states and 38882 transitions. [2019-12-27 20:27:29,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 12389 states and 38882 transitions. [2019-12-27 20:27:29,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:27:29,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:29,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:29,160 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:29,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:29,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1357739076, now seen corresponding path program 1 times [2019-12-27 20:27:29,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:29,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567446792] [2019-12-27 20:27:29,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:29,711 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 20:27:29,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567446792] [2019-12-27 20:27:29,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:29,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:27:29,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [355217085] [2019-12-27 20:27:29,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:29,714 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:29,716 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 20:27:29,717 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:29,718 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:29,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:29,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:29,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:29,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:29,719 INFO L87 Difference]: Start difference. First operand 12389 states and 38882 transitions. Second operand 3 states. [2019-12-27 20:27:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:29,782 INFO L93 Difference]: Finished difference Result 12386 states and 38873 transitions. [2019-12-27 20:27:29,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:29,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 20:27:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:29,820 INFO L225 Difference]: With dead ends: 12386 [2019-12-27 20:27:29,820 INFO L226 Difference]: Without dead ends: 12386 [2019-12-27 20:27:29,821 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 20:27:29,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2019-12-27 20:27:30,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 12386. [2019-12-27 20:27:30,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12386 states. [2019-12-27 20:27:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 38873 transitions. [2019-12-27 20:27:30,209 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 38873 transitions. Word has length 16 [2019-12-27 20:27:30,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:30,209 INFO L462 AbstractCegarLoop]: Abstraction has 12386 states and 38873 transitions. [2019-12-27 20:27:30,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 38873 transitions. [2019-12-27 20:27:30,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 20:27:30,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:30,216 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:30,216 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:30,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:30,216 INFO L82 PathProgramCache]: Analyzing trace with hash 865126068, now seen corresponding path program 1 times [2019-12-27 20:27:30,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:30,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335571045] [2019-12-27 20:27:30,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:30,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:27:30,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335571045] [2019-12-27 20:27:30,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:30,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:27:30,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1742452326] [2019-12-27 20:27:30,328 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:30,330 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:30,335 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 20:27:30,336 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:30,342 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:27:30,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:30,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:30,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:30,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:30,344 INFO L87 Difference]: Start difference. First operand 12386 states and 38873 transitions. Second operand 4 states. [2019-12-27 20:27:30,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:30,398 INFO L93 Difference]: Finished difference Result 2361 states and 5903 transitions. [2019-12-27 20:27:30,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:27:30,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 20:27:30,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:30,406 INFO L225 Difference]: With dead ends: 2361 [2019-12-27 20:27:30,406 INFO L226 Difference]: Without dead ends: 1670 [2019-12-27 20:27:30,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:27:30,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-12-27 20:27:30,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1654. [2019-12-27 20:27:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-27 20:27:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3696 transitions. [2019-12-27 20:27:30,519 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3696 transitions. Word has length 17 [2019-12-27 20:27:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:30,519 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3696 transitions. [2019-12-27 20:27:30,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3696 transitions. [2019-12-27 20:27:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:27:30,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:30,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:30,522 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:30,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:30,522 INFO L82 PathProgramCache]: Analyzing trace with hash 935036584, now seen corresponding path program 1 times [2019-12-27 20:27:30,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:30,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377256836] [2019-12-27 20:27:30,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:30,663 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 20:27:30,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377256836] [2019-12-27 20:27:30,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:30,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:30,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1131380715] [2019-12-27 20:27:30,665 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:30,669 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:30,676 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:27:30,676 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:30,676 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:30,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:27:30,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:30,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:27:30,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:27:30,677 INFO L87 Difference]: Start difference. First operand 1654 states and 3696 transitions. Second operand 6 states. [2019-12-27 20:27:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:31,341 INFO L93 Difference]: Finished difference Result 4552 states and 10047 transitions. [2019-12-27 20:27:31,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:27:31,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 20:27:31,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:31,353 INFO L225 Difference]: With dead ends: 4552 [2019-12-27 20:27:31,353 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 20:27:31,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:27:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 20:27:31,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 2214. [2019-12-27 20:27:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2019-12-27 20:27:31,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 5000 transitions. [2019-12-27 20:27:31,409 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 5000 transitions. Word has length 25 [2019-12-27 20:27:31,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:31,410 INFO L462 AbstractCegarLoop]: Abstraction has 2214 states and 5000 transitions. [2019-12-27 20:27:31,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:27:31,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 5000 transitions. [2019-12-27 20:27:31,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:27:31,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:31,413 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 20:27:31,413 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:31,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:31,413 INFO L82 PathProgramCache]: Analyzing trace with hash -453087513, now seen corresponding path program 1 times [2019-12-27 20:27:31,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:31,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887615189] [2019-12-27 20:27:31,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:31,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 20:27:31,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887615189] [2019-12-27 20:27:31,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:31,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:31,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1292689554] [2019-12-27 20:27:31,459 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:31,463 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:31,472 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 20:27:31,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:31,510 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:27:31,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:31,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:31,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:31,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:31,511 INFO L87 Difference]: Start difference. First operand 2214 states and 5000 transitions. Second operand 4 states. [2019-12-27 20:27:31,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:31,539 INFO L93 Difference]: Finished difference Result 3872 states and 8779 transitions. [2019-12-27 20:27:31,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:31,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 20:27:31,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:31,545 INFO L225 Difference]: With dead ends: 3872 [2019-12-27 20:27:31,545 INFO L226 Difference]: Without dead ends: 2030 [2019-12-27 20:27:31,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 20:27:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2019-12-27 20:27:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2010. [2019-12-27 20:27:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2019-12-27 20:27:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 4452 transitions. [2019-12-27 20:27:31,579 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 4452 transitions. Word has length 26 [2019-12-27 20:27:31,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:31,579 INFO L462 AbstractCegarLoop]: Abstraction has 2010 states and 4452 transitions. [2019-12-27 20:27:31,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:31,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 4452 transitions. [2019-12-27 20:27:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:27:31,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:31,582 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 20:27:31,582 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:31,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:31,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1584123616, now seen corresponding path program 1 times [2019-12-27 20:27:31,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:31,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117582100] [2019-12-27 20:27:31,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:31,662 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 20:27:31,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117582100] [2019-12-27 20:27:31,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:31,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:31,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [802279180] [2019-12-27 20:27:31,663 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:31,669 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:31,676 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 20:27:31,676 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:31,676 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:31,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:27:31,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:31,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:27:31,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:27:31,678 INFO L87 Difference]: Start difference. First operand 2010 states and 4452 transitions. Second operand 6 states. [2019-12-27 20:27:32,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:32,190 INFO L93 Difference]: Finished difference Result 3736 states and 7983 transitions. [2019-12-27 20:27:32,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 20:27:32,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 20:27:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:32,196 INFO L225 Difference]: With dead ends: 3736 [2019-12-27 20:27:32,197 INFO L226 Difference]: Without dead ends: 3707 [2019-12-27 20:27:32,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:27:32,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2019-12-27 20:27:32,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 1982. [2019-12-27 20:27:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 20:27:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4405 transitions. [2019-12-27 20:27:32,244 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4405 transitions. Word has length 26 [2019-12-27 20:27:32,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:32,244 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4405 transitions. [2019-12-27 20:27:32,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:27:32,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4405 transitions. [2019-12-27 20:27:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:27:32,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:32,248 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 20:27:32,248 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:32,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:32,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1377848575, now seen corresponding path program 1 times [2019-12-27 20:27:32,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:32,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14785948] [2019-12-27 20:27:32,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:32,349 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 20:27:32,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14785948] [2019-12-27 20:27:32,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:32,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:27:32,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2078822095] [2019-12-27 20:27:32,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:32,354 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:32,366 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 20:27:32,366 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:32,448 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:27:32,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:27:32,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:32,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:27:32,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:27:32,449 INFO L87 Difference]: Start difference. First operand 1982 states and 4405 transitions. Second operand 8 states. [2019-12-27 20:27:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:33,229 INFO L93 Difference]: Finished difference Result 2989 states and 6529 transitions. [2019-12-27 20:27:33,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:27:33,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 20:27:33,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:33,234 INFO L225 Difference]: With dead ends: 2989 [2019-12-27 20:27:33,235 INFO L226 Difference]: Without dead ends: 2989 [2019-12-27 20:27:33,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:27:33,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2019-12-27 20:27:33,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2553. [2019-12-27 20:27:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-12-27 20:27:33,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 5641 transitions. [2019-12-27 20:27:33,277 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 5641 transitions. Word has length 27 [2019-12-27 20:27:33,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:33,277 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 5641 transitions. [2019-12-27 20:27:33,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:27:33,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 5641 transitions. [2019-12-27 20:27:33,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:27:33,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:33,282 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 20:27:33,282 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:33,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:33,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1012801820, now seen corresponding path program 1 times [2019-12-27 20:27:33,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:33,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70316558] [2019-12-27 20:27:33,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:33,371 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 20:27:33,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70316558] [2019-12-27 20:27:33,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:33,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:33,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [335347660] [2019-12-27 20:27:33,372 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:33,376 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:33,390 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 20:27:33,390 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:33,414 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:27:33,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:27:33,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:33,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:27:33,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:27:33,415 INFO L87 Difference]: Start difference. First operand 2553 states and 5641 transitions. Second operand 6 states. [2019-12-27 20:27:33,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:33,463 INFO L93 Difference]: Finished difference Result 1549 states and 3250 transitions. [2019-12-27 20:27:33,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:33,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 20:27:33,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:33,466 INFO L225 Difference]: With dead ends: 1549 [2019-12-27 20:27:33,466 INFO L226 Difference]: Without dead ends: 1302 [2019-12-27 20:27:33,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:27:33,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2019-12-27 20:27:33,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1207. [2019-12-27 20:27:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2019-12-27 20:27:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 2612 transitions. [2019-12-27 20:27:33,485 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 2612 transitions. Word has length 28 [2019-12-27 20:27:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:33,485 INFO L462 AbstractCegarLoop]: Abstraction has 1207 states and 2612 transitions. [2019-12-27 20:27:33,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:27:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 2612 transitions. [2019-12-27 20:27:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:27:33,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:33,489 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 20:27:33,489 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:33,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:33,489 INFO L82 PathProgramCache]: Analyzing trace with hash -257669256, now seen corresponding path program 1 times [2019-12-27 20:27:33,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:33,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325478934] [2019-12-27 20:27:33,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:33,588 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 20:27:33,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325478934] [2019-12-27 20:27:33,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:33,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:27:33,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1650879883] [2019-12-27 20:27:33,590 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:33,605 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:33,707 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 135 transitions. [2019-12-27 20:27:33,707 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:33,777 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:27:33,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:27:33,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:33,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:27:33,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:27:33,778 INFO L87 Difference]: Start difference. First operand 1207 states and 2612 transitions. Second operand 9 states. [2019-12-27 20:27:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:34,052 INFO L93 Difference]: Finished difference Result 2115 states and 4473 transitions. [2019-12-27 20:27:34,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:27:34,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 20:27:34,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:34,054 INFO L225 Difference]: With dead ends: 2115 [2019-12-27 20:27:34,055 INFO L226 Difference]: Without dead ends: 1423 [2019-12-27 20:27:34,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:27:34,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-12-27 20:27:34,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1214. [2019-12-27 20:27:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-27 20:27:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2602 transitions. [2019-12-27 20:27:34,076 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2602 transitions. Word has length 51 [2019-12-27 20:27:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:34,077 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 2602 transitions. [2019-12-27 20:27:34,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:27:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2602 transitions. [2019-12-27 20:27:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:27:34,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:34,080 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 20:27:34,080 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:34,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:34,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1643045960, now seen corresponding path program 2 times [2019-12-27 20:27:34,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:34,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558009647] [2019-12-27 20:27:34,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:34,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 20:27:34,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558009647] [2019-12-27 20:27:34,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:34,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:34,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1008171961] [2019-12-27 20:27:34,183 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:34,198 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:34,257 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 133 transitions. [2019-12-27 20:27:34,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:34,263 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:27:34,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:34,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:34,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:34,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:34,265 INFO L87 Difference]: Start difference. First operand 1214 states and 2602 transitions. Second operand 3 states. [2019-12-27 20:27:34,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:34,340 INFO L93 Difference]: Finished difference Result 1587 states and 3364 transitions. [2019-12-27 20:27:34,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:34,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 20:27:34,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:34,345 INFO L225 Difference]: With dead ends: 1587 [2019-12-27 20:27:34,345 INFO L226 Difference]: Without dead ends: 1587 [2019-12-27 20:27:34,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:34,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2019-12-27 20:27:34,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1262. [2019-12-27 20:27:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1262 states. [2019-12-27 20:27:34,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 2714 transitions. [2019-12-27 20:27:34,371 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 2714 transitions. Word has length 51 [2019-12-27 20:27:34,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:34,372 INFO L462 AbstractCegarLoop]: Abstraction has 1262 states and 2714 transitions. [2019-12-27 20:27:34,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:34,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 2714 transitions. [2019-12-27 20:27:34,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:27:34,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:34,377 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 20:27:34,377 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:34,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:34,378 INFO L82 PathProgramCache]: Analyzing trace with hash 730196883, now seen corresponding path program 1 times [2019-12-27 20:27:34,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:34,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305053018] [2019-12-27 20:27:34,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:34,565 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 20:27:34,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305053018] [2019-12-27 20:27:34,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:34,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:27:34,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [839750225] [2019-12-27 20:27:34,566 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:34,581 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:34,641 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 138 transitions. [2019-12-27 20:27:34,641 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:34,708 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:27:34,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:27:34,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:34,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:27:34,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:27:34,710 INFO L87 Difference]: Start difference. First operand 1262 states and 2714 transitions. Second operand 9 states. [2019-12-27 20:27:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:36,493 INFO L93 Difference]: Finished difference Result 2653 states and 5478 transitions. [2019-12-27 20:27:36,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 20:27:36,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 20:27:36,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:36,501 INFO L225 Difference]: With dead ends: 2653 [2019-12-27 20:27:36,501 INFO L226 Difference]: Without dead ends: 2653 [2019-12-27 20:27:36,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2019-12-27 20:27:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2019-12-27 20:27:36,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 1286. [2019-12-27 20:27:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2019-12-27 20:27:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2747 transitions. [2019-12-27 20:27:36,531 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2747 transitions. Word has length 52 [2019-12-27 20:27:36,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:36,531 INFO L462 AbstractCegarLoop]: Abstraction has 1286 states and 2747 transitions. [2019-12-27 20:27:36,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:27:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2747 transitions. [2019-12-27 20:27:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:27:36,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:36,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:36,535 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash -539154384, now seen corresponding path program 1 times [2019-12-27 20:27:36,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:36,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624692732] [2019-12-27 20:27:36,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:36,595 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 20:27:36,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624692732] [2019-12-27 20:27:36,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:36,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:27:36,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1523402687] [2019-12-27 20:27:36,596 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:36,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:36,688 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 138 transitions. [2019-12-27 20:27:36,688 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:36,692 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:27:36,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:27:36,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:36,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:27:36,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:27:36,693 INFO L87 Difference]: Start difference. First operand 1286 states and 2747 transitions. Second operand 4 states. [2019-12-27 20:27:36,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:36,948 INFO L93 Difference]: Finished difference Result 1970 states and 4215 transitions. [2019-12-27 20:27:36,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:27:36,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 20:27:36,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:36,952 INFO L225 Difference]: With dead ends: 1970 [2019-12-27 20:27:36,952 INFO L226 Difference]: Without dead ends: 1970 [2019-12-27 20:27:36,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:27:36,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2019-12-27 20:27:36,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1316. [2019-12-27 20:27:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-12-27 20:27:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 2818 transitions. [2019-12-27 20:27:36,978 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 2818 transitions. Word has length 52 [2019-12-27 20:27:36,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:36,978 INFO L462 AbstractCegarLoop]: Abstraction has 1316 states and 2818 transitions. [2019-12-27 20:27:36,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:27:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 2818 transitions. [2019-12-27 20:27:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:27:36,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:36,982 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 20:27:36,982 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:36,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:36,982 INFO L82 PathProgramCache]: Analyzing trace with hash -930930685, now seen corresponding path program 2 times [2019-12-27 20:27:36,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:36,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656235325] [2019-12-27 20:27:36,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:27:37,049 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 20:27:37,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656235325] [2019-12-27 20:27:37,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:27:37,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:27:37,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [531966513] [2019-12-27 20:27:37,051 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:27:37,066 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:27:37,132 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 120 transitions. [2019-12-27 20:27:37,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:27:37,133 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:27:37,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:27:37,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:27:37,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:27:37,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:27:37,134 INFO L87 Difference]: Start difference. First operand 1316 states and 2818 transitions. Second operand 3 states. [2019-12-27 20:27:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:27:37,149 INFO L93 Difference]: Finished difference Result 1315 states and 2816 transitions. [2019-12-27 20:27:37,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:27:37,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:27:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:27:37,151 INFO L225 Difference]: With dead ends: 1315 [2019-12-27 20:27:37,151 INFO L226 Difference]: Without dead ends: 1315 [2019-12-27 20:27:37,152 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 20:27:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2019-12-27 20:27:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 935. [2019-12-27 20:27:37,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-12-27 20:27:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 2029 transitions. [2019-12-27 20:27:37,169 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 2029 transitions. Word has length 52 [2019-12-27 20:27:37,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:27:37,170 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 2029 transitions. [2019-12-27 20:27:37,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:27:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 2029 transitions. [2019-12-27 20:27:37,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:27:37,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:27:37,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:27:37,173 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:27:37,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:27:37,173 INFO L82 PathProgramCache]: Analyzing trace with hash -87902062, now seen corresponding path program 1 times [2019-12-27 20:27:37,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:27:37,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873248762] [2019-12-27 20:27:37,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:27:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:27:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:27:37,380 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:27:37,382 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:27:37,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t591~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t591~0.base_22|) |v_ULTIMATE.start_main_~#t591~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd2~0_77 0) (= 0 v_~__unbuffered_cnt~0_13) (= 0 v_~__unbuffered_p1_EAX~0_12) (= 0 v_~y$r_buff1_thd2~0_53) (= 0 v_~y$r_buff1_thd0~0_22) (= 0 v_~weak$$choice0~0_5) (= v_~y$r_buff0_thd0~0_24 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~y$flush_delayed~0_14) (= v_~y$read_delayed~0_6 0) (= v_~y$mem_tmp~0_11 0) (= v_~x~0_17 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~y$read_delayed_var~0.base_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t591~0.base_22| 1) |v_#valid_44|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t591~0.base_22| 4) |v_#length_17|) (= v_~main$tmp_guard1~0_15 0) (= |v_#NULL.offset_4| 0) (= v_~y$w_buff1_used~0_67 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t591~0.base_22|)) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~main$tmp_guard0~0_11 0) (= v_~y~0_26 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t591~0.base_22|) (= 0 |v_ULTIMATE.start_main_~#t591~0.offset_17|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_~#t591~0.offset=|v_ULTIMATE.start_main_~#t591~0.offset_17|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_20|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t591~0.base=|v_ULTIMATE.start_main_~#t591~0.base_22|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_17|, ~y~0=v_~y~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_~#t592~0.base=|v_ULTIMATE.start_main_~#t592~0.base_18|, ULTIMATE.start_main_~#t592~0.offset=|v_ULTIMATE.start_main_~#t592~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_24, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_77, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_17, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t591~0.offset, #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, ULTIMATE.start_main_~#t591~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t592~0.base, ULTIMATE.start_main_~#t592~0.offset, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:27:37,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L797-1-->L799: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t592~0.base_12|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t592~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t592~0.base_12|) |v_ULTIMATE.start_main_~#t592~0.offset_10| 1)) |v_#memory_int_9|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t592~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t592~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t592~0.offset_10| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t592~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t592~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t592~0.base=|v_ULTIMATE.start_main_~#t592~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t592~0.offset=|v_ULTIMATE.start_main_~#t592~0.offset_10|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t592~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t592~0.offset, #length] because there is no mapped edge [2019-12-27 20:27:37,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_11) (= 1 v_~x~0_5) (= v_~y$r_buff0_thd2~0_55 v_~y$r_buff1_thd2~0_33) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$r_buff0_thd1~0_16 1) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 20:27:37,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1110053219 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1110053219 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1110053219| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1110053219| ~y$w_buff0_used~0_In-1110053219) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1110053219, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1110053219} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1110053219|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1110053219, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1110053219} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:27:37,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In208374527 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In208374527 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In208374527 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In208374527 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out208374527| ~y$w_buff1_used~0_In208374527)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out208374527|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In208374527, ~y$w_buff0_used~0=~y$w_buff0_used~0_In208374527, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In208374527, ~y$w_buff1_used~0=~y$w_buff1_used~0_In208374527} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out208374527|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In208374527, ~y$w_buff0_used~0=~y$w_buff0_used~0_In208374527, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In208374527, ~y$w_buff1_used~0=~y$w_buff1_used~0_In208374527} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:27:37,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-877219887 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-877219887 256) 0))) (or (and (= 0 ~y$r_buff0_thd1~0_Out-877219887) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-877219887 ~y$r_buff0_thd1~0_Out-877219887)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-877219887, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-877219887} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-877219887, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-877219887|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-877219887} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:27:37,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-156730704 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out-156730704| |P1Thread1of1ForFork1_#t~ite14_Out-156730704|) (= ~y$w_buff0~0_In-156730704 |P1Thread1of1ForFork1_#t~ite14_Out-156730704|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-156730704 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-156730704 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-156730704 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-156730704 256) 0))))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out-156730704| ~y$w_buff0~0_In-156730704) (= |P1Thread1of1ForFork1_#t~ite14_In-156730704| |P1Thread1of1ForFork1_#t~ite14_Out-156730704|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-156730704, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-156730704, ~y$w_buff0~0=~y$w_buff0~0_In-156730704, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-156730704, ~weak$$choice2~0=~weak$$choice2~0_In-156730704, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-156730704|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-156730704} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-156730704, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-156730704, ~y$w_buff0~0=~y$w_buff0~0_In-156730704, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-156730704, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-156730704|, ~weak$$choice2~0=~weak$$choice2~0_In-156730704, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-156730704|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-156730704} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 20:27:37,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In180072452 256) 0))) (or (and .cse0 (= ~y$w_buff1~0_In180072452 |P1Thread1of1ForFork1_#t~ite17_Out180072452|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In180072452 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In180072452 256) 0) .cse1) (and (= (mod ~y$w_buff1_used~0_In180072452 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In180072452 256)))) (= |P1Thread1of1ForFork1_#t~ite18_Out180072452| |P1Thread1of1ForFork1_#t~ite17_Out180072452|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In180072452| |P1Thread1of1ForFork1_#t~ite17_Out180072452|) (= |P1Thread1of1ForFork1_#t~ite18_Out180072452| ~y$w_buff1~0_In180072452)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In180072452, ~y$w_buff1~0=~y$w_buff1~0_In180072452, ~y$w_buff0_used~0=~y$w_buff0_used~0_In180072452, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In180072452, ~weak$$choice2~0=~weak$$choice2~0_In180072452, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In180072452|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In180072452} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In180072452, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out180072452|, ~y$w_buff1~0=~y$w_buff1~0_In180072452, ~y$w_buff0_used~0=~y$w_buff0_used~0_In180072452, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In180072452, ~weak$$choice2~0=~weak$$choice2~0_In180072452, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out180072452|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In180072452} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 20:27:37,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1181975020 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1181975020 256)))) (or (= (mod ~y$w_buff0_used~0_In1181975020 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In1181975020 256))) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In1181975020 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite20_Out1181975020| |P1Thread1of1ForFork1_#t~ite21_Out1181975020|) .cse1 (= |P1Thread1of1ForFork1_#t~ite20_Out1181975020| ~y$w_buff0_used~0_In1181975020)) (and (= |P1Thread1of1ForFork1_#t~ite20_In1181975020| |P1Thread1of1ForFork1_#t~ite20_Out1181975020|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite21_Out1181975020| ~y$w_buff0_used~0_In1181975020)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1181975020, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1181975020, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1181975020|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1181975020, ~weak$$choice2~0=~weak$$choice2~0_In1181975020, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1181975020} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1181975020, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1181975020, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1181975020|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1181975020, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1181975020|, ~weak$$choice2~0=~weak$$choice2~0_In1181975020, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1181975020} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 20:27:37,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_61 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 20:27:37,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1382181179 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-1382181179| ~y$r_buff1_thd2~0_In-1382181179) (= |P1Thread1of1ForFork1_#t~ite30_Out-1382181179| |P1Thread1of1ForFork1_#t~ite29_Out-1382181179|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1382181179 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1382181179 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1382181179 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1382181179 256)) .cse1)))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1382181179| |P1Thread1of1ForFork1_#t~ite29_Out-1382181179|) (= |P1Thread1of1ForFork1_#t~ite30_Out-1382181179| ~y$r_buff1_thd2~0_In-1382181179)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1382181179, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1382181179|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1382181179, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1382181179, ~weak$$choice2~0=~weak$$choice2~0_In-1382181179, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1382181179} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1382181179, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1382181179|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1382181179|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1382181179, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1382181179, ~weak$$choice2~0=~weak$$choice2~0_In-1382181179, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1382181179} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 20:27:37,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In2065122796 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In2065122796 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In2065122796 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In2065122796 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In2065122796 |P0Thread1of1ForFork0_#t~ite8_Out2065122796|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out2065122796|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2065122796, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2065122796, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2065122796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2065122796} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2065122796, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2065122796, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2065122796|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2065122796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2065122796} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:27:37,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L742-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} 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 20:27:37,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_15 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 20:27:37,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1802497854 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1802497854 256)))) (or (and (= ~y~0_In1802497854 |P1Thread1of1ForFork1_#t~ite32_Out1802497854|) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In1802497854 |P1Thread1of1ForFork1_#t~ite32_Out1802497854|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1802497854, ~y$w_buff1~0=~y$w_buff1~0_In1802497854, ~y~0=~y~0_In1802497854, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1802497854} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1802497854, ~y$w_buff1~0=~y$w_buff1~0_In1802497854, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1802497854|, ~y~0=~y~0_In1802497854, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1802497854} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 20:27:37,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_16 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 20:27:37,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-579728674 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-579728674 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-579728674| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-579728674| ~y$w_buff0_used~0_In-579728674)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-579728674, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-579728674} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-579728674, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-579728674, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-579728674|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:27:37,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-768640689 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-768640689 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-768640689 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-768640689 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-768640689| 0)) (and (= ~y$w_buff1_used~0_In-768640689 |P1Thread1of1ForFork1_#t~ite35_Out-768640689|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-768640689, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-768640689, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-768640689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-768640689} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-768640689, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-768640689, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-768640689, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-768640689|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-768640689} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:27:37,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-650419650 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-650419650 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-650419650|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-650419650 |P1Thread1of1ForFork1_#t~ite36_Out-650419650|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-650419650, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-650419650} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-650419650, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-650419650, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-650419650|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:27:37,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-657117839 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-657117839 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-657117839 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-657117839 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-657117839 |P1Thread1of1ForFork1_#t~ite37_Out-657117839|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-657117839|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-657117839, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-657117839, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-657117839, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-657117839} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-657117839, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-657117839, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-657117839, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-657117839|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-657117839} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:27:37,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} 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 20:27:37,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_82 256)) (= (mod v_~y$r_buff0_thd0~0_17 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 20:27:37,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In472864805 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In472864805 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out472864805| ~y~0_In472864805)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out472864805| ~y$w_buff1~0_In472864805) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In472864805, ~y~0=~y~0_In472864805, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In472864805, ~y$w_buff1_used~0=~y$w_buff1_used~0_In472864805} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out472864805|, ~y$w_buff1~0=~y$w_buff1~0_In472864805, ~y~0=~y~0_In472864805, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In472864805, ~y$w_buff1_used~0=~y$w_buff1_used~0_In472864805} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:27:37,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 20:27:37,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1456357570 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1456357570 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out1456357570| 0)) (and (= ~y$w_buff0_used~0_In1456357570 |ULTIMATE.start_main_#t~ite42_Out1456357570|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1456357570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1456357570} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1456357570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1456357570, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1456357570|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:27:37,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1809798397 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1809798397 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1809798397 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1809798397 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1809798397 |ULTIMATE.start_main_#t~ite43_Out1809798397|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1809798397|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1809798397, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1809798397, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1809798397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1809798397} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1809798397, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1809798397, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1809798397|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1809798397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1809798397} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:27:37,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1267687301 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1267687301 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1267687301|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-1267687301 |ULTIMATE.start_main_#t~ite44_Out-1267687301|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1267687301, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1267687301} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1267687301, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1267687301, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1267687301|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:27:37,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In2147230897 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In2147230897 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In2147230897 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2147230897 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out2147230897| ~y$r_buff1_thd0~0_In2147230897)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out2147230897| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2147230897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2147230897, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2147230897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2147230897} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2147230897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2147230897, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2147230897, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2147230897|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2147230897} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:27:37,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_10| v_~y$r_buff1_thd0~0_14) (= 2 v_~__unbuffered_p1_EAX~0_7) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 2 v_~x~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~x~0=v_~x~0_9, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x~0=v_~x~0_9, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} 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 20:27:37,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:27:37 BasicIcfg [2019-12-27 20:27:37,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:27:37,497 INFO L168 Benchmark]: Toolchain (without parser) took 17882.16 ms. Allocated memory was 146.8 MB in the beginning and 724.0 MB in the end (delta: 577.2 MB). Free memory was 102.7 MB in the beginning and 610.3 MB in the end (delta: -507.6 MB). Peak memory consumption was 69.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:37,498 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 20:27:37,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.75 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 102.5 MB in the beginning and 159.6 MB in the end (delta: -57.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:37,499 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.29 ms. Allocated memory is still 205.0 MB. Free memory was 159.6 MB in the beginning and 157.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:37,500 INFO L168 Benchmark]: Boogie Preprocessor took 37.34 ms. Allocated memory is still 205.0 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:37,501 INFO L168 Benchmark]: RCFGBuilder took 799.99 ms. Allocated memory is still 205.0 MB. Free memory was 154.5 MB in the beginning and 110.1 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:37,501 INFO L168 Benchmark]: TraceAbstraction took 16194.82 ms. Allocated memory was 205.0 MB in the beginning and 724.0 MB in the end (delta: 519.0 MB). Free memory was 110.1 MB in the beginning and 610.3 MB in the end (delta: -500.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:27:37,508 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.16 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.75 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 102.5 MB in the beginning and 159.6 MB in the end (delta: -57.1 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.29 ms. Allocated memory is still 205.0 MB. Free memory was 159.6 MB in the beginning and 157.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.34 ms. Allocated memory is still 205.0 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 799.99 ms. Allocated memory is still 205.0 MB. Free memory was 154.5 MB in the beginning and 110.1 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16194.82 ms. Allocated memory was 205.0 MB in the beginning and 724.0 MB in the end (delta: 519.0 MB). Free memory was 110.1 MB in the beginning and 610.3 MB in the end (delta: -500.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 27 ChoiceCompositions, 4371 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 55625 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1964 SDtfs, 2317 SDslu, 4291 SDs, 0 SdLazy, 3226 SolverSat, 183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 49 SyntacticMatches, 13 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12389occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 10392 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 436 ConstructedInterpolants, 0 QuantifiedInterpolants, 50628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...