/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:32:18,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:32:18,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:32:18,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:32:18,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:32:18,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:32:18,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:32:18,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:32:18,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:32:18,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:32:18,426 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:32:18,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:32:18,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:32:18,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:32:18,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:32:18,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:32:18,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:32:18,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:32:18,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:32:18,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:32:18,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:32:18,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:32:18,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:32:18,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:32:18,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:32:18,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:32:18,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:32:18,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:32:18,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:32:18,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:32:18,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:32:18,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:32:18,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:32:18,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:32:18,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:32:18,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:32:18,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:32:18,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:32:18,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:32:18,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:32:18,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:32:18,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:32:18,467 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:32:18,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:32:18,469 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:32:18,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:32:18,469 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:32:18,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:32:18,469 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:32:18,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:32:18,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:32:18,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:32:18,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:32:18,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:32:18,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:32:18,471 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:32:18,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:32:18,471 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:32:18,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:32:18,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:32:18,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:32:18,472 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:32:18,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:32:18,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:32:18,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:32:18,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:32:18,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:32:18,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:32:18,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:32:18,473 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:32:18,473 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:32:18,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:32:18,474 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:32:18,474 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:32:18,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:32:18,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:32:18,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:32:18,814 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:32:18,816 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:32:18,817 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i [2019-12-27 20:32:18,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1440fb68/162f92ef992e43bfb1e9a35e08886f52/FLAG9c39d18cc [2019-12-27 20:32:19,394 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:32:19,395 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_rmo.opt.i [2019-12-27 20:32:19,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1440fb68/162f92ef992e43bfb1e9a35e08886f52/FLAG9c39d18cc [2019-12-27 20:32:19,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1440fb68/162f92ef992e43bfb1e9a35e08886f52 [2019-12-27 20:32:19,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:32:19,752 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:32:19,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:32:19,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:32:19,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:32:19,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:32:19" (1/1) ... [2019-12-27 20:32:19,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:32:19, skipping insertion in model container [2019-12-27 20:32:19,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:32:19" (1/1) ... [2019-12-27 20:32:19,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:32:19,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:32:20,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:32:20,362 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:32:20,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:32:20,503 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:32:20,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:32:20 WrapperNode [2019-12-27 20:32:20,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:32:20,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:32:20,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:32:20,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:32:20,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:32:20" (1/1) ... [2019-12-27 20:32:20,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:32:20" (1/1) ... [2019-12-27 20:32:20,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:32:20,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:32:20,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:32:20,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:32:20,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:32:20" (1/1) ... [2019-12-27 20:32:20,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:32:20" (1/1) ... [2019-12-27 20:32:20,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:32:20" (1/1) ... [2019-12-27 20:32:20,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:32:20" (1/1) ... [2019-12-27 20:32:20,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:32:20" (1/1) ... [2019-12-27 20:32:20,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:32:20" (1/1) ... [2019-12-27 20:32:20,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:32:20" (1/1) ... [2019-12-27 20:32:20,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:32:20,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:32:20,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:32:20,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:32:20,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:32:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:32:20,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:32:20,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:32:20,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:32:20,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:32:20,737 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:32:20,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:32:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:32:20,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:32:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:32:20,740 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:32:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:32:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:32:20,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:32:20,742 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:32:21,670 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:32:21,671 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:32:21,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:32:21 BoogieIcfgContainer [2019-12-27 20:32:21,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:32:21,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:32:21,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:32:21,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:32:21,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:32:19" (1/3) ... [2019-12-27 20:32:21,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f3aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:32:21, skipping insertion in model container [2019-12-27 20:32:21,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:32:20" (2/3) ... [2019-12-27 20:32:21,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f3aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:32:21, skipping insertion in model container [2019-12-27 20:32:21,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:32:21" (3/3) ... [2019-12-27 20:32:21,687 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_rmo.opt.i [2019-12-27 20:32:21,698 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:32:21,699 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:32:21,707 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:32:21,708 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:32:21,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,749 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,750 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,774 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,774 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,775 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,775 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,776 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,799 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,799 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,809 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,810 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,816 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,816 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,817 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,823 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,823 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:32:21,843 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:32:21,861 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:32:21,862 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:32:21,862 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:32:21,862 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:32:21,862 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:32:21,862 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:32:21,862 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:32:21,862 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:32:21,880 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-27 20:32:21,882 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 20:32:21,982 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 20:32:21,983 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:32:21,999 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 20:32:22,025 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 20:32:22,079 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 20:32:22,079 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:32:22,087 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 20:32:22,107 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 20:32:22,108 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:32:25,900 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 20:32:26,033 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 20:32:26,054 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75401 [2019-12-27 20:32:26,055 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 20:32:26,058 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-27 20:32:36,414 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-27 20:32:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-27 20:32:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 20:32:36,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:36,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 20:32:36,423 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:36,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:36,429 INFO L82 PathProgramCache]: Analyzing trace with hash 802091485, now seen corresponding path program 1 times [2019-12-27 20:32:36,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:36,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299119998] [2019-12-27 20:32:36,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:36,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299119998] [2019-12-27 20:32:36,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:36,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:32:36,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [518158093] [2019-12-27 20:32:36,681 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:36,688 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:36,701 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 20:32:36,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:36,706 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:36,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:32:36,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:36,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:32:36,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:32:36,725 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-27 20:32:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:39,668 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-27 20:32:39,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:32:39,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 20:32:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:40,264 INFO L225 Difference]: With dead ends: 81762 [2019-12-27 20:32:40,264 INFO L226 Difference]: Without dead ends: 77082 [2019-12-27 20:32:40,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:32:44,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-27 20:32:46,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-27 20:32:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-27 20:32:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-27 20:32:49,749 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-27 20:32:49,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:49,749 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-27 20:32:49,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:32:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-27 20:32:49,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:32:49,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:49,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:49,758 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:49,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:49,759 INFO L82 PathProgramCache]: Analyzing trace with hash 786856193, now seen corresponding path program 1 times [2019-12-27 20:32:49,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:49,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250220554] [2019-12-27 20:32:49,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:49,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250220554] [2019-12-27 20:32:49,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:49,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:32:49,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1993215257] [2019-12-27 20:32:49,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:49,835 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:49,839 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:32:49,840 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:49,840 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:49,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:32:49,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:49,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:32:49,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:32:49,842 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-27 20:32:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:50,357 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-27 20:32:50,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:32:50,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:32:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:50,435 INFO L225 Difference]: With dead ends: 20478 [2019-12-27 20:32:50,436 INFO L226 Difference]: Without dead ends: 20478 [2019-12-27 20:32:50,437 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 20:32:50,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-27 20:32:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-27 20:32:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-27 20:32:50,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-27 20:32:50,967 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-27 20:32:50,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:50,968 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-27 20:32:50,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:32:50,968 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-27 20:32:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:32:50,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:50,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:50,970 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:50,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:50,971 INFO L82 PathProgramCache]: Analyzing trace with hash 721716162, now seen corresponding path program 1 times [2019-12-27 20:32:50,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:50,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359322641] [2019-12-27 20:32:50,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:51,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359322641] [2019-12-27 20:32:51,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:51,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:32:51,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114937612] [2019-12-27 20:32:51,049 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:51,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:51,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:32:51,053 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:51,053 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:51,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:32:51,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:51,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:32:51,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:32:51,054 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-27 20:32:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:51,414 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-27 20:32:51,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:32:51,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 20:32:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:51,527 INFO L225 Difference]: With dead ends: 30802 [2019-12-27 20:32:51,527 INFO L226 Difference]: Without dead ends: 30788 [2019-12-27 20:32:51,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:52,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-27 20:32:52,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-27 20:32:52,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-27 20:32:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-27 20:32:52,844 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-27 20:32:52,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:52,845 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-27 20:32:52,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:32:52,845 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-27 20:32:52,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:32:52,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:52,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:52,848 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:52,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:52,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1406835797, now seen corresponding path program 1 times [2019-12-27 20:32:52,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:52,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980741032] [2019-12-27 20:32:52,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:52,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980741032] [2019-12-27 20:32:52,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:52,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:32:52,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [483472470] [2019-12-27 20:32:52,925 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:52,929 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:52,934 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:32:52,934 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:52,984 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:32:52,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:32:52,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:52,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:32:52,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:52,986 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 5 states. [2019-12-27 20:32:53,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:53,401 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-27 20:32:53,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:32:53,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:32:53,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:53,492 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 20:32:53,492 INFO L226 Difference]: Without dead ends: 35512 [2019-12-27 20:32:53,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:32:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-27 20:32:54,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-27 20:32:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-27 20:32:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-27 20:32:54,504 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-27 20:32:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:54,505 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-27 20:32:54,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:32:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-27 20:32:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:32:54,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:54,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:54,508 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:54,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:54,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1406985682, now seen corresponding path program 1 times [2019-12-27 20:32:54,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:54,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026767201] [2019-12-27 20:32:54,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:54,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026767201] [2019-12-27 20:32:54,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:54,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:32:54,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [51622898] [2019-12-27 20:32:54,588 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:54,590 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:54,594 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:32:54,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:54,611 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:32:54,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:32:54,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:54,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:32:54,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:54,612 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 5 states. [2019-12-27 20:32:54,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:54,982 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-27 20:32:54,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:32:54,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:32:54,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:55,156 INFO L225 Difference]: With dead ends: 38443 [2019-12-27 20:32:55,156 INFO L226 Difference]: Without dead ends: 38432 [2019-12-27 20:32:55,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:32:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-27 20:32:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-27 20:32:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-27 20:32:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-27 20:32:56,114 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-27 20:32:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:56,115 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-27 20:32:56,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:32:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-27 20:32:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:32:56,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:56,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:56,126 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:56,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:56,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1124752400, now seen corresponding path program 1 times [2019-12-27 20:32:56,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:56,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475013412] [2019-12-27 20:32:56,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:56,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475013412] [2019-12-27 20:32:56,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:56,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:32:56,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [603890841] [2019-12-27 20:32:56,240 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:56,244 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:56,249 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 26 transitions. [2019-12-27 20:32:56,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:56,249 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:56,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:32:56,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:56,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:32:56,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:56,250 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-27 20:32:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:56,832 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-27 20:32:56,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:32:56,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 20:32:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:56,946 INFO L225 Difference]: With dead ends: 45281 [2019-12-27 20:32:56,946 INFO L226 Difference]: Without dead ends: 45258 [2019-12-27 20:32:56,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:32:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-27 20:32:57,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-27 20:32:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-27 20:32:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-27 20:32:57,942 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-27 20:32:57,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:57,942 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-27 20:32:57,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:32:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-27 20:32:57,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:32:57,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:57,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:57,953 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:57,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:57,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1124902285, now seen corresponding path program 1 times [2019-12-27 20:32:57,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:57,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995229109] [2019-12-27 20:32:57,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:58,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995229109] [2019-12-27 20:32:58,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:58,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:32:58,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [598325395] [2019-12-27 20:32:58,062 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:58,066 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:58,072 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 26 transitions. [2019-12-27 20:32:58,072 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:58,073 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:58,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:32:58,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:58,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:32:58,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:32:58,074 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-27 20:32:58,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:58,666 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-27 20:32:58,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:32:58,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 20:32:58,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:58,765 INFO L225 Difference]: With dead ends: 46044 [2019-12-27 20:32:58,766 INFO L226 Difference]: Without dead ends: 46021 [2019-12-27 20:32:58,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:32:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-27 20:32:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-27 20:32:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-27 20:32:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-27 20:32:59,718 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-27 20:32:59,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:32:59,718 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-27 20:32:59,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:32:59,718 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-27 20:32:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:32:59,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:32:59,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:32:59,730 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:32:59,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:32:59,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1835763287, now seen corresponding path program 1 times [2019-12-27 20:32:59,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:32:59,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572832719] [2019-12-27 20:32:59,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:32:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:32:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:32:59,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572832719] [2019-12-27 20:32:59,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:32:59,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:32:59,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1220715142] [2019-12-27 20:32:59,781 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:32:59,785 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:32:59,790 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:32:59,790 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:32:59,790 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:32:59,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:32:59,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:32:59,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:32:59,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:32:59,792 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-27 20:32:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:32:59,864 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-27 20:32:59,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:32:59,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 20:32:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:32:59,888 INFO L225 Difference]: With dead ends: 11657 [2019-12-27 20:32:59,888 INFO L226 Difference]: Without dead ends: 11657 [2019-12-27 20:32:59,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:32:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-27 20:33:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-27 20:33:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-27 20:33:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-27 20:33:00,075 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-27 20:33:00,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:00,075 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-27 20:33:00,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:33:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-27 20:33:00,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 20:33:00,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:00,091 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:00,091 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:00,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:00,091 INFO L82 PathProgramCache]: Analyzing trace with hash -786800782, now seen corresponding path program 1 times [2019-12-27 20:33:00,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:00,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416802188] [2019-12-27 20:33:00,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:00,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416802188] [2019-12-27 20:33:00,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:00,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:33:00,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [836453868] [2019-12-27 20:33:00,168 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:00,177 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:00,202 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 100 transitions. [2019-12-27 20:33:00,202 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:00,204 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:33:00,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:33:00,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:00,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:33:00,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:33:00,205 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-27 20:33:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:00,249 INFO L93 Difference]: Finished difference Result 11488 states and 35391 transitions. [2019-12-27 20:33:00,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:33:00,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 20:33:00,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:00,268 INFO L225 Difference]: With dead ends: 11488 [2019-12-27 20:33:00,268 INFO L226 Difference]: Without dead ends: 11488 [2019-12-27 20:33:00,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:33:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11488 states. [2019-12-27 20:33:00,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11488 to 11488. [2019-12-27 20:33:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11488 states. [2019-12-27 20:33:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11488 states to 11488 states and 35391 transitions. [2019-12-27 20:33:00,430 INFO L78 Accepts]: Start accepts. Automaton has 11488 states and 35391 transitions. Word has length 39 [2019-12-27 20:33:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:00,430 INFO L462 AbstractCegarLoop]: Abstraction has 11488 states and 35391 transitions. [2019-12-27 20:33:00,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:33:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 11488 states and 35391 transitions. [2019-12-27 20:33:00,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 20:33:00,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:00,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:00,447 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:00,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:00,447 INFO L82 PathProgramCache]: Analyzing trace with hash -153890988, now seen corresponding path program 1 times [2019-12-27 20:33:00,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:00,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149366051] [2019-12-27 20:33:00,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:00,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149366051] [2019-12-27 20:33:00,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:00,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:33:00,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2044731304] [2019-12-27 20:33:00,522 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:00,643 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:00,693 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 104 states and 166 transitions. [2019-12-27 20:33:00,694 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:00,698 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:33:00,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:33:00,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:00,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:33:00,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:33:00,699 INFO L87 Difference]: Start difference. First operand 11488 states and 35391 transitions. Second operand 5 states. [2019-12-27 20:33:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:00,788 INFO L93 Difference]: Finished difference Result 10239 states and 32168 transitions. [2019-12-27 20:33:00,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:33:00,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 20:33:00,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:00,812 INFO L225 Difference]: With dead ends: 10239 [2019-12-27 20:33:00,812 INFO L226 Difference]: Without dead ends: 10239 [2019-12-27 20:33:00,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:33:00,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10239 states. [2019-12-27 20:33:01,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10239 to 9735. [2019-12-27 20:33:01,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9735 states. [2019-12-27 20:33:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9735 states to 9735 states and 30758 transitions. [2019-12-27 20:33:01,039 INFO L78 Accepts]: Start accepts. Automaton has 9735 states and 30758 transitions. Word has length 40 [2019-12-27 20:33:01,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:01,039 INFO L462 AbstractCegarLoop]: Abstraction has 9735 states and 30758 transitions. [2019-12-27 20:33:01,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:33:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 9735 states and 30758 transitions. [2019-12-27 20:33:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:33:01,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:01,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:01,061 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:01,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:01,062 INFO L82 PathProgramCache]: Analyzing trace with hash 766293347, now seen corresponding path program 1 times [2019-12-27 20:33:01,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:01,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664827173] [2019-12-27 20:33:01,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:01,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:01,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664827173] [2019-12-27 20:33:01,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:01,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:33:01,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2121971825] [2019-12-27 20:33:01,145 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:01,162 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:01,298 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 296 transitions. [2019-12-27 20:33:01,298 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:01,321 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:33:01,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:33:01,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:01,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:33:01,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:33:01,322 INFO L87 Difference]: Start difference. First operand 9735 states and 30758 transitions. Second operand 3 states. [2019-12-27 20:33:01,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:01,393 INFO L93 Difference]: Finished difference Result 12683 states and 39352 transitions. [2019-12-27 20:33:01,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:33:01,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 20:33:01,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:01,411 INFO L225 Difference]: With dead ends: 12683 [2019-12-27 20:33:01,411 INFO L226 Difference]: Without dead ends: 12683 [2019-12-27 20:33:01,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 20:33:01,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12683 states. [2019-12-27 20:33:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12683 to 10393. [2019-12-27 20:33:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2019-12-27 20:33:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 32688 transitions. [2019-12-27 20:33:01,579 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 32688 transitions. Word has length 54 [2019-12-27 20:33:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:01,580 INFO L462 AbstractCegarLoop]: Abstraction has 10393 states and 32688 transitions. [2019-12-27 20:33:01,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:33:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 32688 transitions. [2019-12-27 20:33:01,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:33:01,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:01,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:01,596 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:01,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:01,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2104708736, now seen corresponding path program 1 times [2019-12-27 20:33:01,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:01,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740596339] [2019-12-27 20:33:01,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:01,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740596339] [2019-12-27 20:33:01,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:01,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:33:01,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1484883231] [2019-12-27 20:33:01,725 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:01,741 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:01,997 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 296 transitions. [2019-12-27 20:33:01,997 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:02,045 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 20:33:02,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:33:02,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:02,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:33:02,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:33:02,047 INFO L87 Difference]: Start difference. First operand 10393 states and 32688 transitions. Second operand 8 states. [2019-12-27 20:33:03,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:03,543 INFO L93 Difference]: Finished difference Result 39523 states and 122432 transitions. [2019-12-27 20:33:03,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 20:33:03,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 20:33:03,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:03,591 INFO L225 Difference]: With dead ends: 39523 [2019-12-27 20:33:03,591 INFO L226 Difference]: Without dead ends: 31264 [2019-12-27 20:33:03,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:33:03,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31264 states. [2019-12-27 20:33:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31264 to 13189. [2019-12-27 20:33:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13189 states. [2019-12-27 20:33:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13189 states to 13189 states and 41908 transitions. [2019-12-27 20:33:03,928 INFO L78 Accepts]: Start accepts. Automaton has 13189 states and 41908 transitions. Word has length 54 [2019-12-27 20:33:03,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:03,928 INFO L462 AbstractCegarLoop]: Abstraction has 13189 states and 41908 transitions. [2019-12-27 20:33:03,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:33:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 13189 states and 41908 transitions. [2019-12-27 20:33:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:33:03,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:03,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:03,947 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:03,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:03,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1580720394, now seen corresponding path program 2 times [2019-12-27 20:33:03,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:03,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625784606] [2019-12-27 20:33:03,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:04,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625784606] [2019-12-27 20:33:04,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:04,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:33:04,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [270764629] [2019-12-27 20:33:04,035 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:04,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:04,216 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 333 transitions. [2019-12-27 20:33:04,217 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:04,429 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:33:04,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:33:04,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:04,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:33:04,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:33:04,432 INFO L87 Difference]: Start difference. First operand 13189 states and 41908 transitions. Second operand 7 states. [2019-12-27 20:33:04,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:04,826 INFO L93 Difference]: Finished difference Result 34316 states and 106692 transitions. [2019-12-27 20:33:04,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:33:04,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 20:33:04,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:04,866 INFO L225 Difference]: With dead ends: 34316 [2019-12-27 20:33:04,866 INFO L226 Difference]: Without dead ends: 25449 [2019-12-27 20:33:04,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:33:04,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25449 states. [2019-12-27 20:33:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25449 to 17200. [2019-12-27 20:33:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17200 states. [2019-12-27 20:33:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17200 states to 17200 states and 54622 transitions. [2019-12-27 20:33:05,196 INFO L78 Accepts]: Start accepts. Automaton has 17200 states and 54622 transitions. Word has length 54 [2019-12-27 20:33:05,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:05,196 INFO L462 AbstractCegarLoop]: Abstraction has 17200 states and 54622 transitions. [2019-12-27 20:33:05,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:33:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 17200 states and 54622 transitions. [2019-12-27 20:33:05,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:33:05,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:05,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:05,217 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:05,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:05,217 INFO L82 PathProgramCache]: Analyzing trace with hash 714355520, now seen corresponding path program 3 times [2019-12-27 20:33:05,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:05,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451246024] [2019-12-27 20:33:05,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:05,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451246024] [2019-12-27 20:33:05,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:05,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:33:05,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [600729607] [2019-12-27 20:33:05,349 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:05,365 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:05,522 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 350 transitions. [2019-12-27 20:33:05,523 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:05,678 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 20:33:05,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:33:05,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:05,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:33:05,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:33:05,679 INFO L87 Difference]: Start difference. First operand 17200 states and 54622 transitions. Second operand 9 states. [2019-12-27 20:33:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:07,539 INFO L93 Difference]: Finished difference Result 89167 states and 277833 transitions. [2019-12-27 20:33:07,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 20:33:07,539 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 20:33:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:07,713 INFO L225 Difference]: With dead ends: 89167 [2019-12-27 20:33:07,714 INFO L226 Difference]: Without dead ends: 76971 [2019-12-27 20:33:07,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 34 SyntacticMatches, 13 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 20:33:07,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76971 states. [2019-12-27 20:33:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76971 to 23213. [2019-12-27 20:33:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23213 states. [2019-12-27 20:33:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23213 states to 23213 states and 74466 transitions. [2019-12-27 20:33:08,570 INFO L78 Accepts]: Start accepts. Automaton has 23213 states and 74466 transitions. Word has length 54 [2019-12-27 20:33:08,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:08,570 INFO L462 AbstractCegarLoop]: Abstraction has 23213 states and 74466 transitions. [2019-12-27 20:33:08,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:33:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 23213 states and 74466 transitions. [2019-12-27 20:33:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:33:08,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:08,605 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:08,605 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:08,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:08,605 INFO L82 PathProgramCache]: Analyzing trace with hash 265762130, now seen corresponding path program 4 times [2019-12-27 20:33:08,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:08,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155350269] [2019-12-27 20:33:08,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:08,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155350269] [2019-12-27 20:33:08,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:08,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:33:08,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1492307744] [2019-12-27 20:33:08,718 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:08,754 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:09,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 361 transitions. [2019-12-27 20:33:09,177 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:09,459 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 20:33:09,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:33:09,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:09,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:33:09,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:33:09,460 INFO L87 Difference]: Start difference. First operand 23213 states and 74466 transitions. Second operand 11 states. [2019-12-27 20:33:12,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:12,490 INFO L93 Difference]: Finished difference Result 83337 states and 259975 transitions. [2019-12-27 20:33:12,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 20:33:12,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 20:33:12,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:12,621 INFO L225 Difference]: With dead ends: 83337 [2019-12-27 20:33:12,621 INFO L226 Difference]: Without dead ends: 80157 [2019-12-27 20:33:12,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 32 SyntacticMatches, 16 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=689, Invalid=2851, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 20:33:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80157 states. [2019-12-27 20:33:13,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80157 to 22741. [2019-12-27 20:33:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22741 states. [2019-12-27 20:33:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22741 states to 22741 states and 73038 transitions. [2019-12-27 20:33:13,747 INFO L78 Accepts]: Start accepts. Automaton has 22741 states and 73038 transitions. Word has length 54 [2019-12-27 20:33:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:13,747 INFO L462 AbstractCegarLoop]: Abstraction has 22741 states and 73038 transitions. [2019-12-27 20:33:13,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:33:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 22741 states and 73038 transitions. [2019-12-27 20:33:13,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:33:13,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:13,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:13,790 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:13,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:13,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2030886808, now seen corresponding path program 5 times [2019-12-27 20:33:13,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:13,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790662965] [2019-12-27 20:33:13,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:13,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790662965] [2019-12-27 20:33:13,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:13,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:33:13,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [126716905] [2019-12-27 20:33:13,964 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:13,976 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:14,091 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 284 transitions. [2019-12-27 20:33:14,091 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:14,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:33:14,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 20:33:14,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:33:14,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:14,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:33:14,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:33:14,268 INFO L87 Difference]: Start difference. First operand 22741 states and 73038 transitions. Second operand 14 states. [2019-12-27 20:33:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:18,405 INFO L93 Difference]: Finished difference Result 55208 states and 166544 transitions. [2019-12-27 20:33:18,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 20:33:18,406 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 20:33:18,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:18,485 INFO L225 Difference]: With dead ends: 55208 [2019-12-27 20:33:18,485 INFO L226 Difference]: Without dead ends: 54925 [2019-12-27 20:33:18,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=466, Invalid=1886, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 20:33:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54925 states. [2019-12-27 20:33:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54925 to 28615. [2019-12-27 20:33:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28615 states. [2019-12-27 20:33:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28615 states to 28615 states and 89753 transitions. [2019-12-27 20:33:19,211 INFO L78 Accepts]: Start accepts. Automaton has 28615 states and 89753 transitions. Word has length 54 [2019-12-27 20:33:19,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:19,212 INFO L462 AbstractCegarLoop]: Abstraction has 28615 states and 89753 transitions. [2019-12-27 20:33:19,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:33:19,212 INFO L276 IsEmpty]: Start isEmpty. Operand 28615 states and 89753 transitions. [2019-12-27 20:33:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 20:33:19,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:19,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:19,244 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:19,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:19,244 INFO L82 PathProgramCache]: Analyzing trace with hash -623567340, now seen corresponding path program 6 times [2019-12-27 20:33:19,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:19,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482919924] [2019-12-27 20:33:19,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:19,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482919924] [2019-12-27 20:33:19,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:19,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:33:19,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1416438668] [2019-12-27 20:33:19,306 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:19,322 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:19,460 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 303 transitions. [2019-12-27 20:33:19,460 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:19,460 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:33:19,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:33:19,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:19,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:33:19,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:33:19,461 INFO L87 Difference]: Start difference. First operand 28615 states and 89753 transitions. Second operand 3 states. [2019-12-27 20:33:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:19,556 INFO L93 Difference]: Finished difference Result 28613 states and 89748 transitions. [2019-12-27 20:33:19,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:33:19,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 20:33:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:19,601 INFO L225 Difference]: With dead ends: 28613 [2019-12-27 20:33:19,601 INFO L226 Difference]: Without dead ends: 28613 [2019-12-27 20:33:19,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:33:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28613 states. [2019-12-27 20:33:20,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28613 to 24873. [2019-12-27 20:33:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24873 states. [2019-12-27 20:33:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24873 states to 24873 states and 78858 transitions. [2019-12-27 20:33:20,238 INFO L78 Accepts]: Start accepts. Automaton has 24873 states and 78858 transitions. Word has length 54 [2019-12-27 20:33:20,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:20,238 INFO L462 AbstractCegarLoop]: Abstraction has 24873 states and 78858 transitions. [2019-12-27 20:33:20,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:33:20,238 INFO L276 IsEmpty]: Start isEmpty. Operand 24873 states and 78858 transitions. [2019-12-27 20:33:20,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 20:33:20,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:20,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:20,282 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:20,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:20,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1896131244, now seen corresponding path program 1 times [2019-12-27 20:33:20,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:20,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738027816] [2019-12-27 20:33:20,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:20,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738027816] [2019-12-27 20:33:20,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:20,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:33:20,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [517787292] [2019-12-27 20:33:20,343 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:20,362 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:20,535 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 182 states and 285 transitions. [2019-12-27 20:33:20,535 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:20,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:33:20,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:33:20,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:20,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:33:20,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:33:20,545 INFO L87 Difference]: Start difference. First operand 24873 states and 78858 transitions. Second operand 4 states. [2019-12-27 20:33:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:20,791 INFO L93 Difference]: Finished difference Result 27582 states and 85468 transitions. [2019-12-27 20:33:20,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:33:20,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-27 20:33:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:20,832 INFO L225 Difference]: With dead ends: 27582 [2019-12-27 20:33:20,833 INFO L226 Difference]: Without dead ends: 27582 [2019-12-27 20:33:20,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:33:20,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27582 states. [2019-12-27 20:33:21,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27582 to 20064. [2019-12-27 20:33:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20064 states. [2019-12-27 20:33:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20064 states to 20064 states and 62623 transitions. [2019-12-27 20:33:21,180 INFO L78 Accepts]: Start accepts. Automaton has 20064 states and 62623 transitions. Word has length 55 [2019-12-27 20:33:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:21,180 INFO L462 AbstractCegarLoop]: Abstraction has 20064 states and 62623 transitions. [2019-12-27 20:33:21,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:33:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand 20064 states and 62623 transitions. [2019-12-27 20:33:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:33:21,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:21,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:21,204 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:21,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:21,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1578077188, now seen corresponding path program 1 times [2019-12-27 20:33:21,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:21,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363170978] [2019-12-27 20:33:21,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:21,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363170978] [2019-12-27 20:33:21,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:21,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:33:21,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1656600767] [2019-12-27 20:33:21,319 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:21,334 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:21,652 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 281 transitions. [2019-12-27 20:33:21,653 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:21,694 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:33:21,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:33:21,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:21,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:33:21,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:33:21,695 INFO L87 Difference]: Start difference. First operand 20064 states and 62623 transitions. Second operand 9 states. [2019-12-27 20:33:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:22,930 INFO L93 Difference]: Finished difference Result 32374 states and 100142 transitions. [2019-12-27 20:33:22,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 20:33:22,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-27 20:33:22,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:22,970 INFO L225 Difference]: With dead ends: 32374 [2019-12-27 20:33:22,971 INFO L226 Difference]: Without dead ends: 26270 [2019-12-27 20:33:22,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 20:33:23,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26270 states. [2019-12-27 20:33:23,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26270 to 20633. [2019-12-27 20:33:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20633 states. [2019-12-27 20:33:23,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20633 states to 20633 states and 64044 transitions. [2019-12-27 20:33:23,331 INFO L78 Accepts]: Start accepts. Automaton has 20633 states and 64044 transitions. Word has length 56 [2019-12-27 20:33:23,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:23,331 INFO L462 AbstractCegarLoop]: Abstraction has 20633 states and 64044 transitions. [2019-12-27 20:33:23,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:33:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 20633 states and 64044 transitions. [2019-12-27 20:33:23,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:33:23,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:23,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:23,355 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:23,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:23,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1760958284, now seen corresponding path program 2 times [2019-12-27 20:33:23,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:23,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920425674] [2019-12-27 20:33:23,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:23,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920425674] [2019-12-27 20:33:23,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:23,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 20:33:23,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [314679922] [2019-12-27 20:33:23,671 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:23,686 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:23,898 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 454 transitions. [2019-12-27 20:33:23,898 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:23,969 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:33:23,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:33:23,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:23,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:33:23,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:33:23,970 INFO L87 Difference]: Start difference. First operand 20633 states and 64044 transitions. Second operand 14 states. [2019-12-27 20:33:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:27,324 INFO L93 Difference]: Finished difference Result 30340 states and 92838 transitions. [2019-12-27 20:33:27,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 20:33:27,324 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-27 20:33:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:27,365 INFO L225 Difference]: With dead ends: 30340 [2019-12-27 20:33:27,366 INFO L226 Difference]: Without dead ends: 28050 [2019-12-27 20:33:27,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=287, Invalid=1353, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 20:33:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28050 states. [2019-12-27 20:33:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28050 to 21100. [2019-12-27 20:33:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21100 states. [2019-12-27 20:33:27,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21100 states to 21100 states and 65285 transitions. [2019-12-27 20:33:27,717 INFO L78 Accepts]: Start accepts. Automaton has 21100 states and 65285 transitions. Word has length 56 [2019-12-27 20:33:27,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:27,717 INFO L462 AbstractCegarLoop]: Abstraction has 21100 states and 65285 transitions. [2019-12-27 20:33:27,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:33:27,718 INFO L276 IsEmpty]: Start isEmpty. Operand 21100 states and 65285 transitions. [2019-12-27 20:33:27,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:33:27,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:27,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:27,742 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:27,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:27,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1830147234, now seen corresponding path program 3 times [2019-12-27 20:33:27,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:27,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671707504] [2019-12-27 20:33:27,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:28,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671707504] [2019-12-27 20:33:28,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:28,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 20:33:28,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1792701066] [2019-12-27 20:33:28,294 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:28,306 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:28,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 357 transitions. [2019-12-27 20:33:28,495 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:28,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 20:33:28,747 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 20:33:28,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 20:33:28,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:28,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 20:33:28,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:33:28,748 INFO L87 Difference]: Start difference. First operand 21100 states and 65285 transitions. Second operand 18 states. [2019-12-27 20:33:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:32,431 INFO L93 Difference]: Finished difference Result 32000 states and 97496 transitions. [2019-12-27 20:33:32,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 20:33:32,431 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-27 20:33:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:32,477 INFO L225 Difference]: With dead ends: 32000 [2019-12-27 20:33:32,477 INFO L226 Difference]: Without dead ends: 31170 [2019-12-27 20:33:32,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=491, Invalid=2371, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 20:33:32,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31170 states. [2019-12-27 20:33:32,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31170 to 21408. [2019-12-27 20:33:32,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21408 states. [2019-12-27 20:33:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21408 states to 21408 states and 66173 transitions. [2019-12-27 20:33:32,856 INFO L78 Accepts]: Start accepts. Automaton has 21408 states and 66173 transitions. Word has length 56 [2019-12-27 20:33:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:32,856 INFO L462 AbstractCegarLoop]: Abstraction has 21408 states and 66173 transitions. [2019-12-27 20:33:32,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 20:33:32,857 INFO L276 IsEmpty]: Start isEmpty. Operand 21408 states and 66173 transitions. [2019-12-27 20:33:32,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:33:32,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:32,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:32,879 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:32,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:32,879 INFO L82 PathProgramCache]: Analyzing trace with hash 943954388, now seen corresponding path program 4 times [2019-12-27 20:33:32,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:32,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452930743] [2019-12-27 20:33:32,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:33,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452930743] [2019-12-27 20:33:33,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:33,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 20:33:33,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [771209180] [2019-12-27 20:33:33,591 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:33,605 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:33,831 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 361 transitions. [2019-12-27 20:33:33,832 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:34,113 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 20:33:34,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 20:33:34,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:34,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 20:33:34,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:33:34,114 INFO L87 Difference]: Start difference. First operand 21408 states and 66173 transitions. Second operand 18 states. [2019-12-27 20:33:40,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:40,264 INFO L93 Difference]: Finished difference Result 40186 states and 122152 transitions. [2019-12-27 20:33:40,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-27 20:33:40,265 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-27 20:33:40,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:40,321 INFO L225 Difference]: With dead ends: 40186 [2019-12-27 20:33:40,321 INFO L226 Difference]: Without dead ends: 37287 [2019-12-27 20:33:40,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 14 SyntacticMatches, 17 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1606 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=746, Invalid=4224, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 20:33:40,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37287 states. [2019-12-27 20:33:40,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37287 to 22184. [2019-12-27 20:33:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22184 states. [2019-12-27 20:33:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22184 states to 22184 states and 68493 transitions. [2019-12-27 20:33:40,751 INFO L78 Accepts]: Start accepts. Automaton has 22184 states and 68493 transitions. Word has length 56 [2019-12-27 20:33:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:40,751 INFO L462 AbstractCegarLoop]: Abstraction has 22184 states and 68493 transitions. [2019-12-27 20:33:40,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 20:33:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 22184 states and 68493 transitions. [2019-12-27 20:33:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:33:40,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:40,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:40,774 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:40,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:40,774 INFO L82 PathProgramCache]: Analyzing trace with hash 230149148, now seen corresponding path program 5 times [2019-12-27 20:33:40,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:40,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65692444] [2019-12-27 20:33:40,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:33:41,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65692444] [2019-12-27 20:33:41,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:41,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 20:33:41,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [728507780] [2019-12-27 20:33:41,293 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:41,303 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:41,410 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 305 transitions. [2019-12-27 20:33:41,410 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:41,755 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 20:33:41,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 20:33:41,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:41,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 20:33:41,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-12-27 20:33:41,756 INFO L87 Difference]: Start difference. First operand 22184 states and 68493 transitions. Second operand 20 states. [2019-12-27 20:33:42,717 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-12-27 20:33:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:33:49,581 INFO L93 Difference]: Finished difference Result 54995 states and 166726 transitions. [2019-12-27 20:33:49,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-12-27 20:33:49,582 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-27 20:33:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:33:49,664 INFO L225 Difference]: With dead ends: 54995 [2019-12-27 20:33:49,665 INFO L226 Difference]: Without dead ends: 51970 [2019-12-27 20:33:49,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 15 SyntacticMatches, 16 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4398 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1581, Invalid=10191, Unknown=0, NotChecked=0, Total=11772 [2019-12-27 20:33:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51970 states. [2019-12-27 20:33:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51970 to 22299. [2019-12-27 20:33:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22299 states. [2019-12-27 20:33:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22299 states to 22299 states and 69104 transitions. [2019-12-27 20:33:50,444 INFO L78 Accepts]: Start accepts. Automaton has 22299 states and 69104 transitions. Word has length 56 [2019-12-27 20:33:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:33:50,444 INFO L462 AbstractCegarLoop]: Abstraction has 22299 states and 69104 transitions. [2019-12-27 20:33:50,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 20:33:50,444 INFO L276 IsEmpty]: Start isEmpty. Operand 22299 states and 69104 transitions. [2019-12-27 20:33:50,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:33:50,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:33:50,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:33:50,471 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:33:50,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:33:50,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2135959138, now seen corresponding path program 6 times [2019-12-27 20:33:50,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:33:50,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744101316] [2019-12-27 20:33:50,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:33:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:33:50,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 20:33:50,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744101316] [2019-12-27 20:33:50,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:33:50,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 20:33:50,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1564258482] [2019-12-27 20:33:50,824 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:33:50,831 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:33:50,948 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 250 transitions. [2019-12-27 20:33:50,948 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:33:51,109 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 20:33:51,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 20:33:51,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:33:51,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 20:33:51,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:33:51,111 INFO L87 Difference]: Start difference. First operand 22299 states and 69104 transitions. Second operand 17 states. [2019-12-27 20:33:58,255 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-12-27 20:34:05,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:34:05,071 INFO L93 Difference]: Finished difference Result 75052 states and 227876 transitions. [2019-12-27 20:34:05,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-12-27 20:34:05,072 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-27 20:34:05,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:34:05,157 INFO L225 Difference]: With dead ends: 75052 [2019-12-27 20:34:05,157 INFO L226 Difference]: Without dead ends: 53789 [2019-12-27 20:34:05,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 13 SyntacticMatches, 11 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8001 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2476, Invalid=18404, Unknown=0, NotChecked=0, Total=20880 [2019-12-27 20:34:05,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53789 states. [2019-12-27 20:34:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53789 to 21959. [2019-12-27 20:34:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21959 states. [2019-12-27 20:34:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21959 states to 21959 states and 68126 transitions. [2019-12-27 20:34:05,971 INFO L78 Accepts]: Start accepts. Automaton has 21959 states and 68126 transitions. Word has length 56 [2019-12-27 20:34:05,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:34:05,972 INFO L462 AbstractCegarLoop]: Abstraction has 21959 states and 68126 transitions. [2019-12-27 20:34:05,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 20:34:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 21959 states and 68126 transitions. [2019-12-27 20:34:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:34:05,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:34:05,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:34:05,999 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:34:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:34:05,999 INFO L82 PathProgramCache]: Analyzing trace with hash -301888144, now seen corresponding path program 7 times [2019-12-27 20:34:06,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:34:06,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647037802] [2019-12-27 20:34:06,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:34:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:34:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:34:06,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647037802] [2019-12-27 20:34:06,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:34:06,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:34:06,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1803076334] [2019-12-27 20:34:06,168 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:34:06,178 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:34:06,325 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 288 transitions. [2019-12-27 20:34:06,325 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:34:06,452 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 20:34:06,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 20:34:06,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:34:06,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 20:34:06,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:34:06,453 INFO L87 Difference]: Start difference. First operand 21959 states and 68126 transitions. Second operand 14 states. [2019-12-27 20:34:10,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:34:10,104 INFO L93 Difference]: Finished difference Result 45375 states and 139454 transitions. [2019-12-27 20:34:10,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-27 20:34:10,105 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-27 20:34:10,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:34:10,166 INFO L225 Difference]: With dead ends: 45375 [2019-12-27 20:34:10,166 INFO L226 Difference]: Without dead ends: 39091 [2019-12-27 20:34:10,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=610, Invalid=2930, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 20:34:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39091 states. [2019-12-27 20:34:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39091 to 20142. [2019-12-27 20:34:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20142 states. [2019-12-27 20:34:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20142 states to 20142 states and 62440 transitions. [2019-12-27 20:34:10,603 INFO L78 Accepts]: Start accepts. Automaton has 20142 states and 62440 transitions. Word has length 56 [2019-12-27 20:34:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:34:10,603 INFO L462 AbstractCegarLoop]: Abstraction has 20142 states and 62440 transitions. [2019-12-27 20:34:10,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 20:34:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 20142 states and 62440 transitions. [2019-12-27 20:34:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 20:34:10,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:34:10,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:34:10,623 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:34:10,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:34:10,624 INFO L82 PathProgramCache]: Analyzing trace with hash -826863496, now seen corresponding path program 8 times [2019-12-27 20:34:10,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:34:10,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327057621] [2019-12-27 20:34:10,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:34:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:34:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:34:10,732 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:34:10,732 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:34:10,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd1~0_41) (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_17) (= |v_ULTIMATE.start_main_~#t648~0.offset_13| 0) (= v_~main$tmp_guard1~0_16 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t648~0.base_16| 4)) (= 0 v_~y$r_buff1_thd0~0_20) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= v_~y$r_buff0_thd2~0_24 0) (= |v_#NULL.offset_3| 0) (= v_~y$r_buff0_thd1~0_68 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$w_buff0~0_28) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~y$flush_delayed~0_14) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t648~0.base_16|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t648~0.base_16| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t648~0.base_16|) |v_ULTIMATE.start_main_~#t648~0.offset_13| 0)) |v_#memory_int_17|) (= v_~y$read_delayed~0_6 0) (= v_~z~0_15 0) (= v_~y$mem_tmp~0_11 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~a~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_15) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t648~0.base_16|)) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t648~0.base_16| 1)) (= 0 v_~y$r_buff1_thd2~0_17) (= 0 |v_#NULL.base_3|) (= 0 v_~__unbuffered_cnt~0_22) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= v_~__unbuffered_p0_EBX~0_14 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t648~0.offset=|v_ULTIMATE.start_main_~#t648~0.offset_13|, ULTIMATE.start_main_~#t650~0.base=|v_ULTIMATE.start_main_~#t650~0.base_19|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_10, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_68, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_14, ULTIMATE.start_main_~#t650~0.offset=|v_ULTIMATE.start_main_~#t650~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_9, ~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_108, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_~#t648~0.base=|v_ULTIMATE.start_main_~#t648~0.base_16|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_28, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ULTIMATE.start_main_~#t649~0.offset=|v_ULTIMATE.start_main_~#t649~0.offset_15|, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t649~0.base=|v_ULTIMATE.start_main_~#t649~0.base_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t648~0.offset, ULTIMATE.start_main_~#t650~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t650~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t648~0.base, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t649~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t649~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:34:10,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L831-1-->L833: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t649~0.base_11| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t649~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t649~0.base_11|) |v_ULTIMATE.start_main_~#t649~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t649~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t649~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t649~0.offset_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t649~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t649~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t649~0.base=|v_ULTIMATE.start_main_~#t649~0.base_11|, ULTIMATE.start_main_~#t649~0.offset=|v_ULTIMATE.start_main_~#t649~0.offset_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t649~0.base, ULTIMATE.start_main_~#t649~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 20:34:10,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out118544973| P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out118544973) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out118544973| 1) (= ~y$w_buff1~0_Out118544973 ~y$w_buff0~0_In118544973) (= P1Thread1of1ForFork1_~arg.base_Out118544973 |P1Thread1of1ForFork1_#in~arg.base_In118544973|) (= ~y$w_buff1_used~0_Out118544973 ~y$w_buff0_used~0_In118544973) (= ~y$w_buff0~0_Out118544973 1) (= P1Thread1of1ForFork1_~arg.offset_Out118544973 |P1Thread1of1ForFork1_#in~arg.offset_In118544973|) (= (mod ~y$w_buff1_used~0_Out118544973 256) 0) (= ~y$w_buff0_used~0_Out118544973 1)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In118544973, ~y$w_buff0~0=~y$w_buff0~0_In118544973, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In118544973|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In118544973|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out118544973, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out118544973, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out118544973, ~y$w_buff1~0=~y$w_buff1~0_Out118544973, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out118544973|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out118544973, ~y$w_buff0~0=~y$w_buff0~0_Out118544973, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In118544973|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In118544973|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out118544973} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:34:10,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t650~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t650~0.base_11|) |v_ULTIMATE.start_main_~#t650~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t650~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t650~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t650~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t650~0.base_11| 0)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t650~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t650~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t650~0.base=|v_ULTIMATE.start_main_~#t650~0.base_11|, ULTIMATE.start_main_~#t650~0.offset=|v_ULTIMATE.start_main_~#t650~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t650~0.base, ULTIMATE.start_main_~#t650~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 20:34:10,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite32_Out2142731348| |P2Thread1of1ForFork2_#t~ite33_Out2142731348|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2142731348 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In2142731348 256) 0))) (or (and .cse0 (not .cse1) (= |P2Thread1of1ForFork2_#t~ite32_Out2142731348| ~y$w_buff1~0_In2142731348) (not .cse2)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite32_Out2142731348| ~y~0_In2142731348) (or .cse2 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2142731348, ~y$w_buff1~0=~y$w_buff1~0_In2142731348, ~y~0=~y~0_In2142731348, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2142731348} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2142731348, ~y$w_buff1~0=~y$w_buff1~0_In2142731348, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out2142731348|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out2142731348|, ~y~0=~y~0_In2142731348, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2142731348} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 20:34:10,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-903400443 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-903400443 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-903400443| ~y$w_buff0_used~0_In-903400443)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out-903400443| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-903400443, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-903400443} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-903400443, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-903400443, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-903400443|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 20:34:10,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1797834993 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1797834993 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite34_Out-1797834993|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1797834993 |P2Thread1of1ForFork2_#t~ite34_Out-1797834993|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1797834993, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1797834993} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-1797834993|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1797834993, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1797834993} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-27 20:34:10,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In659804590 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In659804590 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In659804590 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In659804590 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite35_Out659804590| ~y$w_buff1_used~0_In659804590)) (and (= |P2Thread1of1ForFork2_#t~ite35_Out659804590| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In659804590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In659804590, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In659804590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In659804590} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out659804590|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In659804590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In659804590, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In659804590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In659804590} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-27 20:34:10,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In799977259 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In799977259 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite36_Out799977259| ~y$r_buff0_thd3~0_In799977259) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite36_Out799977259| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In799977259, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In799977259} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out799977259|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In799977259, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In799977259} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 20:34:10,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In209984160 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In209984160 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In209984160 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In209984160 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite37_Out209984160|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite37_Out209984160| ~y$r_buff1_thd3~0_In209984160)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In209984160, ~y$w_buff0_used~0=~y$w_buff0_used~0_In209984160, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In209984160, ~y$w_buff1_used~0=~y$w_buff1_used~0_In209984160} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out209984160|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In209984160, ~y$w_buff0_used~0=~y$w_buff0_used~0_In209984160, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In209984160, ~y$w_buff1_used~0=~y$w_buff1_used~0_In209984160} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-27 20:34:10,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite37_8| v_~y$r_buff1_thd3~0_14)) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 20:34:10,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1874210468 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1874210468 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1874210468 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1874210468 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite29_Out-1874210468| ~y$w_buff1_used~0_In-1874210468) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-1874210468|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1874210468, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1874210468, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1874210468, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1874210468} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1874210468, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1874210468|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1874210468, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1874210468, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1874210468} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 20:34:10,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1250841883 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1250841883 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd2~0_Out1250841883 0)) (and (= ~y$r_buff0_thd2~0_In1250841883 ~y$r_buff0_thd2~0_Out1250841883) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1250841883, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1250841883} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1250841883|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1250841883, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1250841883} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 20:34:10,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1582493654 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1582493654 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1582493654 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1582493654 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-1582493654 |P1Thread1of1ForFork1_#t~ite31_Out-1582493654|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite31_Out-1582493654| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1582493654, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1582493654, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1582493654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1582493654} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1582493654, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1582493654, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1582493654|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1582493654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1582493654} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 20:34:10,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite31_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 20:34:10,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L750-->L750-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In568914544 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite9_Out568914544| ~y$w_buff0~0_In568914544) (= |P0Thread1of1ForFork0_#t~ite8_In568914544| |P0Thread1of1ForFork0_#t~ite8_Out568914544|)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out568914544| ~y$w_buff0~0_In568914544) (= |P0Thread1of1ForFork0_#t~ite9_Out568914544| |P0Thread1of1ForFork0_#t~ite8_Out568914544|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In568914544 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd1~0_In568914544 256) 0)) (and (= 0 (mod ~y$w_buff1_used~0_In568914544 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In568914544 256)))) .cse0))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In568914544, ~y$w_buff0_used~0=~y$w_buff0_used~0_In568914544, ~y$w_buff0~0=~y$w_buff0~0_In568914544, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In568914544, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In568914544|, ~weak$$choice2~0=~weak$$choice2~0_In568914544, ~y$w_buff1_used~0=~y$w_buff1_used~0_In568914544} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In568914544, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out568914544|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In568914544, ~y$w_buff0~0=~y$w_buff0~0_In568914544, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out568914544|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In568914544, ~weak$$choice2~0=~weak$$choice2~0_In568914544, ~y$w_buff1_used~0=~y$w_buff1_used~0_In568914544} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:34:10,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L751-->L751-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In669843499 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite11_Out669843499| ~y$w_buff1~0_In669843499) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In669843499 256)))) (or (= (mod ~y$w_buff0_used~0_In669843499 256) 0) (and (= 0 (mod ~y$r_buff1_thd1~0_In669843499 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In669843499 256)) .cse1))) (= |P0Thread1of1ForFork0_#t~ite12_Out669843499| |P0Thread1of1ForFork0_#t~ite11_Out669843499|)) (and (= |P0Thread1of1ForFork0_#t~ite11_In669843499| |P0Thread1of1ForFork0_#t~ite11_Out669843499|) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite12_Out669843499| ~y$w_buff1~0_In669843499)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In669843499|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In669843499, ~y$w_buff1~0=~y$w_buff1~0_In669843499, ~y$w_buff0_used~0=~y$w_buff0_used~0_In669843499, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In669843499, ~weak$$choice2~0=~weak$$choice2~0_In669843499, ~y$w_buff1_used~0=~y$w_buff1_used~0_In669843499} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out669843499|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In669843499, ~y$w_buff1~0=~y$w_buff1~0_In669843499, ~y$w_buff0_used~0=~y$w_buff0_used~0_In669843499, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In669843499, ~weak$$choice2~0=~weak$$choice2~0_In669843499, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out669843499|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In669843499} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 20:34:10,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L754-->L755: Formula: (and (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff0_thd1~0_50) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_8|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_10|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 20:34:10,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L755-->L755-8: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1996382760 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1996382760 256) 0)) (.cse4 (= 0 (mod ~y$r_buff1_thd1~0_In-1996382760 256))) (.cse6 (= (mod ~y$r_buff0_thd1~0_In-1996382760 256) 0)) (.cse3 (= |P0Thread1of1ForFork0_#t~ite24_Out-1996382760| |P0Thread1of1ForFork0_#t~ite23_Out-1996382760|)) (.cse5 (= 0 (mod ~weak$$choice2~0_In-1996382760 256)))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (not .cse2) .cse3 (or (not .cse4) .cse1) (= |P0Thread1of1ForFork0_#t~ite23_Out-1996382760| |P0Thread1of1ForFork0_#t~ite22_Out-1996382760|) .cse5 (= 0 |P0Thread1of1ForFork0_#t~ite22_Out-1996382760|))) (and (or (and (or (and .cse0 .cse6) .cse2 (and .cse4 .cse6)) .cse3 (= ~y$r_buff1_thd1~0_In-1996382760 |P0Thread1of1ForFork0_#t~ite23_Out-1996382760|) .cse5) (and (= |P0Thread1of1ForFork0_#t~ite23_In-1996382760| |P0Thread1of1ForFork0_#t~ite23_Out-1996382760|) (= ~y$r_buff1_thd1~0_In-1996382760 |P0Thread1of1ForFork0_#t~ite24_Out-1996382760|) (not .cse5))) (= |P0Thread1of1ForFork0_#t~ite22_In-1996382760| |P0Thread1of1ForFork0_#t~ite22_Out-1996382760|)))) InVars {P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_In-1996382760|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1996382760, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1996382760, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1996382760, ~weak$$choice2~0=~weak$$choice2~0_In-1996382760, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1996382760, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-1996382760|} OutVars{P0Thread1of1ForFork0_#t~ite22=|P0Thread1of1ForFork0_#t~ite22_Out-1996382760|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1996382760, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1996382760, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1996382760, ~weak$$choice2~0=~weak$$choice2~0_In-1996382760, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-1996382760|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-1996382760|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1996382760} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-27 20:34:10,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= v_~y~0_17 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 20:34:10,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_12) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:34:10,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-943892592 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-943892592 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-943892592| ~y$w_buff1~0_In-943892592) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-943892592 |ULTIMATE.start_main_#t~ite41_Out-943892592|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-943892592, ~y~0=~y~0_In-943892592, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-943892592, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-943892592} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-943892592|, ~y$w_buff1~0=~y$w_buff1~0_In-943892592, ~y~0=~y~0_In-943892592, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-943892592, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-943892592} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 20:34:10,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:34:10,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1943775266 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1943775266 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1943775266| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1943775266 |ULTIMATE.start_main_#t~ite43_Out-1943775266|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1943775266, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1943775266} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1943775266, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1943775266, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1943775266|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:34:10,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In38826019 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In38826019 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In38826019 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In38826019 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out38826019| ~y$w_buff1_used~0_In38826019)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out38826019| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In38826019, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In38826019, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In38826019, ~y$w_buff1_used~0=~y$w_buff1_used~0_In38826019} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In38826019, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In38826019, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In38826019, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out38826019|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In38826019} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:34:10,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1711323007 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1711323007 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1711323007| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1711323007| ~y$r_buff0_thd0~0_In-1711323007) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1711323007, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1711323007} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1711323007, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1711323007, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1711323007|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:34:10,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1920849776 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1920849776 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1920849776 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1920849776 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out1920849776| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In1920849776 |ULTIMATE.start_main_#t~ite46_Out1920849776|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1920849776, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1920849776, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1920849776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1920849776} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1920849776, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1920849776, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1920849776|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1920849776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1920849776} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 20:34:10,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~z~0_10 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EBX~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite46_13| v_~y$r_buff1_thd0~0_14) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_8 2) (= v_~__unbuffered_p0_EAX~0_8 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:34:10,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:34:10 BasicIcfg [2019-12-27 20:34:10,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:34:10,840 INFO L168 Benchmark]: Toolchain (without parser) took 111088.21 ms. Allocated memory was 144.2 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 101.5 MB in the beginning and 368.9 MB in the end (delta: -267.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 20:34:10,840 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 20:34:10,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.40 ms. Allocated memory was 144.2 MB in the beginning and 202.9 MB in the end (delta: 58.7 MB). Free memory was 101.1 MB in the beginning and 156.4 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:34:10,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.16 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:34:10,842 INFO L168 Benchmark]: Boogie Preprocessor took 84.60 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:34:10,843 INFO L168 Benchmark]: RCFGBuilder took 1022.10 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 104.4 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-12-27 20:34:10,844 INFO L168 Benchmark]: TraceAbstraction took 109162.26 ms. Allocated memory was 202.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 103.7 MB in the beginning and 368.9 MB in the end (delta: -265.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 20:34:10,852 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.22 ms. Allocated memory is still 144.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 751.40 ms. Allocated memory was 144.2 MB in the beginning and 202.9 MB in the end (delta: 58.7 MB). Free memory was 101.1 MB in the beginning and 156.4 MB in the end (delta: -55.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.16 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.60 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1022.10 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 104.4 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109162.26 ms. Allocated memory was 202.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 103.7 MB in the beginning and 368.9 MB in the end (delta: -265.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 28 ChoiceCompositions, 6412 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75401 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t648, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L833] FCALL, FORK 0 pthread_create(&t649, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L785] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L835] FCALL, FORK 0 pthread_create(&t650, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L785] 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) [L808] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 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 [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L841] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 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 [L844] 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 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.8s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 59.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6513 SDtfs, 12190 SDslu, 30239 SDs, 0 SdLazy, 34530 SolverSat, 1079 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1053 GetRequests, 228 SyntacticMatches, 123 SemanticMatches, 702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18748 ImplicationChecksByTransitivity, 18.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 339811 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1088 NumberOfCodeBlocks, 1088 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1007 ConstructedInterpolants, 0 QuantifiedInterpolants, 234559 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...