/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:54:51,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:54:51,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:54:51,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:54:51,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:54:51,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:54:51,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:54:51,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:54:51,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:54:51,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:54:51,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:54:51,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:54:51,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:54:51,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:54:51,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:54:51,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:54:51,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:54:51,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:54:51,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:54:51,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:54:51,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:54:51,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:54:51,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:54:51,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:54:51,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:54:51,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:54:51,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:54:51,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:54:51,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:54:51,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:54:51,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:54:51,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:54:51,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:54:51,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:54:51,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:54:51,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:54:51,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:54:51,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:54:51,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:54:51,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:54:51,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:54:51,719 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 19:54:51,733 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:54:51,733 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:54:51,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:54:51,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:54:51,735 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:54:51,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:54:51,735 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:54:51,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:54:51,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:54:51,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:54:51,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:54:51,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:54:51,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:54:51,737 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:54:51,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:54:51,737 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:54:51,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:54:51,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:54:51,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:54:51,738 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:54:51,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:54:51,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:54:51,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:54:51,739 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:54:51,739 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:54:51,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:54:51,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:54:51,740 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 19:54:51,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:54:51,740 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:54:52,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:54:52,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:54:52,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:54:52,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:54:52,026 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:54:52,027 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001_power.opt.i [2019-12-18 19:54:52,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb189ddb/e0945b3f0fca46a1ada2e0fa75cb09cd/FLAG5aa3cdb3f [2019-12-18 19:54:52,671 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:54:52,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_power.opt.i [2019-12-18 19:54:52,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb189ddb/e0945b3f0fca46a1ada2e0fa75cb09cd/FLAG5aa3cdb3f [2019-12-18 19:54:52,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5eb189ddb/e0945b3f0fca46a1ada2e0fa75cb09cd [2019-12-18 19:54:52,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:54:52,929 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:54:52,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:54:52,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:54:52,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:54:52,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:54:52" (1/1) ... [2019-12-18 19:54:52,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1570dfe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:52, skipping insertion in model container [2019-12-18 19:54:52,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:54:52" (1/1) ... [2019-12-18 19:54:52,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:54:53,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:54:53,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:54:53,602 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:54:53,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:54:53,783 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:54:53,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:53 WrapperNode [2019-12-18 19:54:53,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:54:53,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:54:53,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:54:53,784 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:54:53,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:53" (1/1) ... [2019-12-18 19:54:53,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:53" (1/1) ... [2019-12-18 19:54:53,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:54:53,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:54:53,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:54:53,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:54:53,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:53" (1/1) ... [2019-12-18 19:54:53,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:53" (1/1) ... [2019-12-18 19:54:53,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:53" (1/1) ... [2019-12-18 19:54:53,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:53" (1/1) ... [2019-12-18 19:54:53,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:53" (1/1) ... [2019-12-18 19:54:53,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:53" (1/1) ... [2019-12-18 19:54:53,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:53" (1/1) ... [2019-12-18 19:54:53,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:54:53,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:54:53,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:54:53,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:54:53,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:53" (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-18 19:54:53,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:54:53,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:54:53,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:54:53,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:54:53,975 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:54:53,975 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:54:53,975 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:54:53,976 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:54:53,977 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 19:54:53,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 19:54:53,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:54:53,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:54:53,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:54:53,980 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 19:54:54,890 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:54:54,891 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:54:54,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:54:54 BoogieIcfgContainer [2019-12-18 19:54:54,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:54:54,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:54:54,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:54:54,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:54:54,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:54:52" (1/3) ... [2019-12-18 19:54:54,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac2d982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:54:54, skipping insertion in model container [2019-12-18 19:54:54,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:54:53" (2/3) ... [2019-12-18 19:54:54,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac2d982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:54:54, skipping insertion in model container [2019-12-18 19:54:54,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:54:54" (3/3) ... [2019-12-18 19:54:54,901 INFO L109 eAbstractionObserver]: Analyzing ICFG mix001_power.opt.i [2019-12-18 19:54:54,912 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:54:54,912 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:54:54,920 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:54:54,921 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:54:54,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,987 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,988 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:54,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,008 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,010 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,041 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,041 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,043 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,050 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,050 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,057 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,060 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:54:55,076 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 19:54:55,098 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:54:55,098 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:54:55,098 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:54:55,099 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:54:55,099 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:54:55,099 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:54:55,099 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:54:55,099 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:54:55,121 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-18 19:54:55,123 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-18 19:54:55,229 INFO L126 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-18 19:54:55,229 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:54:55,255 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 19:54:55,291 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-18 19:54:55,380 INFO L126 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-18 19:54:55,380 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:54:55,392 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 19:54:55,419 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-18 19:54:55,421 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 19:54:59,105 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 19:54:59,225 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 19:54:59,570 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 19:54:59,711 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 19:54:59,749 INFO L206 etLargeBlockEncoding]: Checked pairs total: 134958 [2019-12-18 19:54:59,749 INFO L214 etLargeBlockEncoding]: Total number of compositions: 125 [2019-12-18 19:54:59,752 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 127 transitions [2019-12-18 19:55:03,376 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 43566 states. [2019-12-18 19:55:03,378 INFO L276 IsEmpty]: Start isEmpty. Operand 43566 states. [2019-12-18 19:55:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 19:55:03,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:03,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:55:03,386 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:03,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:03,393 INFO L82 PathProgramCache]: Analyzing trace with hash -616580539, now seen corresponding path program 1 times [2019-12-18 19:55:03,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:03,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465735960] [2019-12-18 19:55:03,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:03,637 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-18 19:55:03,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465735960] [2019-12-18 19:55:03,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:03,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:55:03,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113540675] [2019-12-18 19:55:03,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:55:03,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:03,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:55:03,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:55:03,660 INFO L87 Difference]: Start difference. First operand 43566 states. Second operand 3 states. [2019-12-18 19:55:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:04,414 INFO L93 Difference]: Finished difference Result 43014 states and 174370 transitions. [2019-12-18 19:55:04,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:55:04,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 19:55:04,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:04,753 INFO L225 Difference]: With dead ends: 43014 [2019-12-18 19:55:04,754 INFO L226 Difference]: Without dead ends: 40044 [2019-12-18 19:55:04,757 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-18 19:55:06,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40044 states. [2019-12-18 19:55:07,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40044 to 40044. [2019-12-18 19:55:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40044 states. [2019-12-18 19:55:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40044 states to 40044 states and 162217 transitions. [2019-12-18 19:55:09,328 INFO L78 Accepts]: Start accepts. Automaton has 40044 states and 162217 transitions. Word has length 7 [2019-12-18 19:55:09,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:09,329 INFO L462 AbstractCegarLoop]: Abstraction has 40044 states and 162217 transitions. [2019-12-18 19:55:09,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:55:09,329 INFO L276 IsEmpty]: Start isEmpty. Operand 40044 states and 162217 transitions. [2019-12-18 19:55:09,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:55:09,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:09,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:55:09,341 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:09,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1408183665, now seen corresponding path program 1 times [2019-12-18 19:55:09,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:09,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661994910] [2019-12-18 19:55:09,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:09,529 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-18 19:55:09,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661994910] [2019-12-18 19:55:09,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:09,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:55:09,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203555398] [2019-12-18 19:55:09,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:55:09,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:09,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:55:09,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:55:09,534 INFO L87 Difference]: Start difference. First operand 40044 states and 162217 transitions. Second operand 4 states. [2019-12-18 19:55:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:10,250 INFO L93 Difference]: Finished difference Result 63338 states and 247308 transitions. [2019-12-18 19:55:10,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:55:10,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 19:55:10,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:10,894 INFO L225 Difference]: With dead ends: 63338 [2019-12-18 19:55:10,894 INFO L226 Difference]: Without dead ends: 63310 [2019-12-18 19:55:10,895 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-18 19:55:11,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63310 states. [2019-12-18 19:55:13,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63310 to 60640. [2019-12-18 19:55:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60640 states. [2019-12-18 19:55:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60640 states to 60640 states and 238729 transitions. [2019-12-18 19:55:13,774 INFO L78 Accepts]: Start accepts. Automaton has 60640 states and 238729 transitions. Word has length 13 [2019-12-18 19:55:13,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:13,774 INFO L462 AbstractCegarLoop]: Abstraction has 60640 states and 238729 transitions. [2019-12-18 19:55:13,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:55:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 60640 states and 238729 transitions. [2019-12-18 19:55:13,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 19:55:13,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:13,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:55:13,786 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:13,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:13,786 INFO L82 PathProgramCache]: Analyzing trace with hash -903300069, now seen corresponding path program 1 times [2019-12-18 19:55:13,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:13,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484062412] [2019-12-18 19:55:13,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:13,941 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-18 19:55:13,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484062412] [2019-12-18 19:55:13,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:13,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:55:13,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842990238] [2019-12-18 19:55:13,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:55:13,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:13,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:55:13,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:55:13,945 INFO L87 Difference]: Start difference. First operand 60640 states and 238729 transitions. Second operand 4 states. [2019-12-18 19:55:16,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:16,636 INFO L93 Difference]: Finished difference Result 77848 states and 302341 transitions. [2019-12-18 19:55:16,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:55:16,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 19:55:16,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:16,880 INFO L225 Difference]: With dead ends: 77848 [2019-12-18 19:55:16,880 INFO L226 Difference]: Without dead ends: 77820 [2019-12-18 19:55:16,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:55:17,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77820 states. [2019-12-18 19:55:21,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77820 to 68750. [2019-12-18 19:55:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68750 states. [2019-12-18 19:55:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68750 states to 68750 states and 269586 transitions. [2019-12-18 19:55:21,811 INFO L78 Accepts]: Start accepts. Automaton has 68750 states and 269586 transitions. Word has length 16 [2019-12-18 19:55:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:21,811 INFO L462 AbstractCegarLoop]: Abstraction has 68750 states and 269586 transitions. [2019-12-18 19:55:21,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:55:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 68750 states and 269586 transitions. [2019-12-18 19:55:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:55:21,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:21,820 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-18 19:55:21,820 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:21,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:21,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1875943098, now seen corresponding path program 1 times [2019-12-18 19:55:21,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:21,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888426404] [2019-12-18 19:55:21,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:21,884 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-18 19:55:21,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888426404] [2019-12-18 19:55:21,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:21,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:55:21,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775075419] [2019-12-18 19:55:21,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:55:21,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:21,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:55:21,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:55:21,886 INFO L87 Difference]: Start difference. First operand 68750 states and 269586 transitions. Second operand 3 states. [2019-12-18 19:55:22,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:22,183 INFO L93 Difference]: Finished difference Result 65858 states and 256753 transitions. [2019-12-18 19:55:22,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:55:22,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 19:55:22,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:22,950 INFO L225 Difference]: With dead ends: 65858 [2019-12-18 19:55:22,950 INFO L226 Difference]: Without dead ends: 65858 [2019-12-18 19:55:22,950 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-18 19:55:23,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65858 states. [2019-12-18 19:55:26,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65858 to 65858. [2019-12-18 19:55:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65858 states. [2019-12-18 19:55:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65858 states to 65858 states and 256753 transitions. [2019-12-18 19:55:27,236 INFO L78 Accepts]: Start accepts. Automaton has 65858 states and 256753 transitions. Word has length 18 [2019-12-18 19:55:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:27,236 INFO L462 AbstractCegarLoop]: Abstraction has 65858 states and 256753 transitions. [2019-12-18 19:55:27,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:55:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 65858 states and 256753 transitions. [2019-12-18 19:55:27,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:55:27,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:27,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:55:27,246 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:27,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:27,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1842577503, now seen corresponding path program 1 times [2019-12-18 19:55:27,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:27,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977924521] [2019-12-18 19:55:27,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:27,317 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-18 19:55:27,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977924521] [2019-12-18 19:55:27,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:27,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:55:27,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114799107] [2019-12-18 19:55:27,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:55:27,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:27,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:55:27,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:55:27,319 INFO L87 Difference]: Start difference. First operand 65858 states and 256753 transitions. Second operand 3 states. [2019-12-18 19:55:27,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:27,811 INFO L93 Difference]: Finished difference Result 63720 states and 249248 transitions. [2019-12-18 19:55:27,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:55:27,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 19:55:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:28,057 INFO L225 Difference]: With dead ends: 63720 [2019-12-18 19:55:28,058 INFO L226 Difference]: Without dead ends: 63552 [2019-12-18 19:55:28,058 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-18 19:55:28,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63552 states. [2019-12-18 19:55:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63552 to 63552. [2019-12-18 19:55:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63552 states. [2019-12-18 19:55:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63552 states to 63552 states and 248652 transitions. [2019-12-18 19:55:33,507 INFO L78 Accepts]: Start accepts. Automaton has 63552 states and 248652 transitions. Word has length 19 [2019-12-18 19:55:33,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:33,508 INFO L462 AbstractCegarLoop]: Abstraction has 63552 states and 248652 transitions. [2019-12-18 19:55:33,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:55:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 63552 states and 248652 transitions. [2019-12-18 19:55:33,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:55:33,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:33,527 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-18 19:55:33,527 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:33,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:33,528 INFO L82 PathProgramCache]: Analyzing trace with hash -813341911, now seen corresponding path program 1 times [2019-12-18 19:55:33,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:33,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601506070] [2019-12-18 19:55:33,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:33,614 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-18 19:55:33,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601506070] [2019-12-18 19:55:33,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:33,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:55:33,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216457555] [2019-12-18 19:55:33,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:55:33,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:33,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:55:33,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:55:33,616 INFO L87 Difference]: Start difference. First operand 63552 states and 248652 transitions. Second operand 5 states. [2019-12-18 19:55:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:34,603 INFO L93 Difference]: Finished difference Result 75918 states and 293174 transitions. [2019-12-18 19:55:34,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:55:34,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 19:55:34,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:34,786 INFO L225 Difference]: With dead ends: 75918 [2019-12-18 19:55:34,786 INFO L226 Difference]: Without dead ends: 75866 [2019-12-18 19:55:34,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:55:35,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75866 states. [2019-12-18 19:55:37,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75866 to 63240. [2019-12-18 19:55:37,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63240 states. [2019-12-18 19:55:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63240 states to 63240 states and 247578 transitions. [2019-12-18 19:55:37,347 INFO L78 Accepts]: Start accepts. Automaton has 63240 states and 247578 transitions. Word has length 22 [2019-12-18 19:55:37,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:37,347 INFO L462 AbstractCegarLoop]: Abstraction has 63240 states and 247578 transitions. [2019-12-18 19:55:37,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:55:37,348 INFO L276 IsEmpty]: Start isEmpty. Operand 63240 states and 247578 transitions. [2019-12-18 19:55:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 19:55:37,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:37,431 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-18 19:55:37,432 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:37,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:37,432 INFO L82 PathProgramCache]: Analyzing trace with hash 905995009, now seen corresponding path program 1 times [2019-12-18 19:55:37,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:37,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566987489] [2019-12-18 19:55:37,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:37,514 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-18 19:55:37,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566987489] [2019-12-18 19:55:37,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:37,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:55:37,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11276893] [2019-12-18 19:55:37,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:55:37,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:37,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:55:37,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:55:37,516 INFO L87 Difference]: Start difference. First operand 63240 states and 247578 transitions. Second operand 5 states. [2019-12-18 19:55:38,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:38,096 INFO L93 Difference]: Finished difference Result 96384 states and 382320 transitions. [2019-12-18 19:55:38,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:55:38,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 19:55:38,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:39,059 INFO L225 Difference]: With dead ends: 96384 [2019-12-18 19:55:39,059 INFO L226 Difference]: Without dead ends: 84152 [2019-12-18 19:55:39,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:55:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84152 states. [2019-12-18 19:55:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84152 to 84152. [2019-12-18 19:55:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84152 states. [2019-12-18 19:55:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84152 states to 84152 states and 335460 transitions. [2019-12-18 19:55:41,648 INFO L78 Accepts]: Start accepts. Automaton has 84152 states and 335460 transitions. Word has length 33 [2019-12-18 19:55:41,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:41,649 INFO L462 AbstractCegarLoop]: Abstraction has 84152 states and 335460 transitions. [2019-12-18 19:55:41,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:55:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 84152 states and 335460 transitions. [2019-12-18 19:55:41,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 19:55:41,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:41,778 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-18 19:55:41,778 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:41,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:41,778 INFO L82 PathProgramCache]: Analyzing trace with hash 830115435, now seen corresponding path program 2 times [2019-12-18 19:55:41,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:41,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367739601] [2019-12-18 19:55:41,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:41,854 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-18 19:55:41,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367739601] [2019-12-18 19:55:41,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:41,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:55:41,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339688527] [2019-12-18 19:55:41,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:55:41,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:41,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:55:41,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:55:41,857 INFO L87 Difference]: Start difference. First operand 84152 states and 335460 transitions. Second operand 3 states. [2019-12-18 19:55:45,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:45,035 INFO L93 Difference]: Finished difference Result 84126 states and 335383 transitions. [2019-12-18 19:55:45,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:55:45,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 19:55:45,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:45,250 INFO L225 Difference]: With dead ends: 84126 [2019-12-18 19:55:45,250 INFO L226 Difference]: Without dead ends: 84126 [2019-12-18 19:55:45,250 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-18 19:55:45,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84126 states. [2019-12-18 19:55:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84126 to 84126. [2019-12-18 19:55:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84126 states. [2019-12-18 19:55:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84126 states to 84126 states and 335383 transitions. [2019-12-18 19:55:47,476 INFO L78 Accepts]: Start accepts. Automaton has 84126 states and 335383 transitions. Word has length 33 [2019-12-18 19:55:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:47,476 INFO L462 AbstractCegarLoop]: Abstraction has 84126 states and 335383 transitions. [2019-12-18 19:55:47,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:55:47,476 INFO L276 IsEmpty]: Start isEmpty. Operand 84126 states and 335383 transitions. [2019-12-18 19:55:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 19:55:47,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:47,615 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] [2019-12-18 19:55:47,615 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:47,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:47,615 INFO L82 PathProgramCache]: Analyzing trace with hash -893352396, now seen corresponding path program 1 times [2019-12-18 19:55:47,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:47,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793579306] [2019-12-18 19:55:47,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:47,723 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-18 19:55:47,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793579306] [2019-12-18 19:55:47,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:47,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:55:47,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457829994] [2019-12-18 19:55:47,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:55:47,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:47,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:55:47,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:55:47,725 INFO L87 Difference]: Start difference. First operand 84126 states and 335383 transitions. Second operand 3 states. [2019-12-18 19:55:48,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:48,871 INFO L93 Difference]: Finished difference Result 84126 states and 330619 transitions. [2019-12-18 19:55:48,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:55:48,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-18 19:55:48,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:49,068 INFO L225 Difference]: With dead ends: 84126 [2019-12-18 19:55:49,068 INFO L226 Difference]: Without dead ends: 84126 [2019-12-18 19:55:49,069 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-18 19:55:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84126 states. [2019-12-18 19:55:54,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84126 to 83806. [2019-12-18 19:55:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83806 states. [2019-12-18 19:55:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83806 states to 83806 states and 329531 transitions. [2019-12-18 19:55:54,383 INFO L78 Accepts]: Start accepts. Automaton has 83806 states and 329531 transitions. Word has length 34 [2019-12-18 19:55:54,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:55:54,384 INFO L462 AbstractCegarLoop]: Abstraction has 83806 states and 329531 transitions. [2019-12-18 19:55:54,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:55:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 83806 states and 329531 transitions. [2019-12-18 19:55:54,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 19:55:54,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:55:54,492 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] [2019-12-18 19:55:54,492 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:55:54,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:55:54,493 INFO L82 PathProgramCache]: Analyzing trace with hash 641538334, now seen corresponding path program 1 times [2019-12-18 19:55:54,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:55:54,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037356535] [2019-12-18 19:55:54,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:55:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:55:54,606 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-18 19:55:54,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037356535] [2019-12-18 19:55:54,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:55:54,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:55:54,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509553848] [2019-12-18 19:55:54,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:55:54,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:55:54,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:55:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:55:54,609 INFO L87 Difference]: Start difference. First operand 83806 states and 329531 transitions. Second operand 6 states. [2019-12-18 19:55:56,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:55:56,116 INFO L93 Difference]: Finished difference Result 134878 states and 526145 transitions. [2019-12-18 19:55:56,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 19:55:56,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-18 19:55:56,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:55:56,454 INFO L225 Difference]: With dead ends: 134878 [2019-12-18 19:55:56,454 INFO L226 Difference]: Without dead ends: 124180 [2019-12-18 19:55:56,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:55:57,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124180 states. [2019-12-18 19:56:02,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124180 to 94624. [2019-12-18 19:56:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94624 states. [2019-12-18 19:56:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94624 states to 94624 states and 372418 transitions. [2019-12-18 19:56:03,043 INFO L78 Accepts]: Start accepts. Automaton has 94624 states and 372418 transitions. Word has length 35 [2019-12-18 19:56:03,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:03,044 INFO L462 AbstractCegarLoop]: Abstraction has 94624 states and 372418 transitions. [2019-12-18 19:56:03,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:56:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 94624 states and 372418 transitions. [2019-12-18 19:56:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 19:56:03,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:03,171 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] [2019-12-18 19:56:03,171 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:56:03,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:03,172 INFO L82 PathProgramCache]: Analyzing trace with hash -886308380, now seen corresponding path program 2 times [2019-12-18 19:56:03,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:03,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098373179] [2019-12-18 19:56:03,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:03,280 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-18 19:56:03,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098373179] [2019-12-18 19:56:03,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:03,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:56:03,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639697359] [2019-12-18 19:56:03,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:56:03,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:03,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:56:03,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:56:03,283 INFO L87 Difference]: Start difference. First operand 94624 states and 372418 transitions. Second operand 7 states. [2019-12-18 19:56:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:05,226 INFO L93 Difference]: Finished difference Result 171222 states and 668853 transitions. [2019-12-18 19:56:05,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 19:56:05,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-18 19:56:05,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:05,654 INFO L225 Difference]: With dead ends: 171222 [2019-12-18 19:56:05,654 INFO L226 Difference]: Without dead ends: 156566 [2019-12-18 19:56:05,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:56:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156566 states. [2019-12-18 19:56:09,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156566 to 105060. [2019-12-18 19:56:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105060 states. [2019-12-18 19:56:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105060 states to 105060 states and 412178 transitions. [2019-12-18 19:56:16,687 INFO L78 Accepts]: Start accepts. Automaton has 105060 states and 412178 transitions. Word has length 35 [2019-12-18 19:56:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:16,688 INFO L462 AbstractCegarLoop]: Abstraction has 105060 states and 412178 transitions. [2019-12-18 19:56:16,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:56:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 105060 states and 412178 transitions. [2019-12-18 19:56:16,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 19:56:16,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:16,836 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] [2019-12-18 19:56:16,836 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:56:16,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:16,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2020210776, now seen corresponding path program 3 times [2019-12-18 19:56:16,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:16,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500001456] [2019-12-18 19:56:16,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:16,915 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-18 19:56:16,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500001456] [2019-12-18 19:56:16,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:16,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:56:16,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805183062] [2019-12-18 19:56:16,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:56:16,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:16,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:56:16,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:56:16,917 INFO L87 Difference]: Start difference. First operand 105060 states and 412178 transitions. Second operand 6 states. [2019-12-18 19:56:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:18,055 INFO L93 Difference]: Finished difference Result 167424 states and 656608 transitions. [2019-12-18 19:56:18,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:56:18,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-18 19:56:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:18,471 INFO L225 Difference]: With dead ends: 167424 [2019-12-18 19:56:18,471 INFO L226 Difference]: Without dead ends: 159194 [2019-12-18 19:56:18,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:56:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159194 states. [2019-12-18 19:56:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159194 to 105020. [2019-12-18 19:56:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105020 states. [2019-12-18 19:56:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105020 states to 105020 states and 412020 transitions. [2019-12-18 19:56:22,452 INFO L78 Accepts]: Start accepts. Automaton has 105020 states and 412020 transitions. Word has length 35 [2019-12-18 19:56:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:22,452 INFO L462 AbstractCegarLoop]: Abstraction has 105020 states and 412020 transitions. [2019-12-18 19:56:22,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:56:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 105020 states and 412020 transitions. [2019-12-18 19:56:22,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 19:56:22,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:22,592 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] [2019-12-18 19:56:22,592 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:56:22,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:22,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1148110232, now seen corresponding path program 4 times [2019-12-18 19:56:22,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:22,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578703360] [2019-12-18 19:56:22,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:22,657 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-18 19:56:22,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578703360] [2019-12-18 19:56:22,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:22,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:56:22,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331659702] [2019-12-18 19:56:22,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:56:22,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:22,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:56:22,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:56:22,659 INFO L87 Difference]: Start difference. First operand 105020 states and 412020 transitions. Second operand 7 states. [2019-12-18 19:56:24,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:24,900 INFO L93 Difference]: Finished difference Result 185856 states and 732208 transitions. [2019-12-18 19:56:24,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 19:56:24,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-18 19:56:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:25,366 INFO L225 Difference]: With dead ends: 185856 [2019-12-18 19:56:25,367 INFO L226 Difference]: Without dead ends: 177680 [2019-12-18 19:56:25,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:56:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177680 states. [2019-12-18 19:56:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177680 to 104956. [2019-12-18 19:56:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104956 states. [2019-12-18 19:56:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104956 states to 104956 states and 411732 transitions. [2019-12-18 19:56:30,650 INFO L78 Accepts]: Start accepts. Automaton has 104956 states and 411732 transitions. Word has length 35 [2019-12-18 19:56:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:30,650 INFO L462 AbstractCegarLoop]: Abstraction has 104956 states and 411732 transitions. [2019-12-18 19:56:30,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:56:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 104956 states and 411732 transitions. [2019-12-18 19:56:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 19:56:30,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:30,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:56:30,790 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:56:30,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:30,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1042607988, now seen corresponding path program 5 times [2019-12-18 19:56:30,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:30,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898259834] [2019-12-18 19:56:30,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:30,934 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-18 19:56:30,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898259834] [2019-12-18 19:56:30,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:30,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 19:56:30,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760087288] [2019-12-18 19:56:30,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 19:56:30,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:30,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 19:56:30,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:56:30,938 INFO L87 Difference]: Start difference. First operand 104956 states and 411732 transitions. Second operand 10 states. [2019-12-18 19:56:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:33,368 INFO L93 Difference]: Finished difference Result 177638 states and 700321 transitions. [2019-12-18 19:56:33,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 19:56:33,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-12-18 19:56:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:33,827 INFO L225 Difference]: With dead ends: 177638 [2019-12-18 19:56:33,827 INFO L226 Difference]: Without dead ends: 169622 [2019-12-18 19:56:33,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2019-12-18 19:56:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169622 states. [2019-12-18 19:56:41,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169622 to 108136. [2019-12-18 19:56:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108136 states. [2019-12-18 19:56:41,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108136 states to 108136 states and 425106 transitions. [2019-12-18 19:56:41,752 INFO L78 Accepts]: Start accepts. Automaton has 108136 states and 425106 transitions. Word has length 35 [2019-12-18 19:56:41,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:41,752 INFO L462 AbstractCegarLoop]: Abstraction has 108136 states and 425106 transitions. [2019-12-18 19:56:41,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 19:56:41,752 INFO L276 IsEmpty]: Start isEmpty. Operand 108136 states and 425106 transitions. [2019-12-18 19:56:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 19:56:41,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:41,898 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] [2019-12-18 19:56:41,899 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:56:41,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:41,899 INFO L82 PathProgramCache]: Analyzing trace with hash -718534728, now seen corresponding path program 6 times [2019-12-18 19:56:41,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:41,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928047114] [2019-12-18 19:56:41,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:41,957 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-18 19:56:41,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928047114] [2019-12-18 19:56:41,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:41,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:56:41,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363584328] [2019-12-18 19:56:41,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:56:41,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:41,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:56:41,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:56:41,959 INFO L87 Difference]: Start difference. First operand 108136 states and 425106 transitions. Second operand 7 states. [2019-12-18 19:56:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:44,593 INFO L93 Difference]: Finished difference Result 174216 states and 686050 transitions. [2019-12-18 19:56:44,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 19:56:44,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-18 19:56:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:45,027 INFO L225 Difference]: With dead ends: 174216 [2019-12-18 19:56:45,028 INFO L226 Difference]: Without dead ends: 166960 [2019-12-18 19:56:45,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:56:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166960 states. [2019-12-18 19:56:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166960 to 107628. [2019-12-18 19:56:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107628 states. [2019-12-18 19:56:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107628 states to 107628 states and 423068 transitions. [2019-12-18 19:56:53,012 INFO L78 Accepts]: Start accepts. Automaton has 107628 states and 423068 transitions. Word has length 35 [2019-12-18 19:56:53,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:53,012 INFO L462 AbstractCegarLoop]: Abstraction has 107628 states and 423068 transitions. [2019-12-18 19:56:53,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:56:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 107628 states and 423068 transitions. [2019-12-18 19:56:53,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 19:56:53,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:53,161 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] [2019-12-18 19:56:53,161 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:56:53,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:53,161 INFO L82 PathProgramCache]: Analyzing trace with hash 954140499, now seen corresponding path program 1 times [2019-12-18 19:56:53,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:53,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661741355] [2019-12-18 19:56:53,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:53,229 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-18 19:56:53,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661741355] [2019-12-18 19:56:53,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:53,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:56:53,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870568368] [2019-12-18 19:56:53,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:56:53,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:53,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:56:53,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:56:53,231 INFO L87 Difference]: Start difference. First operand 107628 states and 423068 transitions. Second operand 5 states. [2019-12-18 19:56:54,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:54,054 INFO L93 Difference]: Finished difference Result 15280 states and 52579 transitions. [2019-12-18 19:56:54,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:56:54,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-18 19:56:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:54,069 INFO L225 Difference]: With dead ends: 15280 [2019-12-18 19:56:54,069 INFO L226 Difference]: Without dead ends: 8420 [2019-12-18 19:56:54,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:56:54,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8420 states. [2019-12-18 19:56:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8420 to 7360. [2019-12-18 19:56:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7360 states. [2019-12-18 19:56:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7360 states to 7360 states and 21342 transitions. [2019-12-18 19:56:54,163 INFO L78 Accepts]: Start accepts. Automaton has 7360 states and 21342 transitions. Word has length 36 [2019-12-18 19:56:54,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:54,164 INFO L462 AbstractCegarLoop]: Abstraction has 7360 states and 21342 transitions. [2019-12-18 19:56:54,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:56:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand 7360 states and 21342 transitions. [2019-12-18 19:56:54,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 19:56:54,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:54,171 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-18 19:56:54,171 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:56:54,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:54,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1591197695, now seen corresponding path program 1 times [2019-12-18 19:56:54,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:54,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811564398] [2019-12-18 19:56:54,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:54,221 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-18 19:56:54,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811564398] [2019-12-18 19:56:54,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:54,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:56:54,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459366300] [2019-12-18 19:56:54,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:56:54,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:54,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:56:54,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:56:54,223 INFO L87 Difference]: Start difference. First operand 7360 states and 21342 transitions. Second operand 4 states. [2019-12-18 19:56:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:54,264 INFO L93 Difference]: Finished difference Result 8364 states and 23610 transitions. [2019-12-18 19:56:54,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:56:54,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 19:56:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:54,278 INFO L225 Difference]: With dead ends: 8364 [2019-12-18 19:56:54,278 INFO L226 Difference]: Without dead ends: 7371 [2019-12-18 19:56:54,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:56:54,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7371 states. [2019-12-18 19:56:54,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7371 to 7353. [2019-12-18 19:56:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7353 states. [2019-12-18 19:56:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7353 states to 7353 states and 21257 transitions. [2019-12-18 19:56:54,407 INFO L78 Accepts]: Start accepts. Automaton has 7353 states and 21257 transitions. Word has length 47 [2019-12-18 19:56:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:54,407 INFO L462 AbstractCegarLoop]: Abstraction has 7353 states and 21257 transitions. [2019-12-18 19:56:54,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:56:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 7353 states and 21257 transitions. [2019-12-18 19:56:54,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 19:56:54,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:54,419 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-18 19:56:54,419 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:56:54,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:54,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1988438419, now seen corresponding path program 2 times [2019-12-18 19:56:54,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:54,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997602227] [2019-12-18 19:56:54,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:54,486 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-18 19:56:54,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997602227] [2019-12-18 19:56:54,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:54,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:56:54,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899480271] [2019-12-18 19:56:54,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:56:54,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:54,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:56:54,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:56:54,492 INFO L87 Difference]: Start difference. First operand 7353 states and 21257 transitions. Second operand 4 states. [2019-12-18 19:56:54,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:54,567 INFO L93 Difference]: Finished difference Result 11438 states and 31329 transitions. [2019-12-18 19:56:54,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:56:54,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 19:56:54,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:54,574 INFO L225 Difference]: With dead ends: 11438 [2019-12-18 19:56:54,574 INFO L226 Difference]: Without dead ends: 4301 [2019-12-18 19:56:54,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:56:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2019-12-18 19:56:54,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 4301. [2019-12-18 19:56:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4301 states. [2019-12-18 19:56:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4301 states to 4301 states and 10556 transitions. [2019-12-18 19:56:54,663 INFO L78 Accepts]: Start accepts. Automaton has 4301 states and 10556 transitions. Word has length 47 [2019-12-18 19:56:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:54,663 INFO L462 AbstractCegarLoop]: Abstraction has 4301 states and 10556 transitions. [2019-12-18 19:56:54,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:56:54,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4301 states and 10556 transitions. [2019-12-18 19:56:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 19:56:54,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:54,671 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-18 19:56:54,671 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:56:54,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:54,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1930278651, now seen corresponding path program 3 times [2019-12-18 19:56:54,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:54,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210923477] [2019-12-18 19:56:54,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:54,778 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-18 19:56:54,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210923477] [2019-12-18 19:56:54,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:54,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:56:54,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987767787] [2019-12-18 19:56:54,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:56:54,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:54,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:56:54,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:56:54,782 INFO L87 Difference]: Start difference. First operand 4301 states and 10556 transitions. Second operand 6 states. [2019-12-18 19:56:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:54,872 INFO L93 Difference]: Finished difference Result 3106 states and 7813 transitions. [2019-12-18 19:56:54,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:56:54,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-18 19:56:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:54,874 INFO L225 Difference]: With dead ends: 3106 [2019-12-18 19:56:54,874 INFO L226 Difference]: Without dead ends: 425 [2019-12-18 19:56:54,875 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-18 19:56:54,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-12-18 19:56:54,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2019-12-18 19:56:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-12-18 19:56:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 920 transitions. [2019-12-18 19:56:54,881 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 920 transitions. Word has length 47 [2019-12-18 19:56:54,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:54,882 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 920 transitions. [2019-12-18 19:56:54,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:56:54,882 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 920 transitions. [2019-12-18 19:56:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 19:56:54,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:54,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:56:54,883 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:56:54,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:54,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1123212478, now seen corresponding path program 1 times [2019-12-18 19:56:54,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:54,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805236579] [2019-12-18 19:56:54,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:56:54,998 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-18 19:56:54,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805236579] [2019-12-18 19:56:54,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:56:54,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:56:54,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469059556] [2019-12-18 19:56:55,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:56:55,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:56:55,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:56:55,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:56:55,000 INFO L87 Difference]: Start difference. First operand 425 states and 920 transitions. Second operand 8 states. [2019-12-18 19:56:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:56:55,205 INFO L93 Difference]: Finished difference Result 921 states and 1962 transitions. [2019-12-18 19:56:55,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:56:55,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 19:56:55,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:56:55,206 INFO L225 Difference]: With dead ends: 921 [2019-12-18 19:56:55,206 INFO L226 Difference]: Without dead ends: 678 [2019-12-18 19:56:55,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:56:55,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-12-18 19:56:55,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 514. [2019-12-18 19:56:55,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-12-18 19:56:55,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1081 transitions. [2019-12-18 19:56:55,214 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1081 transitions. Word has length 63 [2019-12-18 19:56:55,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:56:55,215 INFO L462 AbstractCegarLoop]: Abstraction has 514 states and 1081 transitions. [2019-12-18 19:56:55,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:56:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1081 transitions. [2019-12-18 19:56:55,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 19:56:55,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:56:55,216 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:56:55,216 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:56:55,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:56:55,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1377954014, now seen corresponding path program 2 times [2019-12-18 19:56:55,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:56:55,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34372374] [2019-12-18 19:56:55,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:56:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:56:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:56:55,391 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:56:55,391 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:56:55,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= v_~y$w_buff1_used~0_73 0) (= |v_ULTIMATE.start_main_~#t17~0.offset_19| 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= |v_#valid_56| (store .cse0 |v_ULTIMATE.start_main_~#t17~0.base_24| 1)) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$r_buff1_thd2~0_31) (= v_~__unbuffered_p1_EBX~0_14 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t17~0.base_24|)) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard0~0_12 0) (= v_~y~0_30 0) (= v_~y$r_buff0_thd1~0_9 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~weak$$choice2~0_34) (= v_~x~0_10 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t17~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t17~0.base_24|) |v_ULTIMATE.start_main_~#t17~0.offset_19| 0))) (= 0 v_~y$w_buff1~0_31) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$mem_tmp~0_11 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff1_thd1~0_9 0) (= v_~y$r_buff0_thd3~0_76 0) (= 0 v_~y$flush_delayed~0_18) (= 0 v_~__unbuffered_cnt~0_19) (= 0 v_~y$w_buff0~0_37) (= v_~y$r_buff0_thd0~0_21 0) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~y$r_buff0_thd2~0_55 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 v_~z~0_9) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~y$w_buff0_used~0_133 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t17~0.base_24| 4)) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t17~0.base_24|) (= v_~__unbuffered_p0_EBX~0_16 0) (= 0 v_~y$r_buff1_thd3~0_39) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t19~0.base=|v_ULTIMATE.start_main_~#t19~0.base_19|, ULTIMATE.start_main_~#t18~0.base=|v_ULTIMATE.start_main_~#t18~0.base_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_16, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_13|, ULTIMATE.start_main_~#t17~0.offset=|v_ULTIMATE.start_main_~#t17~0.offset_19|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_25|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_11|, ~y$w_buff1~0=v_~y$w_buff1~0_31, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, ULTIMATE.start_main_~#t18~0.offset=|v_ULTIMATE.start_main_~#t18~0.offset_16|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_10, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_133, ULTIMATE.start_main_~#t19~0.offset=|v_ULTIMATE.start_main_~#t19~0.offset_16|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_~#t17~0.base=|v_ULTIMATE.start_main_~#t17~0.base_24|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_76, ~y~0=v_~y~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_31, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_73} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t19~0.base, ULTIMATE.start_main_~#t18~0.base, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t17~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t18~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t19~0.offset, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t17~0.base, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:56:55,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L840-1-->L842: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t18~0.base_11| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t18~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t18~0.base_11|) |v_ULTIMATE.start_main_~#t18~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t18~0.base_11| 1)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t18~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t18~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t18~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t18~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t18~0.base=|v_ULTIMATE.start_main_~#t18~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t18~0.offset=|v_ULTIMATE.start_main_~#t18~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t18~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t18~0.offset, #length] because there is no mapped edge [2019-12-18 19:56:55,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L842-1-->L844: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t19~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t19~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t19~0.base_11|) |v_ULTIMATE.start_main_~#t19~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t19~0.base_11|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t19~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t19~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t19~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t19~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t19~0.offset=|v_ULTIMATE.start_main_~#t19~0.offset_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t19~0.base=|v_ULTIMATE.start_main_~#t19~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t19~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t19~0.base] because there is no mapped edge [2019-12-18 19:56:55,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_57 256) 0) (= v_~y$w_buff0~0_26 v_~y$w_buff1~0_21) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= 1 v_~y$w_buff0~0_25) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff0_used~0_104 1) (= v_~y$w_buff1_used~0_57 v_~y$w_buff0_used~0_105)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff0~0=v_~y$w_buff0~0_26, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_25, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 19:56:55,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1160063171 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1160063171 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In-1160063171 |P2Thread1of1ForFork0_#t~ite28_Out-1160063171|) (not .cse1)) (and (= ~y$w_buff1~0_In-1160063171 |P2Thread1of1ForFork0_#t~ite28_Out-1160063171|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1160063171, ~y$w_buff1~0=~y$w_buff1~0_In-1160063171, ~y$w_buff0~0=~y$w_buff0~0_In-1160063171, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1160063171} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1160063171|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1160063171, ~y$w_buff1~0=~y$w_buff1~0_In-1160063171, ~y$w_buff0~0=~y$w_buff0~0_In-1160063171, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1160063171} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 19:56:55,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_18 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-18 19:56:55,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_46 v_~y$r_buff0_thd3~0_45) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 19:56:55,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In598313138 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out598313138| ~y$mem_tmp~0_In598313138) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out598313138| ~y~0_In598313138)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In598313138, ~y$flush_delayed~0=~y$flush_delayed~0_In598313138, ~y~0=~y~0_In598313138} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out598313138|, ~y$mem_tmp~0=~y$mem_tmp~0_In598313138, ~y$flush_delayed~0=~y$flush_delayed~0_In598313138, ~y~0=~y~0_In598313138} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-18 19:56:55,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= 1 v_~z~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~__unbuffered_p0_EBX~0_7 v_~x~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~z~0_5)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z~0=v_~z~0_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 19:56:55,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-481431824 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-481431824 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out-481431824| ~y$w_buff0_used~0_In-481431824) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite51_Out-481431824| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-481431824, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-481431824} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-481431824, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-481431824, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-481431824|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-18 19:56:55,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In342919405 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In342919405 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In342919405 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In342919405 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out342919405| ~y$w_buff1_used~0_In342919405)) (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out342919405|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In342919405, ~y$w_buff0_used~0=~y$w_buff0_used~0_In342919405, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In342919405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In342919405} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In342919405, ~y$w_buff0_used~0=~y$w_buff0_used~0_In342919405, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In342919405, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out342919405|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In342919405} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-18 19:56:55,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In480168403 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In480168403 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In480168403 ~y$r_buff0_thd3~0_Out480168403)) (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out480168403 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In480168403, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In480168403} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In480168403, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out480168403, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out480168403|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-18 19:56:55,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1072285632 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-1072285632 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1072285632 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1072285632 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-1072285632 |P2Thread1of1ForFork0_#t~ite54_Out-1072285632|)) (and (= |P2Thread1of1ForFork0_#t~ite54_Out-1072285632| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1072285632, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1072285632, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1072285632, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1072285632} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1072285632, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1072285632, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1072285632|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1072285632, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1072285632} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-18 19:56:55,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~y$r_buff1_thd3~0_33 |v_P2Thread1of1ForFork0_#t~ite54_8|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 19:56:55,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In100872295 256) 0))) (or (and (= ~y~0_In100872295 |P1Thread1of1ForFork2_#t~ite25_Out100872295|) .cse0) (and (not .cse0) (= ~y$mem_tmp~0_In100872295 |P1Thread1of1ForFork2_#t~ite25_Out100872295|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In100872295, ~y$flush_delayed~0=~y$flush_delayed~0_In100872295, ~y~0=~y~0_In100872295} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In100872295, ~y$flush_delayed~0=~y$flush_delayed~0_In100872295, ~y~0=~y~0_In100872295, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out100872295|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 19:56:55,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L773-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~y~0_25) (= 0 v_~y$flush_delayed~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_25, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 19:56:55,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_93 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 19:56:55,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-1881458586| |ULTIMATE.start_main_#t~ite58_Out-1881458586|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1881458586 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1881458586 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite58_Out-1881458586| ~y~0_In-1881458586)) (and .cse2 (= ~y$w_buff1~0_In-1881458586 |ULTIMATE.start_main_#t~ite58_Out-1881458586|) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1881458586, ~y~0=~y~0_In-1881458586, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1881458586, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1881458586} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1881458586, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1881458586|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1881458586|, ~y~0=~y~0_In-1881458586, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1881458586, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1881458586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 19:56:55,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1916859571 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1916859571 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-1916859571|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1916859571 |ULTIMATE.start_main_#t~ite60_Out-1916859571|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1916859571, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1916859571} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1916859571|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1916859571, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1916859571} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 19:56:55,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-739885749 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-739885749 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-739885749 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-739885749 256) 0))) (or (and (= ~y$w_buff1_used~0_In-739885749 |ULTIMATE.start_main_#t~ite61_Out-739885749|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-739885749|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-739885749, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-739885749, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-739885749, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-739885749} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-739885749|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-739885749, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-739885749, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-739885749, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-739885749} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 19:56:55,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1418776567 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1418776567 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out1418776567| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite62_Out1418776567| ~y$r_buff0_thd0~0_In1418776567)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1418776567, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1418776567} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1418776567|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1418776567, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1418776567} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 19:56:55,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In-1832965530 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1832965530 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1832965530 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1832965530 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-1832965530|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In-1832965530 |ULTIMATE.start_main_#t~ite63_Out-1832965530|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1832965530, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1832965530, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1832965530, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1832965530} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1832965530|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1832965530, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1832965530, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1832965530, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1832965530} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 19:56:55,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_6) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~__unbuffered_p0_EAX~0_8 1) (= 0 v_~__unbuffered_p1_EBX~0_7) (= v_~__unbuffered_p2_EBX~0_7 0) (= |v_ULTIMATE.start_main_#t~ite63_11| v_~y$r_buff1_thd0~0_17)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:56:55,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:56:55 BasicIcfg [2019-12-18 19:56:55,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:56:55,608 INFO L168 Benchmark]: Toolchain (without parser) took 122673.03 ms. Allocated memory was 136.8 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 99.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 19:56:55,609 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 19:56:55,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 853.68 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.3 MB in the beginning and 151.3 MB in the end (delta: -52.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-18 19:56:55,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.45 ms. Allocated memory is still 200.8 MB. Free memory was 151.3 MB in the beginning and 148.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 19:56:55,611 INFO L168 Benchmark]: Boogie Preprocessor took 50.12 ms. Allocated memory is still 200.8 MB. Free memory was 148.5 MB in the beginning and 145.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 19:56:55,614 INFO L168 Benchmark]: RCFGBuilder took 976.64 ms. Allocated memory is still 200.8 MB. Free memory was 145.6 MB in the beginning and 90.1 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. [2019-12-18 19:56:55,615 INFO L168 Benchmark]: TraceAbstraction took 120706.24 ms. Allocated memory was 200.8 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 89.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 19:56:55,624 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.20 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 853.68 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.3 MB in the beginning and 151.3 MB in the end (delta: -52.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.45 ms. Allocated memory is still 200.8 MB. Free memory was 151.3 MB in the beginning and 148.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.12 ms. Allocated memory is still 200.8 MB. Free memory was 148.5 MB in the beginning and 145.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 976.64 ms. Allocated memory is still 200.8 MB. Free memory was 145.6 MB in the beginning and 90.1 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120706.24 ms. Allocated memory was 200.8 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 89.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 197 ProgramPointsBefore, 107 ProgramPointsAfterwards, 243 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 49 ConcurrentYvCompositions, 30 ChoiceCompositions, 9080 VarBasedMoverChecksPositive, 248 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 134958 CheckedPairsTotal, 125 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t17, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t18, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t19, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 y$flush_delayed = weak$$choice2 [L801] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L804] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L805] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 y = y$flush_delayed ? y$mem_tmp : y [L811] 3 y$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L755] 2 x = 1 [L758] 2 __unbuffered_p1_EAX = x [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L817] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L818] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L819] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L851] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L852] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L853] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 120.2s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 30.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5013 SDtfs, 6712 SDslu, 11231 SDs, 0 SdLazy, 3288 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108136occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 77.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 354706 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 708 NumberOfCodeBlocks, 708 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 625 ConstructedInterpolants, 0 QuantifiedInterpolants, 85381 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...