/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:28:17,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:28:17,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:28:17,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:28:17,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:28:17,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:28:17,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:28:17,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:28:17,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:28:17,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:28:17,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:28:17,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:28:17,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:28:17,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:28:17,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:28:17,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:28:17,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:28:17,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:28:17,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:28:17,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:28:17,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:28:17,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:28:17,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:28:17,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:28:17,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:28:17,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:28:17,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:28:17,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:28:17,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:28:17,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:28:17,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:28:17,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:28:17,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:28:17,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:28:17,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:28:17,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:28:17,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:28:17,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:28:17,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:28:17,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:28:17,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:28:17,413 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:28:17,427 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:28:17,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:28:17,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:28:17,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:28:17,429 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:28:17,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:28:17,429 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:28:17,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:28:17,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:28:17,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:28:17,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:28:17,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:28:17,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:28:17,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:28:17,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:28:17,431 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:28:17,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:28:17,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:28:17,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:28:17,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:28:17,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:28:17,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:28:17,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:28:17,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:28:17,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:28:17,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:28:17,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:28:17,433 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:28:17,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:28:17,433 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:28:17,434 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:28:17,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:28:17,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:28:17,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:28:17,740 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:28:17,741 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:28:17,741 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc.i [2019-12-27 17:28:17,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9fdce1f/e4c73d18a5f24c61b1476ca6257da3fd/FLAG5c41462fd [2019-12-27 17:28:18,354 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:28:18,354 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc.i [2019-12-27 17:28:18,370 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9fdce1f/e4c73d18a5f24c61b1476ca6257da3fd/FLAG5c41462fd [2019-12-27 17:28:18,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9fdce1f/e4c73d18a5f24c61b1476ca6257da3fd [2019-12-27 17:28:18,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:28:18,670 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:28:18,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:28:18,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:28:18,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:28:18,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:28:18" (1/1) ... [2019-12-27 17:28:18,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a0c9cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:18, skipping insertion in model container [2019-12-27 17:28:18,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:28:18" (1/1) ... [2019-12-27 17:28:18,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:28:18,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:28:19,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:28:19,211 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:28:19,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:28:19,395 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:28:19,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:19 WrapperNode [2019-12-27 17:28:19,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:28:19,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:28:19,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:28:19,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:28:19,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:19" (1/1) ... [2019-12-27 17:28:19,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 05:28:19" (1/1) ... [2019-12-27 17:28:19,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:28:19,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:28:19,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:28:19,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:28:19,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:19" (1/1) ... [2019-12-27 17:28:19,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:19" (1/1) ... [2019-12-27 17:28:19,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:19" (1/1) ... [2019-12-27 17:28:19,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:19" (1/1) ... [2019-12-27 17:28:19,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:19" (1/1) ... [2019-12-27 17:28:19,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:19" (1/1) ... [2019-12-27 17:28:19,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:19" (1/1) ... [2019-12-27 17:28:19,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:28:19,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:28:19,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:28:19,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:28:19,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:19" (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 17:28:19,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:28:19,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:28:19,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:28:19,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:28:19,569 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:28:19,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:28:19,569 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:28:19,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:28:19,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:28:19,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:28:19,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:28:19,572 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 17:28:20,278 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:28:20,279 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:28:20,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:28:20 BoogieIcfgContainer [2019-12-27 17:28:20,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:28:20,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:28:20,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:28:20,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:28:20,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:28:18" (1/3) ... [2019-12-27 17:28:20,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34219ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:28:20, skipping insertion in model container [2019-12-27 17:28:20,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:28:19" (2/3) ... [2019-12-27 17:28:20,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34219ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:28:20, skipping insertion in model container [2019-12-27 17:28:20,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:28:20" (3/3) ... [2019-12-27 17:28:20,294 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc.i [2019-12-27 17:28:20,305 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:28:20,305 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:28:20,318 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:28:20,319 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:28:20,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,358 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,358 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,359 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,359 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,370 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,403 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,404 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,404 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,428 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,431 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:28:20,445 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:28:20,461 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:28:20,461 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:28:20,461 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:28:20,461 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:28:20,461 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:28:20,461 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:28:20,461 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:28:20,461 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:28:20,483 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 17:28:20,485 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 17:28:20,617 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 17:28:20,618 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:28:20,633 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:28:20,649 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 17:28:20,696 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 17:28:20,697 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:28:20,702 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:28:20,717 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 17:28:20,718 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:28:25,473 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 17:28:25,582 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 17:28:25,926 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74785 [2019-12-27 17:28:25,926 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 17:28:25,930 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-27 17:28:26,418 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8582 states. [2019-12-27 17:28:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states. [2019-12-27 17:28:26,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:28:26,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:26,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:28:26,427 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:26,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:26,431 INFO L82 PathProgramCache]: Analyzing trace with hash 791214, now seen corresponding path program 1 times [2019-12-27 17:28:26,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:26,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319431463] [2019-12-27 17:28:26,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:26,689 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 17:28:26,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319431463] [2019-12-27 17:28:26,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:26,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:28:26,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2062804260] [2019-12-27 17:28:26,693 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:26,698 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:26,713 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:28:26,714 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:26,717 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:28:26,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:28:26,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:26,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:28:26,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:26,736 INFO L87 Difference]: Start difference. First operand 8582 states. Second operand 3 states. [2019-12-27 17:28:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:27,111 INFO L93 Difference]: Finished difference Result 8460 states and 27514 transitions. [2019-12-27 17:28:27,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:27,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:28:27,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:27,241 INFO L225 Difference]: With dead ends: 8460 [2019-12-27 17:28:27,241 INFO L226 Difference]: Without dead ends: 7472 [2019-12-27 17:28:27,242 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 17:28:27,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-12-27 17:28:27,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-12-27 17:28:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-12-27 17:28:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 24214 transitions. [2019-12-27 17:28:27,672 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 24214 transitions. Word has length 3 [2019-12-27 17:28:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:27,672 INFO L462 AbstractCegarLoop]: Abstraction has 7472 states and 24214 transitions. [2019-12-27 17:28:27,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:28:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 24214 transitions. [2019-12-27 17:28:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:28:27,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:27,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:27,679 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:27,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:27,680 INFO L82 PathProgramCache]: Analyzing trace with hash 743461303, now seen corresponding path program 1 times [2019-12-27 17:28:27,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:27,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307771240] [2019-12-27 17:28:27,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:27,824 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 17:28:27,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307771240] [2019-12-27 17:28:27,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:27,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:27,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [953823121] [2019-12-27 17:28:27,825 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:27,827 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:27,829 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:28:27,829 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:27,830 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:28:27,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:28:27,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:27,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:28:27,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:28:27,832 INFO L87 Difference]: Start difference. First operand 7472 states and 24214 transitions. Second operand 4 states. [2019-12-27 17:28:28,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:28,250 INFO L93 Difference]: Finished difference Result 11704 states and 36249 transitions. [2019-12-27 17:28:28,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:28:28,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:28:28,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:28,330 INFO L225 Difference]: With dead ends: 11704 [2019-12-27 17:28:28,330 INFO L226 Difference]: Without dead ends: 11690 [2019-12-27 17:28:28,331 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 17:28:28,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11690 states. [2019-12-27 17:28:29,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11690 to 10458. [2019-12-27 17:28:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10458 states. [2019-12-27 17:28:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10458 states to 10458 states and 32991 transitions. [2019-12-27 17:28:29,237 INFO L78 Accepts]: Start accepts. Automaton has 10458 states and 32991 transitions. Word has length 11 [2019-12-27 17:28:29,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:29,238 INFO L462 AbstractCegarLoop]: Abstraction has 10458 states and 32991 transitions. [2019-12-27 17:28:29,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:28:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 10458 states and 32991 transitions. [2019-12-27 17:28:29,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:28:29,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:29,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:29,246 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:29,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:29,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1209900993, now seen corresponding path program 1 times [2019-12-27 17:28:29,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:29,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036090208] [2019-12-27 17:28:29,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:29,332 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 17:28:29,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036090208] [2019-12-27 17:28:29,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:29,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:28:29,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [340034015] [2019-12-27 17:28:29,335 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:29,337 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:29,341 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 17:28:29,341 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:29,341 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:28:29,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:28:29,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:29,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:28:29,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:28:29,342 INFO L87 Difference]: Start difference. First operand 10458 states and 32991 transitions. Second operand 5 states. [2019-12-27 17:28:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:29,748 INFO L93 Difference]: Finished difference Result 15000 states and 46671 transitions. [2019-12-27 17:28:29,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:28:29,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 17:28:29,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:29,806 INFO L225 Difference]: With dead ends: 15000 [2019-12-27 17:28:29,806 INFO L226 Difference]: Without dead ends: 15000 [2019-12-27 17:28:29,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:28:29,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2019-12-27 17:28:30,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 11886. [2019-12-27 17:28:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11886 states. [2019-12-27 17:28:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 37489 transitions. [2019-12-27 17:28:30,386 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 37489 transitions. Word has length 14 [2019-12-27 17:28:30,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:30,388 INFO L462 AbstractCegarLoop]: Abstraction has 11886 states and 37489 transitions. [2019-12-27 17:28:30,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:28:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 37489 transitions. [2019-12-27 17:28:30,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:28:30,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:30,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:30,393 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:30,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:30,393 INFO L82 PathProgramCache]: Analyzing trace with hash 529414606, now seen corresponding path program 1 times [2019-12-27 17:28:30,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:30,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858628096] [2019-12-27 17:28:30,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:30,488 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 17:28:30,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858628096] [2019-12-27 17:28:30,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:30,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:28:30,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1716893531] [2019-12-27 17:28:30,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:30,491 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:30,494 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 17:28:30,494 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:30,496 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:28:30,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:28:30,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:30,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:28:30,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:30,497 INFO L87 Difference]: Start difference. First operand 11886 states and 37489 transitions. Second operand 3 states. [2019-12-27 17:28:30,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:30,555 INFO L93 Difference]: Finished difference Result 11883 states and 37480 transitions. [2019-12-27 17:28:30,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:30,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 17:28:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:30,591 INFO L225 Difference]: With dead ends: 11883 [2019-12-27 17:28:30,591 INFO L226 Difference]: Without dead ends: 11883 [2019-12-27 17:28:30,592 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 17:28:30,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11883 states. [2019-12-27 17:28:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11883 to 11883. [2019-12-27 17:28:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11883 states. [2019-12-27 17:28:31,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 37480 transitions. [2019-12-27 17:28:31,092 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 37480 transitions. Word has length 16 [2019-12-27 17:28:31,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:31,093 INFO L462 AbstractCegarLoop]: Abstraction has 11883 states and 37480 transitions. [2019-12-27 17:28:31,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:28:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 37480 transitions. [2019-12-27 17:28:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:28:31,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:31,097 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 17:28:31,097 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:31,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:31,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1491434984, now seen corresponding path program 1 times [2019-12-27 17:28:31,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:31,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218425102] [2019-12-27 17:28:31,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:31,134 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 17:28:31,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218425102] [2019-12-27 17:28:31,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:31,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:31,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1275917294] [2019-12-27 17:28:31,135 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:31,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:31,140 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 17:28:31,140 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:31,140 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:28:31,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:28:31,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:31,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:28:31,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:31,142 INFO L87 Difference]: Start difference. First operand 11883 states and 37480 transitions. Second operand 3 states. [2019-12-27 17:28:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:31,228 INFO L93 Difference]: Finished difference Result 19949 states and 62561 transitions. [2019-12-27 17:28:31,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:31,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 17:28:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:31,253 INFO L225 Difference]: With dead ends: 19949 [2019-12-27 17:28:31,253 INFO L226 Difference]: Without dead ends: 11074 [2019-12-27 17:28:31,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:31,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11074 states. [2019-12-27 17:28:31,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11074 to 10421. [2019-12-27 17:28:31,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10421 states. [2019-12-27 17:28:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10421 states to 10421 states and 32037 transitions. [2019-12-27 17:28:31,521 INFO L78 Accepts]: Start accepts. Automaton has 10421 states and 32037 transitions. Word has length 17 [2019-12-27 17:28:31,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:31,522 INFO L462 AbstractCegarLoop]: Abstraction has 10421 states and 32037 transitions. [2019-12-27 17:28:31,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:28:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 10421 states and 32037 transitions. [2019-12-27 17:28:31,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:28:31,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:31,527 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 17:28:31,527 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:31,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:31,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1843431322, now seen corresponding path program 1 times [2019-12-27 17:28:31,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:31,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221525638] [2019-12-27 17:28:31,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:31,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 17:28:31,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221525638] [2019-12-27 17:28:31,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:31,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:31,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1985933698] [2019-12-27 17:28:31,589 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:31,591 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:31,594 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 32 transitions. [2019-12-27 17:28:31,594 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:31,597 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:28:31,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:28:31,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:31,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:28:31,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:31,598 INFO L87 Difference]: Start difference. First operand 10421 states and 32037 transitions. Second operand 3 states. [2019-12-27 17:28:31,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:31,650 INFO L93 Difference]: Finished difference Result 10421 states and 31528 transitions. [2019-12-27 17:28:31,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:31,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 17:28:31,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:31,671 INFO L225 Difference]: With dead ends: 10421 [2019-12-27 17:28:31,671 INFO L226 Difference]: Without dead ends: 10421 [2019-12-27 17:28:31,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 17:28:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10421 states. [2019-12-27 17:28:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10421 to 10413. [2019-12-27 17:28:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10413 states. [2019-12-27 17:28:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10413 states to 10413 states and 31512 transitions. [2019-12-27 17:28:32,436 INFO L78 Accepts]: Start accepts. Automaton has 10413 states and 31512 transitions. Word has length 17 [2019-12-27 17:28:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:32,436 INFO L462 AbstractCegarLoop]: Abstraction has 10413 states and 31512 transitions. [2019-12-27 17:28:32,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:28:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 10413 states and 31512 transitions. [2019-12-27 17:28:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:28:32,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:32,441 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 17:28:32,441 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:32,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:32,441 INFO L82 PathProgramCache]: Analyzing trace with hash 783398497, now seen corresponding path program 1 times [2019-12-27 17:28:32,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:32,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974968709] [2019-12-27 17:28:32,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:32,495 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 17:28:32,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974968709] [2019-12-27 17:28:32,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:32,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:28:32,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [918584659] [2019-12-27 17:28:32,497 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:32,499 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:32,501 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 23 transitions. [2019-12-27 17:28:32,501 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:32,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:28:32,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:28:32,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:32,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:28:32,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:28:32,503 INFO L87 Difference]: Start difference. First operand 10413 states and 31512 transitions. Second operand 4 states. [2019-12-27 17:28:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:32,532 INFO L93 Difference]: Finished difference Result 1753 states and 4291 transitions. [2019-12-27 17:28:32,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:28:32,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 17:28:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:32,535 INFO L225 Difference]: With dead ends: 1753 [2019-12-27 17:28:32,535 INFO L226 Difference]: Without dead ends: 1247 [2019-12-27 17:28:32,535 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 17:28:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2019-12-27 17:28:32,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1247. [2019-12-27 17:28:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1247 states. [2019-12-27 17:28:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 2704 transitions. [2019-12-27 17:28:32,555 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 2704 transitions. Word has length 17 [2019-12-27 17:28:32,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:32,556 INFO L462 AbstractCegarLoop]: Abstraction has 1247 states and 2704 transitions. [2019-12-27 17:28:32,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:28:32,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2704 transitions. [2019-12-27 17:28:32,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:28:32,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:32,558 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 17:28:32,558 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:32,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:32,559 INFO L82 PathProgramCache]: Analyzing trace with hash 702739982, now seen corresponding path program 1 times [2019-12-27 17:28:32,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:32,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124190714] [2019-12-27 17:28:32,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:32,654 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 17:28:32,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124190714] [2019-12-27 17:28:32,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:32,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:28:32,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1988679564] [2019-12-27 17:28:32,655 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:32,659 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:32,665 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 17:28:32,665 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:32,665 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:28:32,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:28:32,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:32,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:28:32,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:28:32,666 INFO L87 Difference]: Start difference. First operand 1247 states and 2704 transitions. Second operand 6 states. [2019-12-27 17:28:32,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:32,906 INFO L93 Difference]: Finished difference Result 1303 states and 2774 transitions. [2019-12-27 17:28:32,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:28:32,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 17:28:32,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:32,909 INFO L225 Difference]: With dead ends: 1303 [2019-12-27 17:28:32,909 INFO L226 Difference]: Without dead ends: 1252 [2019-12-27 17:28:32,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:28:32,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2019-12-27 17:28:32,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1193. [2019-12-27 17:28:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-12-27 17:28:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 2589 transitions. [2019-12-27 17:28:32,923 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 2589 transitions. Word has length 25 [2019-12-27 17:28:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:32,923 INFO L462 AbstractCegarLoop]: Abstraction has 1193 states and 2589 transitions. [2019-12-27 17:28:32,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:28:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 2589 transitions. [2019-12-27 17:28:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 17:28:32,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:32,925 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 17:28:32,925 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:32,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:32,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1134333202, now seen corresponding path program 1 times [2019-12-27 17:28:32,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:32,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134146159] [2019-12-27 17:28:32,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:33,004 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 17:28:33,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134146159] [2019-12-27 17:28:33,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:33,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:28:33,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1909166624] [2019-12-27 17:28:33,006 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:33,010 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:33,022 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 17:28:33,022 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:33,065 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:28:33,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:28:33,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:33,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:28:33,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:28:33,069 INFO L87 Difference]: Start difference. First operand 1193 states and 2589 transitions. Second operand 6 states. [2019-12-27 17:28:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:33,115 INFO L93 Difference]: Finished difference Result 634 states and 1350 transitions. [2019-12-27 17:28:33,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:28:33,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 17:28:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:33,116 INFO L225 Difference]: With dead ends: 634 [2019-12-27 17:28:33,117 INFO L226 Difference]: Without dead ends: 500 [2019-12-27 17:28:33,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 17:28:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-27 17:28:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2019-12-27 17:28:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-27 17:28:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1104 transitions. [2019-12-27 17:28:33,124 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1104 transitions. Word has length 28 [2019-12-27 17:28:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:33,125 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 1104 transitions. [2019-12-27 17:28:33,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:28:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1104 transitions. [2019-12-27 17:28:33,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:28:33,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:33,127 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 17:28:33,127 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:33,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:33,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2108814601, now seen corresponding path program 1 times [2019-12-27 17:28:33,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:33,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963777143] [2019-12-27 17:28:33,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:33,173 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 17:28:33,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963777143] [2019-12-27 17:28:33,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:33,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:28:33,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1961167119] [2019-12-27 17:28:33,175 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:33,195 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:33,264 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 184 transitions. [2019-12-27 17:28:33,264 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:33,274 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:28:33,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:28:33,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:33,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:28:33,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:33,275 INFO L87 Difference]: Start difference. First operand 500 states and 1104 transitions. Second operand 3 states. [2019-12-27 17:28:33,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:33,311 INFO L93 Difference]: Finished difference Result 752 states and 1608 transitions. [2019-12-27 17:28:33,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:33,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 17:28:33,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:33,313 INFO L225 Difference]: With dead ends: 752 [2019-12-27 17:28:33,313 INFO L226 Difference]: Without dead ends: 752 [2019-12-27 17:28:33,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:33,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-12-27 17:28:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 560. [2019-12-27 17:28:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-12-27 17:28:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1224 transitions. [2019-12-27 17:28:33,375 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1224 transitions. Word has length 52 [2019-12-27 17:28:33,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:33,376 INFO L462 AbstractCegarLoop]: Abstraction has 560 states and 1224 transitions. [2019-12-27 17:28:33,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:28:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1224 transitions. [2019-12-27 17:28:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:28:33,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:33,378 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 17:28:33,378 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:33,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:33,379 INFO L82 PathProgramCache]: Analyzing trace with hash -525709791, now seen corresponding path program 1 times [2019-12-27 17:28:33,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:33,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146837392] [2019-12-27 17:28:33,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:33,464 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 17:28:33,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146837392] [2019-12-27 17:28:33,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:33,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:28:33,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [914534032] [2019-12-27 17:28:33,465 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:33,486 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:33,571 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 184 transitions. [2019-12-27 17:28:33,571 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:33,592 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:28:33,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:28:33,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:33,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:28:33,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:28:33,594 INFO L87 Difference]: Start difference. First operand 560 states and 1224 transitions. Second operand 7 states. [2019-12-27 17:28:33,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:33,780 INFO L93 Difference]: Finished difference Result 1089 states and 2305 transitions. [2019-12-27 17:28:33,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:28:33,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 17:28:33,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:33,782 INFO L225 Difference]: With dead ends: 1089 [2019-12-27 17:28:33,782 INFO L226 Difference]: Without dead ends: 766 [2019-12-27 17:28:33,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:28:33,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-12-27 17:28:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 613. [2019-12-27 17:28:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-27 17:28:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1309 transitions. [2019-12-27 17:28:33,792 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1309 transitions. Word has length 52 [2019-12-27 17:28:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:33,792 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 1309 transitions. [2019-12-27 17:28:33,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:28:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1309 transitions. [2019-12-27 17:28:33,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:28:33,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:33,794 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 17:28:33,795 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:33,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:33,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1253874511, now seen corresponding path program 2 times [2019-12-27 17:28:33,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:33,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690342467] [2019-12-27 17:28:33,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:33,928 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 17:28:33,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690342467] [2019-12-27 17:28:33,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:33,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:28:33,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [495030738] [2019-12-27 17:28:33,929 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:33,947 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:34,007 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 110 transitions. [2019-12-27 17:28:34,008 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:34,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:28:34,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:28:34,094 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:28:34,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:28:34,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:34,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:28:34,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:28:34,095 INFO L87 Difference]: Start difference. First operand 613 states and 1309 transitions. Second operand 10 states. [2019-12-27 17:28:35,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:35,702 INFO L93 Difference]: Finished difference Result 1574 states and 3266 transitions. [2019-12-27 17:28:35,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:28:35,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-27 17:28:35,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:35,704 INFO L225 Difference]: With dead ends: 1574 [2019-12-27 17:28:35,705 INFO L226 Difference]: Without dead ends: 1550 [2019-12-27 17:28:35,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:28:35,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2019-12-27 17:28:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 971. [2019-12-27 17:28:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-12-27 17:28:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 2084 transitions. [2019-12-27 17:28:35,723 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 2084 transitions. Word has length 52 [2019-12-27 17:28:35,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:35,723 INFO L462 AbstractCegarLoop]: Abstraction has 971 states and 2084 transitions. [2019-12-27 17:28:35,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:28:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 2084 transitions. [2019-12-27 17:28:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:28:35,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:35,726 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 17:28:35,727 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:35,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:35,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1667381275, now seen corresponding path program 3 times [2019-12-27 17:28:35,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:35,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163626268] [2019-12-27 17:28:35,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:35,817 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 17:28:35,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163626268] [2019-12-27 17:28:35,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:35,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:35,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1729031516] [2019-12-27 17:28:35,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:35,837 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:35,896 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 105 transitions. [2019-12-27 17:28:35,896 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:35,897 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:28:35,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:28:35,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:35,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:28:35,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:35,898 INFO L87 Difference]: Start difference. First operand 971 states and 2084 transitions. Second operand 3 states. [2019-12-27 17:28:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:35,967 INFO L93 Difference]: Finished difference Result 1158 states and 2473 transitions. [2019-12-27 17:28:35,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:35,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 17:28:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:35,970 INFO L225 Difference]: With dead ends: 1158 [2019-12-27 17:28:35,970 INFO L226 Difference]: Without dead ends: 1158 [2019-12-27 17:28:35,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:35,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-12-27 17:28:35,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 830. [2019-12-27 17:28:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-12-27 17:28:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1787 transitions. [2019-12-27 17:28:35,987 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1787 transitions. Word has length 52 [2019-12-27 17:28:35,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:35,988 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1787 transitions. [2019-12-27 17:28:35,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:28:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1787 transitions. [2019-12-27 17:28:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:28:35,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:35,991 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 17:28:35,991 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:35,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:35,992 INFO L82 PathProgramCache]: Analyzing trace with hash -288059161, now seen corresponding path program 1 times [2019-12-27 17:28:35,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:35,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499287432] [2019-12-27 17:28:35,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:28:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:28:36,166 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:28:36,166 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:28:36,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (= v_~y~0_135 0) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1441~0.base_35| 1) |v_#valid_57|) (= v_~y$r_buff0_thd1~0_187 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1441~0.base_35| 4)) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1441~0.base_35|)) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_cnt~0_51) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1441~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1441~0.base_35|) |v_ULTIMATE.start_main_~#t1441~0.offset_27| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff0_thd2~0_327) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1441~0.base_35|) (= 0 |v_#NULL.base_3|) (= |v_ULTIMATE.start_main_~#t1441~0.offset_27| 0) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ULTIMATE.start_main_~#t1441~0.base=|v_ULTIMATE.start_main_~#t1441~0.base_35|, ~y~0=v_~y~0_135, ULTIMATE.start_main_~#t1442~0.offset=|v_ULTIMATE.start_main_~#t1442~0.offset_15|, ULTIMATE.start_main_~#t1442~0.base=|v_ULTIMATE.start_main_~#t1442~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1441~0.offset=|v_ULTIMATE.start_main_~#t1441~0.offset_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~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, ULTIMATE.start_main_~#t1441~0.base, ~y~0, ULTIMATE.start_main_~#t1442~0.offset, ULTIMATE.start_main_~#t1442~0.base, ~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_~#t1441~0.offset, 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 17:28:36,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= ~y$r_buff0_thd1~0_Out887022037 1) (= ~y$r_buff1_thd2~0_Out887022037 ~y$r_buff0_thd2~0_In887022037) (= 1 ~x~0_Out887022037) (= ~y$r_buff0_thd0~0_In887022037 ~y$r_buff1_thd0~0_Out887022037) (= ~y$r_buff0_thd1~0_In887022037 ~y$r_buff1_thd1~0_Out887022037) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In887022037))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In887022037, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In887022037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In887022037, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In887022037} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out887022037, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out887022037, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In887022037, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out887022037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In887022037, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In887022037, ~x~0=~x~0_Out887022037, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out887022037} 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 17:28:36,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1442~0.base_11|)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1442~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1442~0.base_11|) |v_ULTIMATE.start_main_~#t1442~0.offset_10| 1)) |v_#memory_int_7|) (= |v_ULTIMATE.start_main_~#t1442~0.offset_10| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1442~0.base_11| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1442~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1442~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1442~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1442~0.offset=|v_ULTIMATE.start_main_~#t1442~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t1442~0.base=|v_ULTIMATE.start_main_~#t1442~0.base_11|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1442~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1442~0.base, #length] because there is no mapped edge [2019-12-27 17:28:36,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In357605925 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In357605925 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out357605925| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out357605925| ~y$w_buff0_used~0_In357605925)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In357605925, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In357605925} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out357605925|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In357605925, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In357605925} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:28:36,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1906017924 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In-1906017924| |P1Thread1of1ForFork1_#t~ite14_Out-1906017924|) (= ~y$w_buff0~0_In-1906017924 |P1Thread1of1ForFork1_#t~ite15_Out-1906017924|) (not .cse0)) (and (= ~y$w_buff0~0_In-1906017924 |P1Thread1of1ForFork1_#t~ite14_Out-1906017924|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1906017924 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In-1906017924 256) 0) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-1906017924 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-1906017924 256) 0))) (= |P1Thread1of1ForFork1_#t~ite15_Out-1906017924| |P1Thread1of1ForFork1_#t~ite14_Out-1906017924|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1906017924, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1906017924, ~y$w_buff0~0=~y$w_buff0~0_In-1906017924, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1906017924, ~weak$$choice2~0=~weak$$choice2~0_In-1906017924, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1906017924|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1906017924} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1906017924, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1906017924, ~y$w_buff0~0=~y$w_buff0~0_In-1906017924, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1906017924, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1906017924|, ~weak$$choice2~0=~weak$$choice2~0_In-1906017924, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1906017924|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1906017924} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 17:28:36,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In317600054 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In317600054| |P1Thread1of1ForFork1_#t~ite20_Out317600054|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out317600054| ~y$w_buff0_used~0_In317600054)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out317600054| ~y$w_buff0_used~0_In317600054) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In317600054 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In317600054 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In317600054 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In317600054 256)))) .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out317600054| |P1Thread1of1ForFork1_#t~ite20_Out317600054|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In317600054, ~y$w_buff0_used~0=~y$w_buff0_used~0_In317600054, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In317600054|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In317600054, ~weak$$choice2~0=~weak$$choice2~0_In317600054, ~y$w_buff1_used~0=~y$w_buff1_used~0_In317600054} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In317600054, ~y$w_buff0_used~0=~y$w_buff0_used~0_In317600054, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out317600054|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In317600054, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out317600054|, ~weak$$choice2~0=~weak$$choice2~0_In317600054, ~y$w_buff1_used~0=~y$w_buff1_used~0_In317600054} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 17:28:36,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} 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 17:28:36,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2127245355 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In2127245355| |P1Thread1of1ForFork1_#t~ite29_Out2127245355|) (= ~y$r_buff1_thd2~0_In2127245355 |P1Thread1of1ForFork1_#t~ite30_Out2127245355|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2127245355 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In2127245355 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In2127245355 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In2127245355 256))))) (= |P1Thread1of1ForFork1_#t~ite29_Out2127245355| ~y$r_buff1_thd2~0_In2127245355) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out2127245355| |P1Thread1of1ForFork1_#t~ite30_Out2127245355|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2127245355, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In2127245355|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2127245355, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2127245355, ~weak$$choice2~0=~weak$$choice2~0_In2127245355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2127245355} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2127245355, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out2127245355|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out2127245355|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2127245355, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2127245355, ~weak$$choice2~0=~weak$$choice2~0_In2127245355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2127245355} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 17:28:36,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 17:28:36,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out-1695124696| |P1Thread1of1ForFork1_#t~ite32_Out-1695124696|)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1695124696 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1695124696 256)))) (or (and (not .cse0) .cse1 (= |P1Thread1of1ForFork1_#t~ite32_Out-1695124696| ~y$w_buff1~0_In-1695124696) (not .cse2)) (and .cse1 (or .cse2 .cse0) (= ~y~0_In-1695124696 |P1Thread1of1ForFork1_#t~ite32_Out-1695124696|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1695124696, ~y$w_buff1~0=~y$w_buff1~0_In-1695124696, ~y~0=~y~0_In-1695124696, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1695124696} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1695124696, ~y$w_buff1~0=~y$w_buff1~0_In-1695124696, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1695124696|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1695124696|, ~y~0=~y~0_In-1695124696, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1695124696} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 17:28:36,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In962739223 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In962739223 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out962739223| ~y$w_buff0_used~0_In962739223)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out962739223| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In962739223, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In962739223} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In962739223, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In962739223, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out962739223|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 17:28:36,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1513365051 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1513365051 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1513365051 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1513365051 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1513365051 |P1Thread1of1ForFork1_#t~ite35_Out1513365051|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1513365051|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1513365051, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1513365051, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1513365051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1513365051} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1513365051, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1513365051, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1513365051, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1513365051|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1513365051} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 17:28:36,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1167116941 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1167116941 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1167116941| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1167116941| ~y$r_buff0_thd2~0_In-1167116941)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1167116941, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1167116941} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1167116941, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1167116941, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1167116941|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 17:28:36,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-326099597 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-326099597 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-326099597 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-326099597 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-326099597| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite37_Out-326099597| ~y$r_buff1_thd2~0_In-326099597)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-326099597, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-326099597, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-326099597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-326099597} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-326099597, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-326099597, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-326099597, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-326099597|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-326099597} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:28:36,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_32|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} 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 17:28:36,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In1884421178 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1884421178 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In1884421178 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1884421178 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1884421178 |P0Thread1of1ForFork0_#t~ite6_Out1884421178|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1884421178|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1884421178, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1884421178, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1884421178, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1884421178} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1884421178|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1884421178, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1884421178, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1884421178, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1884421178} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:28:36,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1496089866 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1496089866 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In1496089866 ~y$r_buff0_thd1~0_Out1496089866)) (and (= 0 ~y$r_buff0_thd1~0_Out1496089866) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1496089866, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1496089866} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1496089866, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1496089866|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1496089866} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:28:36,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1001118319 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1001118319 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1001118319 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1001118319 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1001118319| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out-1001118319| ~y$r_buff1_thd1~0_In-1001118319) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1001118319, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1001118319, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1001118319, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1001118319} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1001118319, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1001118319, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1001118319|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1001118319, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1001118319} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:28:36,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} 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 17:28:36,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:28:36,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1812362112 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1812362112 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite40_Out1812362112| |ULTIMATE.start_main_#t~ite41_Out1812362112|))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1812362112| ~y$w_buff1~0_In1812362112) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite40_Out1812362112| ~y~0_In1812362112) (or .cse0 .cse2) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1812362112, ~y~0=~y~0_In1812362112, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1812362112, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1812362112} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1812362112|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1812362112|, ~y$w_buff1~0=~y$w_buff1~0_In1812362112, ~y~0=~y~0_In1812362112, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1812362112, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1812362112} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 17:28:36,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1697589894 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1697589894 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out1697589894| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1697589894 |ULTIMATE.start_main_#t~ite42_Out1697589894|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1697589894, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1697589894} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1697589894, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1697589894, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1697589894|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:28:36,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1328490459 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1328490459 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1328490459 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1328490459 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1328490459| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1328490459| ~y$w_buff1_used~0_In-1328490459)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1328490459, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1328490459, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1328490459, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1328490459} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1328490459, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1328490459, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1328490459|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1328490459, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1328490459} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 17:28:36,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1742270520 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1742270520 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1742270520|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1742270520 |ULTIMATE.start_main_#t~ite44_Out-1742270520|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1742270520, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1742270520} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1742270520, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1742270520, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1742270520|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 17:28:36,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In384260079 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In384260079 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In384260079 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In384260079 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out384260079|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In384260079 |ULTIMATE.start_main_#t~ite45_Out384260079|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In384260079, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In384260079, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In384260079, ~y$w_buff1_used~0=~y$w_buff1_used~0_In384260079} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In384260079, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In384260079, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In384260079, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out384260079|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In384260079} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 17:28:36,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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 17:28:36,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:28:36 BasicIcfg [2019-12-27 17:28:36,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:28:36,299 INFO L168 Benchmark]: Toolchain (without parser) took 17629.07 ms. Allocated memory was 137.9 MB in the beginning and 772.3 MB in the end (delta: 634.4 MB). Free memory was 99.6 MB in the beginning and 475.5 MB in the end (delta: -375.9 MB). Peak memory consumption was 258.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:36,299 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 17:28:36,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.95 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.2 MB in the beginning and 155.5 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:36,301 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.38 ms. Allocated memory is still 201.9 MB. Free memory was 155.5 MB in the beginning and 153.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:36,301 INFO L168 Benchmark]: Boogie Preprocessor took 39.61 ms. Allocated memory is still 201.9 MB. Free memory was 153.6 MB in the beginning and 150.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:36,302 INFO L168 Benchmark]: RCFGBuilder took 777.96 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 107.0 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:36,303 INFO L168 Benchmark]: TraceAbstraction took 16014.65 ms. Allocated memory was 201.9 MB in the beginning and 772.3 MB in the end (delta: 570.4 MB). Free memory was 107.0 MB in the beginning and 475.5 MB in the end (delta: -368.5 MB). Peak memory consumption was 201.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:36,306 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.25 ms. Allocated memory is still 137.9 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 724.95 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.2 MB in the beginning and 155.5 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.38 ms. Allocated memory is still 201.9 MB. Free memory was 155.5 MB in the beginning and 153.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.61 ms. Allocated memory is still 201.9 MB. Free memory was 153.6 MB in the beginning and 150.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 777.96 ms. Allocated memory is still 201.9 MB. Free memory was 150.7 MB in the beginning and 107.0 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16014.65 ms. Allocated memory was 201.9 MB in the beginning and 772.3 MB in the end (delta: 570.4 MB). Free memory was 107.0 MB in the beginning and 475.5 MB in the end (delta: -368.5 MB). Peak memory consumption was 201.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 146 ProgramPointsBefore, 75 ProgramPointsAfterwards, 180 TransitionsBefore, 85 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 28 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4902 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 236 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 74785 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] 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, 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] [L794] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L757] 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=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] [L736] 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) [L757] 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) [L758] 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)) [L759] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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 : (!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))=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=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 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)) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 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)) [L761] 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=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] [L761] 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)) [L763] 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)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 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 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 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 [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=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] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 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 [L803] 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, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1441 SDtfs, 1456 SDslu, 2999 SDs, 0 SdLazy, 1999 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 27 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11886occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 6318 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 409 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 343 ConstructedInterpolants, 0 QuantifiedInterpolants, 40871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...