/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:54:29,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:54:29,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:54:29,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:54:29,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:54:29,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:54:29,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:54:29,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:54:29,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:54:29,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:54:29,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:54:29,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:54:29,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:54:29,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:54:29,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:54:29,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:54:29,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:54:29,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:54:29,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:54:29,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:54:29,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:54:29,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:54:29,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:54:29,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:54:29,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:54:29,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:54:29,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:54:29,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:54:29,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:54:29,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:54:29,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:54:29,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:54:29,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:54:29,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:54:29,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:54:29,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:54:29,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:54:29,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:54:29,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:54:29,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:54:29,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:54:29,692 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:54:29,716 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:54:29,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:54:29,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:54:29,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:54:29,719 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:54:29,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:54:29,719 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:54:29,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:54:29,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:54:29,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:54:29,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:54:29,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:54:29,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:54:29,722 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:54:29,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:54:29,722 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:54:29,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:54:29,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:54:29,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:54:29,723 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:54:29,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:54:29,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:54:29,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:54:29,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:54:29,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:54:29,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:54:29,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:54:29,725 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:54:29,725 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:54:29,725 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:54:29,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:54:30,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:54:30,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:54:30,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:54:30,035 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:54:30,035 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:54:30,036 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.opt.i [2019-12-27 16:54:30,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d1adb3b/f5f2198146d647fd80593db91fa5e7c8/FLAG2631880e5 [2019-12-27 16:54:30,644 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:54:30,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.opt.i [2019-12-27 16:54:30,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d1adb3b/f5f2198146d647fd80593db91fa5e7c8/FLAG2631880e5 [2019-12-27 16:54:30,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8d1adb3b/f5f2198146d647fd80593db91fa5e7c8 [2019-12-27 16:54:30,978 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:54:30,984 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:54:30,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:54:30,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:54:30,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:54:30,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:54:30" (1/1) ... [2019-12-27 16:54:30,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e211ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:30, skipping insertion in model container [2019-12-27 16:54:30,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:54:30" (1/1) ... [2019-12-27 16:54:31,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:54:31,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:54:31,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:54:31,636 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:54:31,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:54:31,803 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:54:31,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:31 WrapperNode [2019-12-27 16:54:31,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:54:31,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:54:31,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:54:31,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:54:31,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:31" (1/1) ... [2019-12-27 16:54:31,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:31" (1/1) ... [2019-12-27 16:54:31,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:54:31,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:54:31,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:54:31,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:54:31,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:31" (1/1) ... [2019-12-27 16:54:31,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:31" (1/1) ... [2019-12-27 16:54:31,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:31" (1/1) ... [2019-12-27 16:54:31,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:31" (1/1) ... [2019-12-27 16:54:31,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:31" (1/1) ... [2019-12-27 16:54:31,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:31" (1/1) ... [2019-12-27 16:54:31,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:31" (1/1) ... [2019-12-27 16:54:31,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:54:31,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:54:31,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:54:31,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:54:31,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:31" (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 16:54:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:54:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:54:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:54:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:54:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:54:31,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:54:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:54:31,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:54:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:54:31,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:54:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 16:54:32,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 16:54:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:54:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:54:32,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:54:32,002 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 16:54:32,728 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:54:32,728 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:54:32,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:54:32 BoogieIcfgContainer [2019-12-27 16:54:32,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:54:32,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:54:32,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:54:32,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:54:32,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:54:30" (1/3) ... [2019-12-27 16:54:32,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71006f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:54:32, skipping insertion in model container [2019-12-27 16:54:32,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:54:31" (2/3) ... [2019-12-27 16:54:32,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71006f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:54:32, skipping insertion in model container [2019-12-27 16:54:32,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:54:32" (3/3) ... [2019-12-27 16:54:32,739 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_tso.opt.i [2019-12-27 16:54:32,749 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:54:32,749 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:54:32,760 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:54:32,761 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:54:32,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,806 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,806 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,809 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,810 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,814 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,814 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,846 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,847 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,847 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,847 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,848 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,848 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,866 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,869 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,869 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,872 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,875 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,875 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,881 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,882 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,887 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,889 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,891 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,893 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:54:32,909 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 16:54:32,930 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:54:32,930 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:54:32,930 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:54:32,930 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:54:32,931 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:54:32,931 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:54:32,931 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:54:32,931 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:54:32,954 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-27 16:54:32,956 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 16:54:33,070 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 16:54:33,070 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:54:33,085 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 16:54:33,109 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 16:54:33,176 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 16:54:33,177 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:54:33,186 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 16:54:33,200 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 16:54:33,201 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:54:38,244 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 16:54:38,353 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 16:54:38,875 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 16:54:39,040 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 16:54:39,058 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-27 16:54:39,059 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-27 16:54:39,063 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-27 16:54:40,277 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-27 16:54:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-27 16:54:40,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 16:54:40,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:54:40,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:54:40,287 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:54:40,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:54:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-27 16:54:40,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:54:40,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096110831] [2019-12-27 16:54:40,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:54:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:54:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:54:40,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096110831] [2019-12-27 16:54:40,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:54:40,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:54:40,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [642561994] [2019-12-27 16:54:40,635 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:54:40,647 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:54:40,667 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 16:54:40,668 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:54:40,672 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:54:40,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:54:40,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:54:40,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:54:40,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:54:40,691 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-27 16:54:41,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:54:41,185 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-27 16:54:41,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:54:41,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 16:54:41,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:54:41,422 INFO L225 Difference]: With dead ends: 20958 [2019-12-27 16:54:41,422 INFO L226 Difference]: Without dead ends: 19662 [2019-12-27 16:54:41,423 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 16:54:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-27 16:54:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-27 16:54:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-27 16:54:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-27 16:54:43,400 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-27 16:54:43,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:54:43,401 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-27 16:54:43,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:54:43,402 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-27 16:54:43,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:54:43,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:54:43,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:54:43,415 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:54:43,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:54:43,416 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-27 16:54:43,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:54:43,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857976549] [2019-12-27 16:54:43,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:54:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:54:43,564 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 16:54:43,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857976549] [2019-12-27 16:54:43,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:54:43,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:54:43,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [342997576] [2019-12-27 16:54:43,565 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:54:43,568 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:54:43,574 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:54:43,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:54:43,574 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:54:43,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:54:43,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:54:43,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:54:43,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:54:43,576 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-27 16:54:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:54:44,178 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-27 16:54:44,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:54:44,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 16:54:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:54:44,329 INFO L225 Difference]: With dead ends: 30494 [2019-12-27 16:54:44,330 INFO L226 Difference]: Without dead ends: 30438 [2019-12-27 16:54:44,332 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 16:54:44,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-27 16:54:46,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-27 16:54:46,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-27 16:54:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-27 16:54:46,806 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-27 16:54:46,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:54:46,806 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-27 16:54:46,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:54:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-27 16:54:46,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 16:54:46,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:54:46,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:54:46,821 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:54:46,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:54:46,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-27 16:54:46,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:54:46,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800119204] [2019-12-27 16:54:46,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:54:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:54:46,929 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 16:54:46,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800119204] [2019-12-27 16:54:46,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:54:46,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:54:46,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [807094746] [2019-12-27 16:54:46,930 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:54:46,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:54:46,940 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 16:54:46,940 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:54:46,984 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:54:46,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:54:46,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:54:46,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:54:46,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:54:46,985 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 5 states. [2019-12-27 16:54:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:54:47,380 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-27 16:54:47,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:54:47,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 16:54:47,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:54:47,544 INFO L225 Difference]: With dead ends: 35230 [2019-12-27 16:54:47,544 INFO L226 Difference]: Without dead ends: 35182 [2019-12-27 16:54:47,545 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 16:54:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-27 16:54:48,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-27 16:54:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-27 16:54:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-27 16:54:48,991 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-27 16:54:48,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:54:48,991 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-27 16:54:48,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:54:48,992 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-27 16:54:49,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 16:54:49,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:54:49,003 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] [2019-12-27 16:54:49,004 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:54:49,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:54:49,004 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-27 16:54:49,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:54:49,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112509124] [2019-12-27 16:54:49,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:54:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:54:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:54:49,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112509124] [2019-12-27 16:54:49,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:54:49,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:54:49,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1714609981] [2019-12-27 16:54:49,051 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:54:49,058 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:54:49,062 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 22 transitions. [2019-12-27 16:54:49,062 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:54:49,063 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:54:49,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:54:49,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:54:49,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:54:49,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:54:49,064 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-27 16:54:50,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:54:50,591 INFO L93 Difference]: Finished difference Result 29747 states and 123892 transitions. [2019-12-27 16:54:50,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:54:50,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 16:54:50,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:54:50,727 INFO L225 Difference]: With dead ends: 29747 [2019-12-27 16:54:50,727 INFO L226 Difference]: Without dead ends: 29747 [2019-12-27 16:54:50,728 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 16:54:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29747 states. [2019-12-27 16:54:51,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29747 to 29747. [2019-12-27 16:54:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29747 states. [2019-12-27 16:54:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29747 states to 29747 states and 123892 transitions. [2019-12-27 16:54:51,779 INFO L78 Accepts]: Start accepts. Automaton has 29747 states and 123892 transitions. Word has length 20 [2019-12-27 16:54:51,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:54:51,780 INFO L462 AbstractCegarLoop]: Abstraction has 29747 states and 123892 transitions. [2019-12-27 16:54:51,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:54:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 29747 states and 123892 transitions. [2019-12-27 16:54:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 16:54:51,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:54:51,793 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] [2019-12-27 16:54:51,794 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:54:51,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:54:51,794 INFO L82 PathProgramCache]: Analyzing trace with hash -129088173, now seen corresponding path program 1 times [2019-12-27 16:54:51,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:54:51,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543601100] [2019-12-27 16:54:51,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:54:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:54:51,840 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 16:54:51,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543601100] [2019-12-27 16:54:51,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:54:51,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:54:51,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1781286213] [2019-12-27 16:54:51,841 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:54:51,844 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:54:51,848 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 16:54:51,849 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:54:51,849 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:54:51,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:54:51,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:54:51,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:54:51,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:54:51,850 INFO L87 Difference]: Start difference. First operand 29747 states and 123892 transitions. Second operand 3 states. [2019-12-27 16:54:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:54:52,035 INFO L93 Difference]: Finished difference Result 36709 states and 144810 transitions. [2019-12-27 16:54:52,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:54:52,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 16:54:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:54:52,122 INFO L225 Difference]: With dead ends: 36709 [2019-12-27 16:54:52,122 INFO L226 Difference]: Without dead ends: 30167 [2019-12-27 16:54:52,123 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 16:54:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30167 states. [2019-12-27 16:54:53,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30167 to 29499. [2019-12-27 16:54:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29499 states. [2019-12-27 16:54:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29499 states to 29499 states and 115623 transitions. [2019-12-27 16:54:53,102 INFO L78 Accepts]: Start accepts. Automaton has 29499 states and 115623 transitions. Word has length 21 [2019-12-27 16:54:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:54:53,103 INFO L462 AbstractCegarLoop]: Abstraction has 29499 states and 115623 transitions. [2019-12-27 16:54:53,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:54:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 29499 states and 115623 transitions. [2019-12-27 16:54:53,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 16:54:53,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:54:53,117 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] [2019-12-27 16:54:53,117 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:54:53,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:54:53,117 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-27 16:54:53,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:54:53,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295284201] [2019-12-27 16:54:53,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:54:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:54:53,165 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 16:54:53,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295284201] [2019-12-27 16:54:53,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:54:53,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:54:53,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1813450941] [2019-12-27 16:54:53,166 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:54:53,172 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:54:53,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 33 transitions. [2019-12-27 16:54:53,177 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:54:53,178 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:54:53,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:54:53,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:54:53,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:54:53,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:54:53,179 INFO L87 Difference]: Start difference. First operand 29499 states and 115623 transitions. Second operand 3 states. [2019-12-27 16:54:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:54:53,322 INFO L93 Difference]: Finished difference Result 29289 states and 114842 transitions. [2019-12-27 16:54:53,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:54:53,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 16:54:53,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:54:53,387 INFO L225 Difference]: With dead ends: 29289 [2019-12-27 16:54:53,388 INFO L226 Difference]: Without dead ends: 29289 [2019-12-27 16:54:53,388 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 16:54:53,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29289 states. [2019-12-27 16:54:54,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29289 to 29205. [2019-12-27 16:54:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29205 states. [2019-12-27 16:54:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29205 states to 29205 states and 114644 transitions. [2019-12-27 16:54:54,229 INFO L78 Accepts]: Start accepts. Automaton has 29205 states and 114644 transitions. Word has length 21 [2019-12-27 16:54:54,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:54:54,230 INFO L462 AbstractCegarLoop]: Abstraction has 29205 states and 114644 transitions. [2019-12-27 16:54:54,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:54:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 29205 states and 114644 transitions. [2019-12-27 16:54:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:54:54,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:54:54,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] [2019-12-27 16:54:54,244 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:54:54,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:54:54,245 INFO L82 PathProgramCache]: Analyzing trace with hash 291958640, now seen corresponding path program 1 times [2019-12-27 16:54:54,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:54:54,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379347748] [2019-12-27 16:54:54,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:54:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:54:54,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 16:54:54,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379347748] [2019-12-27 16:54:54,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:54:54,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:54:54,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [688692074] [2019-12-27 16:54:54,320 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:54:54,324 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:54:54,330 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 46 transitions. [2019-12-27 16:54:54,330 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:54:54,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:54:54,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:54:54,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:54:54,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:54:54,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:54:54,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:54:54,383 INFO L87 Difference]: Start difference. First operand 29205 states and 114644 transitions. Second operand 8 states. [2019-12-27 16:54:54,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:54:54,848 INFO L93 Difference]: Finished difference Result 18548 states and 60086 transitions. [2019-12-27 16:54:54,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 16:54:54,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 16:54:54,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:54:54,874 INFO L225 Difference]: With dead ends: 18548 [2019-12-27 16:54:54,874 INFO L226 Difference]: Without dead ends: 16576 [2019-12-27 16:54:54,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:54:54,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16576 states. [2019-12-27 16:54:55,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16576 to 10855. [2019-12-27 16:54:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10855 states. [2019-12-27 16:54:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10855 states to 10855 states and 34345 transitions. [2019-12-27 16:54:55,295 INFO L78 Accepts]: Start accepts. Automaton has 10855 states and 34345 transitions. Word has length 22 [2019-12-27 16:54:55,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:54:55,296 INFO L462 AbstractCegarLoop]: Abstraction has 10855 states and 34345 transitions. [2019-12-27 16:54:55,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:54:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 10855 states and 34345 transitions. [2019-12-27 16:54:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 16:54:55,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:54:55,300 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] [2019-12-27 16:54:55,300 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:54:55,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:54:55,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1876344722, now seen corresponding path program 1 times [2019-12-27 16:54:55,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:54:55,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123952854] [2019-12-27 16:54:55,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:54:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:54:55,364 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 16:54:55,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123952854] [2019-12-27 16:54:55,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:54:55,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:54:55,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1654444710] [2019-12-27 16:54:55,365 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:54:55,370 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:54:55,377 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 61 transitions. [2019-12-27 16:54:55,378 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:54:55,379 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:54:55,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:54:55,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:54:55,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:54:55,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:54:55,380 INFO L87 Difference]: Start difference. First operand 10855 states and 34345 transitions. Second operand 4 states. [2019-12-27 16:54:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:54:55,453 INFO L93 Difference]: Finished difference Result 16412 states and 52778 transitions. [2019-12-27 16:54:55,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:54:55,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 16:54:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:54:55,468 INFO L225 Difference]: With dead ends: 16412 [2019-12-27 16:54:55,468 INFO L226 Difference]: Without dead ends: 8743 [2019-12-27 16:54:55,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:54:55,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8743 states. [2019-12-27 16:54:55,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8743 to 8444. [2019-12-27 16:54:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8444 states. [2019-12-27 16:54:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8444 states to 8444 states and 26914 transitions. [2019-12-27 16:54:55,594 INFO L78 Accepts]: Start accepts. Automaton has 8444 states and 26914 transitions. Word has length 23 [2019-12-27 16:54:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:54:55,595 INFO L462 AbstractCegarLoop]: Abstraction has 8444 states and 26914 transitions. [2019-12-27 16:54:55,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:54:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 8444 states and 26914 transitions. [2019-12-27 16:54:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 16:54:55,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:54:55,598 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] [2019-12-27 16:54:55,598 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:54:55,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:54:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1799428640, now seen corresponding path program 2 times [2019-12-27 16:54:55,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:54:55,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221250753] [2019-12-27 16:54:55,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:54:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:54:55,680 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 16:54:55,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221250753] [2019-12-27 16:54:55,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:54:55,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:54:55,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [196233179] [2019-12-27 16:54:55,682 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:54:55,687 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:54:55,692 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 16:54:55,692 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:54:55,692 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:54:55,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:54:55,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:54:55,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:54:55,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:54:55,694 INFO L87 Difference]: Start difference. First operand 8444 states and 26914 transitions. Second operand 6 states. [2019-12-27 16:54:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:54:55,791 INFO L93 Difference]: Finished difference Result 3436 states and 9854 transitions. [2019-12-27 16:54:55,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:54:55,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-12-27 16:54:55,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:54:55,795 INFO L225 Difference]: With dead ends: 3436 [2019-12-27 16:54:55,796 INFO L226 Difference]: Without dead ends: 2817 [2019-12-27 16:54:55,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:54:55,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2019-12-27 16:54:55,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2797. [2019-12-27 16:54:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-12-27 16:54:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 7967 transitions. [2019-12-27 16:54:55,827 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 7967 transitions. Word has length 23 [2019-12-27 16:54:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:54:55,827 INFO L462 AbstractCegarLoop]: Abstraction has 2797 states and 7967 transitions. [2019-12-27 16:54:55,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:54:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 7967 transitions. [2019-12-27 16:54:55,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 16:54:55,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:54:55,831 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] [2019-12-27 16:54:55,831 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:54:55,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:54:55,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-27 16:54:55,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:54:55,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17565663] [2019-12-27 16:54:55,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:54:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:54:55,883 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 16:54:55,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17565663] [2019-12-27 16:54:55,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:54:55,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:54:55,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [497355676] [2019-12-27 16:54:55,884 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:54:55,891 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:54:55,915 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 112 transitions. [2019-12-27 16:54:55,915 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:54:55,942 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:54:55,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:54:55,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:54:55,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:54:55,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:54:55,944 INFO L87 Difference]: Start difference. First operand 2797 states and 7967 transitions. Second operand 5 states. [2019-12-27 16:54:56,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:54:56,044 INFO L93 Difference]: Finished difference Result 4322 states and 12247 transitions. [2019-12-27 16:54:56,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:54:56,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 16:54:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:54:56,053 INFO L225 Difference]: With dead ends: 4322 [2019-12-27 16:54:56,053 INFO L226 Difference]: Without dead ends: 4322 [2019-12-27 16:54:56,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:54:56,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4322 states. [2019-12-27 16:54:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4322 to 3273. [2019-12-27 16:54:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3273 states. [2019-12-27 16:54:56,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 9436 transitions. [2019-12-27 16:54:56,098 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 9436 transitions. Word has length 32 [2019-12-27 16:54:56,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:54:56,098 INFO L462 AbstractCegarLoop]: Abstraction has 3273 states and 9436 transitions. [2019-12-27 16:54:56,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:54:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 9436 transitions. [2019-12-27 16:54:56,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 16:54:56,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:54:56,102 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] [2019-12-27 16:54:56,103 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:54:56,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:54:56,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-27 16:54:56,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:54:56,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546225280] [2019-12-27 16:54:56,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:54:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:54:56,218 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 16:54:56,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546225280] [2019-12-27 16:54:56,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:54:56,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:54:56,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [458260761] [2019-12-27 16:54:56,220 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:54:56,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:54:56,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 112 transitions. [2019-12-27 16:54:56,248 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:54:56,292 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:54:56,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:54:56,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:54:56,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:54:56,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:54:56,293 INFO L87 Difference]: Start difference. First operand 3273 states and 9436 transitions. Second operand 8 states. [2019-12-27 16:54:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:54:56,997 INFO L93 Difference]: Finished difference Result 6672 states and 18337 transitions. [2019-12-27 16:54:56,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 16:54:56,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 16:54:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:54:57,009 INFO L225 Difference]: With dead ends: 6672 [2019-12-27 16:54:57,009 INFO L226 Difference]: Without dead ends: 6534 [2019-12-27 16:54:57,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:54:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-12-27 16:54:57,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 3403. [2019-12-27 16:54:57,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3403 states. [2019-12-27 16:54:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 9764 transitions. [2019-12-27 16:54:57,086 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 9764 transitions. Word has length 32 [2019-12-27 16:54:57,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:54:57,087 INFO L462 AbstractCegarLoop]: Abstraction has 3403 states and 9764 transitions. [2019-12-27 16:54:57,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:54:57,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 9764 transitions. [2019-12-27 16:54:57,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 16:54:57,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:54:57,092 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] [2019-12-27 16:54:57,092 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:54:57,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:54:57,092 INFO L82 PathProgramCache]: Analyzing trace with hash 668169174, now seen corresponding path program 1 times [2019-12-27 16:54:57,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:54:57,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974995523] [2019-12-27 16:54:57,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:54:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:54:57,177 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 16:54:57,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974995523] [2019-12-27 16:54:57,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:54:57,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:54:57,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1054309341] [2019-12-27 16:54:57,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:54:57,184 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:54:57,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 64 transitions. [2019-12-27 16:54:57,197 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:54:57,199 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:54:57,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:54:57,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:54:57,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:54:57,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:54:57,201 INFO L87 Difference]: Start difference. First operand 3403 states and 9764 transitions. Second operand 5 states. [2019-12-27 16:54:57,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:54:57,616 INFO L93 Difference]: Finished difference Result 5197 states and 14640 transitions. [2019-12-27 16:54:57,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:54:57,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 16:54:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:54:57,624 INFO L225 Difference]: With dead ends: 5197 [2019-12-27 16:54:57,624 INFO L226 Difference]: Without dead ends: 5197 [2019-12-27 16:54:57,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:54:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2019-12-27 16:54:57,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 4563. [2019-12-27 16:54:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4563 states. [2019-12-27 16:54:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4563 states to 4563 states and 13058 transitions. [2019-12-27 16:54:57,681 INFO L78 Accepts]: Start accepts. Automaton has 4563 states and 13058 transitions. Word has length 32 [2019-12-27 16:54:57,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:54:57,681 INFO L462 AbstractCegarLoop]: Abstraction has 4563 states and 13058 transitions. [2019-12-27 16:54:57,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:54:57,681 INFO L276 IsEmpty]: Start isEmpty. Operand 4563 states and 13058 transitions. [2019-12-27 16:54:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:54:57,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:54:57,687 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] [2019-12-27 16:54:57,687 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:54:57,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:54:57,688 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-27 16:54:57,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:54:57,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926792887] [2019-12-27 16:54:57,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:54:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:54:57,784 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 16:54:57,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926792887] [2019-12-27 16:54:57,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:54:57,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:54:57,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [811929871] [2019-12-27 16:54:57,785 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:54:57,793 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:54:57,820 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 117 transitions. [2019-12-27 16:54:57,820 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:54:57,865 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:54:57,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:54:57,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:54:57,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:54:57,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:54:57,866 INFO L87 Difference]: Start difference. First operand 4563 states and 13058 transitions. Second operand 8 states. [2019-12-27 16:54:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:54:58,514 INFO L93 Difference]: Finished difference Result 8693 states and 23894 transitions. [2019-12-27 16:54:58,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 16:54:58,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 16:54:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:54:58,525 INFO L225 Difference]: With dead ends: 8693 [2019-12-27 16:54:58,526 INFO L226 Difference]: Without dead ends: 8549 [2019-12-27 16:54:58,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:54:58,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8549 states. [2019-12-27 16:54:58,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8549 to 4625. [2019-12-27 16:54:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4625 states. [2019-12-27 16:54:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 13321 transitions. [2019-12-27 16:54:58,602 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 13321 transitions. Word has length 33 [2019-12-27 16:54:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:54:58,602 INFO L462 AbstractCegarLoop]: Abstraction has 4625 states and 13321 transitions. [2019-12-27 16:54:58,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:54:58,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 13321 transitions. [2019-12-27 16:54:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:54:58,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:54:58,608 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] [2019-12-27 16:54:58,609 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:54:58,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:54:58,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1231616427, now seen corresponding path program 1 times [2019-12-27 16:54:58,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:54:58,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868217481] [2019-12-27 16:54:58,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:54:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:54:58,732 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 16:54:58,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868217481] [2019-12-27 16:54:58,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:54:58,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:54:58,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1207683117] [2019-12-27 16:54:58,733 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:54:58,738 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:54:58,753 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 65 transitions. [2019-12-27 16:54:58,753 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:54:58,780 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:54:58,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:54:58,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:54:58,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:54:58,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:54:58,782 INFO L87 Difference]: Start difference. First operand 4625 states and 13321 transitions. Second operand 8 states. [2019-12-27 16:54:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:54:59,095 INFO L93 Difference]: Finished difference Result 3848 states and 11293 transitions. [2019-12-27 16:54:59,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 16:54:59,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 16:54:59,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:54:59,103 INFO L225 Difference]: With dead ends: 3848 [2019-12-27 16:54:59,103 INFO L226 Difference]: Without dead ends: 2815 [2019-12-27 16:54:59,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:54:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2019-12-27 16:54:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2401. [2019-12-27 16:54:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2019-12-27 16:54:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 6865 transitions. [2019-12-27 16:54:59,163 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 6865 transitions. Word has length 33 [2019-12-27 16:54:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:54:59,164 INFO L462 AbstractCegarLoop]: Abstraction has 2401 states and 6865 transitions. [2019-12-27 16:54:59,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:54:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 6865 transitions. [2019-12-27 16:54:59,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 16:54:59,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:54:59,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:54:59,172 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:54:59,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:54:59,172 INFO L82 PathProgramCache]: Analyzing trace with hash 537782324, now seen corresponding path program 1 times [2019-12-27 16:54:59,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:54:59,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85476556] [2019-12-27 16:54:59,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:54:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:54:59,282 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 16:54:59,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85476556] [2019-12-27 16:54:59,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:54:59,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:54:59,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1113918940] [2019-12-27 16:54:59,283 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:54:59,297 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:54:59,473 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 289 transitions. [2019-12-27 16:54:59,473 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:54:59,477 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:54:59,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:54:59,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:54:59,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:54:59,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:54:59,479 INFO L87 Difference]: Start difference. First operand 2401 states and 6865 transitions. Second operand 6 states. [2019-12-27 16:54:59,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:54:59,679 INFO L93 Difference]: Finished difference Result 6419 states and 18107 transitions. [2019-12-27 16:54:59,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 16:54:59,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-27 16:54:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:54:59,686 INFO L225 Difference]: With dead ends: 6419 [2019-12-27 16:54:59,686 INFO L226 Difference]: Without dead ends: 4118 [2019-12-27 16:54:59,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:54:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2019-12-27 16:54:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 2585. [2019-12-27 16:54:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2585 states. [2019-12-27 16:54:59,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 7335 transitions. [2019-12-27 16:54:59,725 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 7335 transitions. Word has length 47 [2019-12-27 16:54:59,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:54:59,725 INFO L462 AbstractCegarLoop]: Abstraction has 2585 states and 7335 transitions. [2019-12-27 16:54:59,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:54:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 7335 transitions. [2019-12-27 16:54:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 16:54:59,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:54:59,729 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] [2019-12-27 16:54:59,729 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:54:59,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:54:59,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1324143500, now seen corresponding path program 2 times [2019-12-27 16:54:59,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:54:59,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942200082] [2019-12-27 16:54:59,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:54:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:54:59,799 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 16:54:59,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942200082] [2019-12-27 16:54:59,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:54:59,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:54:59,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [467565251] [2019-12-27 16:54:59,801 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:54:59,814 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:54:59,950 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 175 states and 316 transitions. [2019-12-27 16:54:59,950 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:54:59,964 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:54:59,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:54:59,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:54:59,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:54:59,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:54:59,965 INFO L87 Difference]: Start difference. First operand 2585 states and 7335 transitions. Second operand 5 states. [2019-12-27 16:55:00,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:55:00,131 INFO L93 Difference]: Finished difference Result 3963 states and 10647 transitions. [2019-12-27 16:55:00,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:55:00,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 16:55:00,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:55:00,133 INFO L225 Difference]: With dead ends: 3963 [2019-12-27 16:55:00,133 INFO L226 Difference]: Without dead ends: 1108 [2019-12-27 16:55:00,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:55:00,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2019-12-27 16:55:00,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 802. [2019-12-27 16:55:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-12-27 16:55:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1724 transitions. [2019-12-27 16:55:00,145 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1724 transitions. Word has length 47 [2019-12-27 16:55:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:55:00,145 INFO L462 AbstractCegarLoop]: Abstraction has 802 states and 1724 transitions. [2019-12-27 16:55:00,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:55:00,145 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1724 transitions. [2019-12-27 16:55:00,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 16:55:00,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:00,147 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] [2019-12-27 16:55:00,147 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:00,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:00,148 INFO L82 PathProgramCache]: Analyzing trace with hash 288167740, now seen corresponding path program 3 times [2019-12-27 16:55:00,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:00,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134363356] [2019-12-27 16:55:00,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:55:00,222 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 16:55:00,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134363356] [2019-12-27 16:55:00,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:55:00,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:55:00,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1664986014] [2019-12-27 16:55:00,224 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:55:00,236 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:55:00,288 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 127 transitions. [2019-12-27 16:55:00,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:55:00,291 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:55:00,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:55:00,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:55:00,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:55:00,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:55:00,292 INFO L87 Difference]: Start difference. First operand 802 states and 1724 transitions. Second operand 7 states. [2019-12-27 16:55:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:55:00,450 INFO L93 Difference]: Finished difference Result 1252 states and 2651 transitions. [2019-12-27 16:55:00,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:55:00,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-27 16:55:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:55:00,452 INFO L225 Difference]: With dead ends: 1252 [2019-12-27 16:55:00,452 INFO L226 Difference]: Without dead ends: 820 [2019-12-27 16:55:00,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:55:00,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-12-27 16:55:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 778. [2019-12-27 16:55:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2019-12-27 16:55:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1674 transitions. [2019-12-27 16:55:00,460 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1674 transitions. Word has length 47 [2019-12-27 16:55:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:55:00,460 INFO L462 AbstractCegarLoop]: Abstraction has 778 states and 1674 transitions. [2019-12-27 16:55:00,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:55:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1674 transitions. [2019-12-27 16:55:00,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 16:55:00,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:00,461 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] [2019-12-27 16:55:00,461 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:00,462 INFO L82 PathProgramCache]: Analyzing trace with hash -261128468, now seen corresponding path program 4 times [2019-12-27 16:55:00,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:00,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367235621] [2019-12-27 16:55:00,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:55:00,537 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 16:55:00,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367235621] [2019-12-27 16:55:00,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:55:00,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:55:00,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1689392825] [2019-12-27 16:55:00,538 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:55:00,551 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:55:00,610 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 106 transitions. [2019-12-27 16:55:00,610 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:55:00,611 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:55:00,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:55:00,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:55:00,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:55:00,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:55:00,612 INFO L87 Difference]: Start difference. First operand 778 states and 1674 transitions. Second operand 3 states. [2019-12-27 16:55:00,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:55:00,627 INFO L93 Difference]: Finished difference Result 778 states and 1672 transitions. [2019-12-27 16:55:00,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:55:00,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 16:55:00,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:55:00,628 INFO L225 Difference]: With dead ends: 778 [2019-12-27 16:55:00,628 INFO L226 Difference]: Without dead ends: 778 [2019-12-27 16:55:00,629 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 16:55:00,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-12-27 16:55:00,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 704. [2019-12-27 16:55:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-12-27 16:55:00,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1526 transitions. [2019-12-27 16:55:00,641 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1526 transitions. Word has length 47 [2019-12-27 16:55:00,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:55:00,642 INFO L462 AbstractCegarLoop]: Abstraction has 704 states and 1526 transitions. [2019-12-27 16:55:00,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:55:00,642 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1526 transitions. [2019-12-27 16:55:00,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 16:55:00,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:55:00,644 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] [2019-12-27 16:55:00,644 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:55:00,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:55:00,644 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 1 times [2019-12-27 16:55:00,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:55:00,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240837473] [2019-12-27 16:55:00,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:55:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:55:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:55:00,758 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:55:00,758 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:55:00,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_107| 0 0))) (and (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t997~0.base_59|) (= v_~x~0_71 0) (= 0 v_~weak$$choice0~0_10) (= v_~z$w_buff0_used~0_514 0) (= 0 v_~z$r_buff1_thd3~0_207) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_44 0) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t997~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t997~0.base_59|) |v_ULTIMATE.start_main_~#t997~0.offset_37| 0))) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t997~0.base_59|) 0) (= 0 v_~z$flush_delayed~0_37) (= v_~z$mem_tmp~0_16 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_87) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_132 0) (= |v_#NULL.offset_5| 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t997~0.base_59| 4) |v_#length_31|) (= 0 |v_ULTIMATE.start_main_~#t997~0.offset_37|) (= v_~z~0_116 0) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~z$r_buff0_thd3~0_266) (= 0 v_~__unbuffered_p3_EBX~0_88) (= 0 v_~weak$$choice2~0_95) (= v_~z$w_buff1_used~0_298 0) (= |v_#valid_105| (store .cse0 |v_ULTIMATE.start_main_~#t997~0.base_59| 1)) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_107|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t997~0.offset=|v_ULTIMATE.start_main_~#t997~0.offset_37|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ULTIMATE.start_main_~#t999~0.base=|v_ULTIMATE.start_main_~#t999~0.base_32|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, ULTIMATE.start_main_~#t1000~0.offset=|v_ULTIMATE.start_main_~#t1000~0.offset_22|, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_71, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t997~0.base=|v_ULTIMATE.start_main_~#t997~0.base_59|, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ULTIMATE.start_main_~#t1000~0.base=|v_ULTIMATE.start_main_~#t1000~0.base_32|, ~y~0=v_~y~0_19, ULTIMATE.start_main_~#t998~0.offset=|v_ULTIMATE.start_main_~#t998~0.offset_35|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_207, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_88, ULTIMATE.start_main_~#t999~0.offset=|v_ULTIMATE.start_main_~#t999~0.offset_23|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_91|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_38|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58, ULTIMATE.start_main_~#t998~0.base=|v_ULTIMATE.start_main_~#t998~0.base_56|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t997~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t999~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t1000~0.offset, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ULTIMATE.start_main_~#t997~0.base, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1000~0.base, ~y~0, ULTIMATE.start_main_~#t998~0.offset, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t999~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t998~0.base] because there is no mapped edge [2019-12-27 16:55:00,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t998~0.base_11|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t998~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t998~0.base_11|) |v_ULTIMATE.start_main_~#t998~0.offset_10| 1)) |v_#memory_int_19|) (not (= 0 |v_ULTIMATE.start_main_~#t998~0.base_11|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t998~0.base_11| 4) |v_#length_23|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t998~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t998~0.offset_10| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t998~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t998~0.base=|v_ULTIMATE.start_main_~#t998~0.base_11|, ULTIMATE.start_main_~#t998~0.offset=|v_ULTIMATE.start_main_~#t998~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t998~0.base, ULTIMATE.start_main_~#t998~0.offset] because there is no mapped edge [2019-12-27 16:55:00,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t999~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t999~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t999~0.base_12| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t999~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t999~0.base_12|) |v_ULTIMATE.start_main_~#t999~0.offset_11| 2)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t999~0.offset_11| 0) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t999~0.base_12| 1) |v_#valid_46|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t999~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t999~0.base=|v_ULTIMATE.start_main_~#t999~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_~#t999~0.offset=|v_ULTIMATE.start_main_~#t999~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t999~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t999~0.offset] because there is no mapped edge [2019-12-27 16:55:00,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1000~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1000~0.base_12|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1000~0.base_12| 4)) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1000~0.base_12|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1000~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1000~0.base_12|) |v_ULTIMATE.start_main_~#t1000~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1000~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t1000~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1000~0.base=|v_ULTIMATE.start_main_~#t1000~0.base_12|, ULTIMATE.start_main_~#t1000~0.offset=|v_ULTIMATE.start_main_~#t1000~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1000~0.base, ULTIMATE.start_main_~#t1000~0.offset, #length] because there is no mapped edge [2019-12-27 16:55:00,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~a~0_Out1273170530 ~__unbuffered_p3_EAX~0_Out1273170530) (= ~z$r_buff0_thd4~0_Out1273170530 1) (= ~z$r_buff0_thd4~0_In1273170530 ~z$r_buff1_thd4~0_Out1273170530) (= ~z$r_buff1_thd0~0_Out1273170530 ~z$r_buff0_thd0~0_In1273170530) (= ~a~0_Out1273170530 1) (= ~z$r_buff1_thd2~0_Out1273170530 ~z$r_buff0_thd2~0_In1273170530) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1273170530)) (= ~__unbuffered_p3_EBX~0_Out1273170530 ~b~0_In1273170530) (= ~z$r_buff0_thd1~0_In1273170530 ~z$r_buff1_thd1~0_Out1273170530) (= ~z$r_buff1_thd3~0_Out1273170530 ~z$r_buff0_thd3~0_In1273170530)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1273170530, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1273170530, ~b~0=~b~0_In1273170530, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1273170530, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1273170530, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1273170530, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1273170530} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1273170530, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1273170530, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1273170530, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1273170530, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1273170530, ~a~0=~a~0_Out1273170530, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1273170530, ~b~0=~b~0_In1273170530, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1273170530, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1273170530, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1273170530, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1273170530, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1273170530, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1273170530, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1273170530} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 16:55:00,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_36 1) (= v_P0Thread1of1ForFork3_~arg.base_22 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_22) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~b~0_48 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|} OutVars{~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_22, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_22, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-27 16:55:00,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~y~0_15 v_~__unbuffered_p1_EAX~0_14) (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_23 2) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~y~0=v_~y~0_15} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_11, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_15, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 16:55:00,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1722010204 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_In1722010204| |P2Thread1of1ForFork1_#t~ite8_Out1722010204|) (= ~z$w_buff0~0_In1722010204 |P2Thread1of1ForFork1_#t~ite9_Out1722010204|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite8_Out1722010204| |P2Thread1of1ForFork1_#t~ite9_Out1722010204|) (= |P2Thread1of1ForFork1_#t~ite8_Out1722010204| ~z$w_buff0~0_In1722010204) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1722010204 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In1722010204 256)) .cse1) (= (mod ~z$w_buff0_used~0_In1722010204 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1722010204 256)) .cse1)))))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1722010204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1722010204, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1722010204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1722010204, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1722010204, ~weak$$choice2~0=~weak$$choice2~0_In1722010204, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In1722010204|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1722010204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1722010204, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1722010204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1722010204, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1722010204, ~weak$$choice2~0=~weak$$choice2~0_In1722010204, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out1722010204|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out1722010204|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:55:00,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In835978214 256) 0))) (or (and (= ~z$w_buff1~0_In835978214 |P2Thread1of1ForFork1_#t~ite11_Out835978214|) (= |P2Thread1of1ForFork1_#t~ite11_Out835978214| |P2Thread1of1ForFork1_#t~ite12_Out835978214|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In835978214 256) 0))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In835978214 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In835978214 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In835978214 256))))) .cse1) (and (= ~z$w_buff1~0_In835978214 |P2Thread1of1ForFork1_#t~ite12_Out835978214|) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite11_In835978214| |P2Thread1of1ForFork1_#t~ite11_Out835978214|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In835978214, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In835978214, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In835978214|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In835978214, ~z$w_buff1~0=~z$w_buff1~0_In835978214, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In835978214, ~weak$$choice2~0=~weak$$choice2~0_In835978214} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In835978214, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out835978214|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In835978214, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out835978214|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In835978214, ~z$w_buff1~0=~z$w_buff1~0_In835978214, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In835978214, ~weak$$choice2~0=~weak$$choice2~0_In835978214} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 16:55:00,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In271631903 256) 0))) (or (and (not .cse0) (= ~z$w_buff0_used~0_In271631903 |P2Thread1of1ForFork1_#t~ite15_Out271631903|) (= |P2Thread1of1ForFork1_#t~ite14_In271631903| |P2Thread1of1ForFork1_#t~ite14_Out271631903|)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out271631903| |P2Thread1of1ForFork1_#t~ite15_Out271631903|) (= |P2Thread1of1ForFork1_#t~ite14_Out271631903| ~z$w_buff0_used~0_In271631903) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In271631903 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In271631903 256) 0) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In271631903 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In271631903 256))))))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In271631903|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In271631903, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In271631903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In271631903, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In271631903, ~weak$$choice2~0=~weak$$choice2~0_In271631903} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out271631903|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out271631903|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In271631903, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In271631903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In271631903, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In271631903, ~weak$$choice2~0=~weak$$choice2~0_In271631903} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-27 16:55:00,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_11|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 16:55:00,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-299051015 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite23_Out-299051015| ~z$r_buff1_thd3~0_In-299051015) (= |P2Thread1of1ForFork1_#t~ite23_Out-299051015| |P2Thread1of1ForFork1_#t~ite24_Out-299051015|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-299051015 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-299051015 256) 0)) (= (mod ~z$w_buff0_used~0_In-299051015 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In-299051015 256) 0))))) (and (= |P2Thread1of1ForFork1_#t~ite23_In-299051015| |P2Thread1of1ForFork1_#t~ite23_Out-299051015|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite24_Out-299051015| ~z$r_buff1_thd3~0_In-299051015)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-299051015, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-299051015, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-299051015|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-299051015, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-299051015, ~weak$$choice2~0=~weak$$choice2~0_In-299051015} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-299051015|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-299051015, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-299051015, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-299051015|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-299051015, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-299051015, ~weak$$choice2~0=~weak$$choice2~0_In-299051015} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-27 16:55:00,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 16:55:00,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In214385383 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In214385383 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite28_Out214385383|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In214385383 |P3Thread1of1ForFork2_#t~ite28_Out214385383|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In214385383, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In214385383} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out214385383|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In214385383, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In214385383} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 16:55:00,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1440059728 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1440059728 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-1440059728 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1440059728 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1440059728 |P3Thread1of1ForFork2_#t~ite29_Out-1440059728|)) (and (= |P3Thread1of1ForFork2_#t~ite29_Out-1440059728| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1440059728, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1440059728, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1440059728, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1440059728} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1440059728|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1440059728, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1440059728, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1440059728, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1440059728} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 16:55:00,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1499497475 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1499497475 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1499497475) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out1499497475 ~z$r_buff0_thd4~0_In1499497475)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1499497475, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1499497475} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1499497475, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1499497475, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out1499497475|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 16:55:00,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In993737557 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In993737557 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In993737557 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In993737557 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out993737557| ~z$r_buff1_thd4~0_In993737557) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork2_#t~ite31_Out993737557| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In993737557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In993737557, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In993737557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In993737557} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In993737557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In993737557, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In993737557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In993737557, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out993737557|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 16:55:00,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_44| v_~z$r_buff1_thd4~0_62)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_44|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_43|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 16:55:00,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 16:55:00,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite36_Out1885409057| |ULTIMATE.start_main_#t~ite37_Out1885409057|)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1885409057 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1885409057 256) 0))) (or (and (= ~z$w_buff1~0_In1885409057 |ULTIMATE.start_main_#t~ite36_Out1885409057|) (not .cse0) .cse1 (not .cse2)) (and .cse1 (= ~z~0_In1885409057 |ULTIMATE.start_main_#t~ite36_Out1885409057|) (or .cse0 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1885409057, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1885409057, ~z$w_buff1~0=~z$w_buff1~0_In1885409057, ~z~0=~z~0_In1885409057} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1885409057, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1885409057, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1885409057|, ~z$w_buff1~0=~z$w_buff1~0_In1885409057, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1885409057|, ~z~0=~z~0_In1885409057} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 16:55:00,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-6161752 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-6161752 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-6161752| 0)) (and (= |ULTIMATE.start_main_#t~ite38_Out-6161752| ~z$w_buff0_used~0_In-6161752) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-6161752, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-6161752} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-6161752, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-6161752, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-6161752|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 16:55:00,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1916087436 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1916087436 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1916087436 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1916087436 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out1916087436| 0)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite39_Out1916087436| ~z$w_buff1_used~0_In1916087436) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1916087436, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1916087436, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1916087436, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1916087436} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1916087436, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1916087436|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1916087436, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1916087436, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1916087436} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 16:55:00,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In381826515 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In381826515 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In381826515 |ULTIMATE.start_main_#t~ite40_Out381826515|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out381826515|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In381826515, ~z$w_buff0_used~0=~z$w_buff0_used~0_In381826515} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In381826515, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out381826515|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In381826515} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:55:00,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-423766837 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-423766837 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-423766837 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-423766837 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-423766837| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In-423766837 |ULTIMATE.start_main_#t~ite41_Out-423766837|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-423766837, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-423766837, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-423766837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-423766837} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-423766837|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-423766837, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-423766837, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-423766837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-423766837} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 16:55:00,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 0) (= v_~x~0_41 2) (= 0 v_~__unbuffered_p2_EAX~0_17)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:55:00,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:55:00 BasicIcfg [2019-12-27 16:55:00,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:55:00,883 INFO L168 Benchmark]: Toolchain (without parser) took 29903.88 ms. Allocated memory was 144.7 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 100.7 MB in the beginning and 469.0 MB in the end (delta: -368.3 MB). Peak memory consumption was 951.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:55:00,884 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 16:55:00,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.42 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 156.1 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:55:00,885 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.45 ms. Allocated memory is still 202.4 MB. Free memory was 156.1 MB in the beginning and 153.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:55:00,886 INFO L168 Benchmark]: Boogie Preprocessor took 40.58 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:55:00,886 INFO L168 Benchmark]: RCFGBuilder took 808.99 ms. Allocated memory is still 202.4 MB. Free memory was 150.6 MB in the beginning and 104.6 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:55:00,887 INFO L168 Benchmark]: TraceAbstraction took 28150.53 ms. Allocated memory was 202.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 104.6 MB in the beginning and 469.0 MB in the end (delta: -364.4 MB). Peak memory consumption was 898.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:55:00,890 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.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 819.42 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 156.1 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.45 ms. Allocated memory is still 202.4 MB. Free memory was 156.1 MB in the beginning and 153.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.58 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 808.99 ms. Allocated memory is still 202.4 MB. Free memory was 150.6 MB in the beginning and 104.6 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28150.53 ms. Allocated memory was 202.4 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 104.6 MB in the beginning and 469.0 MB in the end (delta: -364.4 MB). Peak memory consumption was 898.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5751 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t997, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t998, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t999, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1000, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2167 SDtfs, 3092 SDslu, 4221 SDs, 0 SdLazy, 2008 SolverSat, 223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30378occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 25399 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 570 NumberOfCodeBlocks, 570 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 504 ConstructedInterpolants, 0 QuantifiedInterpolants, 44582 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...