/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:29:40,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:29:40,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:29:40,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:29:40,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:29:40,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:29:40,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:29:40,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:29:40,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:29:40,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:29:40,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:29:40,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:29:40,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:29:40,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:29:40,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:29:40,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:29:40,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:29:40,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:29:40,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:29:40,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:29:40,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:29:40,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:29:40,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:29:40,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:29:40,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:29:40,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:29:40,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:29:40,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:29:40,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:29:40,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:29:40,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:29:40,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:29:40,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:29:40,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:29:40,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:29:40,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:29:40,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:29:40,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:29:40,828 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:29:40,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:29:40,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:29:40,833 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:29:40,867 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:29:40,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:29:40,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:29:40,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:29:40,871 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:29:40,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:29:40,871 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:29:40,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:29:40,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:29:40,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:29:40,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:29:40,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:29:40,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:29:40,873 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:29:40,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:29:40,873 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:29:40,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:29:40,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:29:40,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:29:40,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:29:40,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:29:40,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:29:40,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:29:40,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:29:40,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:29:40,875 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:29:40,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:29:40,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:29:40,876 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:29:41,180 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:29:41,195 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:29:41,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:29:41,199 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:29:41,200 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:29:41,200 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_power.opt.i [2019-12-18 17:29:41,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49f52c15/b7ac58465fab4b429205e017972474a0/FLAG27c63eb5a [2019-12-18 17:29:41,836 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:29:41,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.opt.i [2019-12-18 17:29:41,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49f52c15/b7ac58465fab4b429205e017972474a0/FLAG27c63eb5a [2019-12-18 17:29:42,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49f52c15/b7ac58465fab4b429205e017972474a0 [2019-12-18 17:29:42,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:29:42,177 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:29:42,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:29:42,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:29:42,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:29:42,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:29:42" (1/1) ... [2019-12-18 17:29:42,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7820f996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:42, skipping insertion in model container [2019-12-18 17:29:42,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:29:42" (1/1) ... [2019-12-18 17:29:42,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:29:42,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:29:42,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:29:42,802 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:29:42,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:29:42,955 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:29:42,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:42 WrapperNode [2019-12-18 17:29:42,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:29:42,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:29:42,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:29:42,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:29:42,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:42" (1/1) ... [2019-12-18 17:29:42,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:42" (1/1) ... [2019-12-18 17:29:43,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:29:43,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:29:43,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:29:43,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:29:43,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:42" (1/1) ... [2019-12-18 17:29:43,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:42" (1/1) ... [2019-12-18 17:29:43,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:42" (1/1) ... [2019-12-18 17:29:43,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:42" (1/1) ... [2019-12-18 17:29:43,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:42" (1/1) ... [2019-12-18 17:29:43,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:42" (1/1) ... [2019-12-18 17:29:43,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:42" (1/1) ... [2019-12-18 17:29:43,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:29:43,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:29:43,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:29:43,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:29:43,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:42" (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 17:29:43,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:29:43,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:29:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:29:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:29:43,154 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:29:43,154 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:29:43,155 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:29:43,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:29:43,156 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:29:43,156 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:29:43,159 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:29:43,159 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:29:43,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:29:43,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:29:43,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:29:43,163 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 17:29:44,028 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:29:44,028 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:29:44,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:29:44 BoogieIcfgContainer [2019-12-18 17:29:44,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:29:44,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:29:44,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:29:44,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:29:44,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:29:42" (1/3) ... [2019-12-18 17:29:44,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309da6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:29:44, skipping insertion in model container [2019-12-18 17:29:44,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:29:42" (2/3) ... [2019-12-18 17:29:44,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309da6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:29:44, skipping insertion in model container [2019-12-18 17:29:44,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:29:44" (3/3) ... [2019-12-18 17:29:44,043 INFO L109 eAbstractionObserver]: Analyzing ICFG mix044_power.opt.i [2019-12-18 17:29:44,054 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:29:44,055 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:29:44,067 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:29:44,068 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:29:44,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,130 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,130 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,133 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,151 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,151 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,165 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,165 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,166 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,166 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,166 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,166 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,166 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,167 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,168 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,169 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,170 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,171 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,172 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,173 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,177 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,177 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,181 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,181 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,184 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,185 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,187 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,188 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,188 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,188 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,188 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,188 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,189 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,189 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,189 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,189 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,189 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,190 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:29:44,205 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:29:44,226 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:29:44,226 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:29:44,226 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:29:44,227 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:29:44,227 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:29:44,227 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:29:44,227 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:29:44,227 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:29:44,244 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 17:29:44,246 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 17:29:44,333 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 17:29:44,334 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:29:44,350 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:29:44,372 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 17:29:44,417 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 17:29:44,417 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:29:44,424 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:29:44,441 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 17:29:44,442 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:29:49,512 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 17:29:49,642 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 17:29:49,669 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52490 [2019-12-18 17:29:49,669 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 17:29:49,673 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-18 17:29:52,667 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 37086 states. [2019-12-18 17:29:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 37086 states. [2019-12-18 17:29:52,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:29:52,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:52,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:29:52,676 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:52,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1862617909, now seen corresponding path program 1 times [2019-12-18 17:29:52,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:52,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569824811] [2019-12-18 17:29:52,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:52,919 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 17:29:52,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569824811] [2019-12-18 17:29:52,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:52,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:29:52,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118382926] [2019-12-18 17:29:52,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:29:52,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:52,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:29:52,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:29:52,945 INFO L87 Difference]: Start difference. First operand 37086 states. Second operand 3 states. [2019-12-18 17:29:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:53,678 INFO L93 Difference]: Finished difference Result 36830 states and 157144 transitions. [2019-12-18 17:29:53,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:29:53,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:29:53,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:54,341 INFO L225 Difference]: With dead ends: 36830 [2019-12-18 17:29:54,342 INFO L226 Difference]: Without dead ends: 36102 [2019-12-18 17:29:54,343 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 17:29:54,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-18 17:29:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-18 17:29:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-18 17:29:56,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 154176 transitions. [2019-12-18 17:29:56,256 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 154176 transitions. Word has length 9 [2019-12-18 17:29:56,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:29:56,258 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 154176 transitions. [2019-12-18 17:29:56,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:29:56,258 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 154176 transitions. [2019-12-18 17:29:56,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:29:56,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:29:56,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:29:56,268 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:29:56,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:29:56,268 INFO L82 PathProgramCache]: Analyzing trace with hash 290643941, now seen corresponding path program 1 times [2019-12-18 17:29:56,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:29:56,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764332605] [2019-12-18 17:29:56,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:29:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:29:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:29:56,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764332605] [2019-12-18 17:29:56,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:29:56,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:29:56,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922013391] [2019-12-18 17:29:56,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:29:56,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:29:56,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:29:56,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:29:56,367 INFO L87 Difference]: Start difference. First operand 36102 states and 154176 transitions. Second operand 4 states. [2019-12-18 17:29:58,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:29:58,924 INFO L93 Difference]: Finished difference Result 56134 states and 231868 transitions. [2019-12-18 17:29:58,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:29:58,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:29:58,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:29:59,259 INFO L225 Difference]: With dead ends: 56134 [2019-12-18 17:29:59,259 INFO L226 Difference]: Without dead ends: 56106 [2019-12-18 17:29:59,260 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 17:30:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-18 17:30:01,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 51222. [2019-12-18 17:30:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51222 states. [2019-12-18 17:30:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51222 states to 51222 states and 213628 transitions. [2019-12-18 17:30:01,614 INFO L78 Accepts]: Start accepts. Automaton has 51222 states and 213628 transitions. Word has length 15 [2019-12-18 17:30:01,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:01,614 INFO L462 AbstractCegarLoop]: Abstraction has 51222 states and 213628 transitions. [2019-12-18 17:30:01,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:30:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 51222 states and 213628 transitions. [2019-12-18 17:30:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:30:01,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:01,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:30:01,618 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:01,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:01,618 INFO L82 PathProgramCache]: Analyzing trace with hash -497322091, now seen corresponding path program 1 times [2019-12-18 17:30:01,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:01,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173018747] [2019-12-18 17:30:01,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:01,704 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 17:30:01,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173018747] [2019-12-18 17:30:01,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:01,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:30:01,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669171653] [2019-12-18 17:30:01,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:30:01,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:01,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:30:01,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:30:01,707 INFO L87 Difference]: Start difference. First operand 51222 states and 213628 transitions. Second operand 3 states. [2019-12-18 17:30:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:01,942 INFO L93 Difference]: Finished difference Result 40168 states and 154828 transitions. [2019-12-18 17:30:01,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:30:01,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 17:30:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:04,328 INFO L225 Difference]: With dead ends: 40168 [2019-12-18 17:30:04,337 INFO L226 Difference]: Without dead ends: 40168 [2019-12-18 17:30:04,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:30:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40168 states. [2019-12-18 17:30:05,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40168 to 40168. [2019-12-18 17:30:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40168 states. [2019-12-18 17:30:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40168 states to 40168 states and 154828 transitions. [2019-12-18 17:30:05,525 INFO L78 Accepts]: Start accepts. Automaton has 40168 states and 154828 transitions. Word has length 15 [2019-12-18 17:30:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:05,525 INFO L462 AbstractCegarLoop]: Abstraction has 40168 states and 154828 transitions. [2019-12-18 17:30:05,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:30:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 40168 states and 154828 transitions. [2019-12-18 17:30:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:30:05,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:05,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:30:05,529 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:05,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:05,529 INFO L82 PathProgramCache]: Analyzing trace with hash -13987850, now seen corresponding path program 1 times [2019-12-18 17:30:05,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:05,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17062135] [2019-12-18 17:30:05,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:30:05,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17062135] [2019-12-18 17:30:05,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:05,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:30:05,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358792609] [2019-12-18 17:30:05,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:30:05,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:05,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:30:05,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:30:05,591 INFO L87 Difference]: Start difference. First operand 40168 states and 154828 transitions. Second operand 4 states. [2019-12-18 17:30:05,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:05,664 INFO L93 Difference]: Finished difference Result 16680 states and 53353 transitions. [2019-12-18 17:30:05,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:30:05,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:30:05,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:05,704 INFO L225 Difference]: With dead ends: 16680 [2019-12-18 17:30:05,705 INFO L226 Difference]: Without dead ends: 16680 [2019-12-18 17:30:05,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:30:05,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16680 states. [2019-12-18 17:30:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16680 to 16680. [2019-12-18 17:30:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16680 states. [2019-12-18 17:30:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 53353 transitions. [2019-12-18 17:30:06,081 INFO L78 Accepts]: Start accepts. Automaton has 16680 states and 53353 transitions. Word has length 16 [2019-12-18 17:30:06,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:06,081 INFO L462 AbstractCegarLoop]: Abstraction has 16680 states and 53353 transitions. [2019-12-18 17:30:06,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:30:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 16680 states and 53353 transitions. [2019-12-18 17:30:06,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 17:30:06,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:06,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:30:06,084 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:06,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:06,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1397943155, now seen corresponding path program 1 times [2019-12-18 17:30:06,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:06,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476015818] [2019-12-18 17:30:06,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:06,142 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 17:30:06,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476015818] [2019-12-18 17:30:06,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:06,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:30:06,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669123969] [2019-12-18 17:30:06,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:30:06,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:06,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:30:06,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:30:06,145 INFO L87 Difference]: Start difference. First operand 16680 states and 53353 transitions. Second operand 5 states. [2019-12-18 17:30:06,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:06,188 INFO L93 Difference]: Finished difference Result 2823 states and 7312 transitions. [2019-12-18 17:30:06,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:30:06,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 17:30:06,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:06,193 INFO L225 Difference]: With dead ends: 2823 [2019-12-18 17:30:06,193 INFO L226 Difference]: Without dead ends: 2823 [2019-12-18 17:30:06,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:30:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-18 17:30:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2823. [2019-12-18 17:30:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2019-12-18 17:30:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 7312 transitions. [2019-12-18 17:30:06,232 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 7312 transitions. Word has length 17 [2019-12-18 17:30:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:06,232 INFO L462 AbstractCegarLoop]: Abstraction has 2823 states and 7312 transitions. [2019-12-18 17:30:06,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:30:06,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 7312 transitions. [2019-12-18 17:30:06,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:30:06,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:06,236 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] [2019-12-18 17:30:06,236 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:06,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:06,236 INFO L82 PathProgramCache]: Analyzing trace with hash 34035109, now seen corresponding path program 1 times [2019-12-18 17:30:06,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:06,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374289391] [2019-12-18 17:30:06,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:06,356 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 17:30:06,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374289391] [2019-12-18 17:30:06,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:06,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:30:06,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850793880] [2019-12-18 17:30:06,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:30:06,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:06,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:30:06,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:30:06,358 INFO L87 Difference]: Start difference. First operand 2823 states and 7312 transitions. Second operand 6 states. [2019-12-18 17:30:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:06,404 INFO L93 Difference]: Finished difference Result 1357 states and 3889 transitions. [2019-12-18 17:30:06,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:30:06,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 17:30:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:06,407 INFO L225 Difference]: With dead ends: 1357 [2019-12-18 17:30:06,407 INFO L226 Difference]: Without dead ends: 1357 [2019-12-18 17:30:06,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:30:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-18 17:30:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-18 17:30:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 17:30:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3489 transitions. [2019-12-18 17:30:06,427 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3489 transitions. Word has length 29 [2019-12-18 17:30:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:06,428 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3489 transitions. [2019-12-18 17:30:06,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:30:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3489 transitions. [2019-12-18 17:30:06,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:30:06,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:06,432 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] [2019-12-18 17:30:06,432 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:06,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:06,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2028178460, now seen corresponding path program 1 times [2019-12-18 17:30:06,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:06,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509793093] [2019-12-18 17:30:06,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:06,550 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 17:30:06,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509793093] [2019-12-18 17:30:06,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:06,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:30:06,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740425562] [2019-12-18 17:30:06,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:30:06,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:06,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:30:06,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:30:06,554 INFO L87 Difference]: Start difference. First operand 1217 states and 3489 transitions. Second operand 3 states. [2019-12-18 17:30:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:06,601 INFO L93 Difference]: Finished difference Result 1228 states and 3505 transitions. [2019-12-18 17:30:06,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:30:06,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:30:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:06,604 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 17:30:06,605 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 17:30:06,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 17:30:06,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 17:30:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-18 17:30:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-18 17:30:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3498 transitions. [2019-12-18 17:30:06,625 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3498 transitions. Word has length 58 [2019-12-18 17:30:06,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:06,627 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3498 transitions. [2019-12-18 17:30:06,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:30:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3498 transitions. [2019-12-18 17:30:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:30:06,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:06,632 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] [2019-12-18 17:30:06,632 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:06,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:06,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1114375606, now seen corresponding path program 1 times [2019-12-18 17:30:06,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:06,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40067052] [2019-12-18 17:30:06,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:30:06,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40067052] [2019-12-18 17:30:06,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:06,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:30:06,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596046154] [2019-12-18 17:30:06,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:30:06,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:06,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:30:06,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:30:06,720 INFO L87 Difference]: Start difference. First operand 1222 states and 3498 transitions. Second operand 3 states. [2019-12-18 17:30:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:06,772 INFO L93 Difference]: Finished difference Result 1228 states and 3497 transitions. [2019-12-18 17:30:06,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:30:06,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:30:06,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:06,775 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 17:30:06,775 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 17:30:06,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 17:30:06,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 17:30:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1223. [2019-12-18 17:30:06,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-18 17:30:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3492 transitions. [2019-12-18 17:30:06,792 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3492 transitions. Word has length 58 [2019-12-18 17:30:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:06,792 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3492 transitions. [2019-12-18 17:30:06,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:30:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3492 transitions. [2019-12-18 17:30:06,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:30:06,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:06,797 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] [2019-12-18 17:30:06,797 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:06,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:06,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1114895507, now seen corresponding path program 1 times [2019-12-18 17:30:06,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:06,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310470601] [2019-12-18 17:30:06,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:06,962 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 17:30:06,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310470601] [2019-12-18 17:30:06,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:06,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:30:06,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179938783] [2019-12-18 17:30:06,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:30:06,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:06,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:30:06,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:30:06,965 INFO L87 Difference]: Start difference. First operand 1223 states and 3492 transitions. Second operand 5 states. [2019-12-18 17:30:07,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:07,183 INFO L93 Difference]: Finished difference Result 1764 states and 5014 transitions. [2019-12-18 17:30:07,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:30:07,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 17:30:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:07,186 INFO L225 Difference]: With dead ends: 1764 [2019-12-18 17:30:07,187 INFO L226 Difference]: Without dead ends: 1764 [2019-12-18 17:30:07,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:30:07,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-12-18 17:30:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1419. [2019-12-18 17:30:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-18 17:30:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4068 transitions. [2019-12-18 17:30:07,212 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4068 transitions. Word has length 58 [2019-12-18 17:30:07,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:07,213 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 4068 transitions. [2019-12-18 17:30:07,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:30:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4068 transitions. [2019-12-18 17:30:07,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:30:07,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:07,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] [2019-12-18 17:30:07,217 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:07,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:07,217 INFO L82 PathProgramCache]: Analyzing trace with hash -217131029, now seen corresponding path program 2 times [2019-12-18 17:30:07,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:07,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647016361] [2019-12-18 17:30:07,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:07,340 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 17:30:07,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647016361] [2019-12-18 17:30:07,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:07,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:30:07,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416358520] [2019-12-18 17:30:07,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:30:07,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:07,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:30:07,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:30:07,342 INFO L87 Difference]: Start difference. First operand 1419 states and 4068 transitions. Second operand 6 states. [2019-12-18 17:30:07,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:07,703 INFO L93 Difference]: Finished difference Result 2370 states and 6731 transitions. [2019-12-18 17:30:07,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:30:07,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 17:30:07,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:07,708 INFO L225 Difference]: With dead ends: 2370 [2019-12-18 17:30:07,708 INFO L226 Difference]: Without dead ends: 2370 [2019-12-18 17:30:07,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:30:07,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2019-12-18 17:30:07,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 1503. [2019-12-18 17:30:07,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-12-18 17:30:07,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 4316 transitions. [2019-12-18 17:30:07,739 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 4316 transitions. Word has length 58 [2019-12-18 17:30:07,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:07,739 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 4316 transitions. [2019-12-18 17:30:07,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:30:07,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 4316 transitions. [2019-12-18 17:30:07,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:30:07,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:07,743 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] [2019-12-18 17:30:07,743 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:07,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:07,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1417485459, now seen corresponding path program 3 times [2019-12-18 17:30:07,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:07,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48122094] [2019-12-18 17:30:07,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:07,881 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 17:30:07,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48122094] [2019-12-18 17:30:07,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:07,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:30:07,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012836766] [2019-12-18 17:30:07,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:30:07,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:07,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:30:07,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:30:07,883 INFO L87 Difference]: Start difference. First operand 1503 states and 4316 transitions. Second operand 6 states. [2019-12-18 17:30:08,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:08,301 INFO L93 Difference]: Finished difference Result 2377 states and 6752 transitions. [2019-12-18 17:30:08,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:30:08,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 17:30:08,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:08,305 INFO L225 Difference]: With dead ends: 2377 [2019-12-18 17:30:08,306 INFO L226 Difference]: Without dead ends: 2377 [2019-12-18 17:30:08,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:30:08,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2019-12-18 17:30:08,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1691. [2019-12-18 17:30:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1691 states. [2019-12-18 17:30:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 4860 transitions. [2019-12-18 17:30:08,339 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 4860 transitions. Word has length 58 [2019-12-18 17:30:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:08,341 INFO L462 AbstractCegarLoop]: Abstraction has 1691 states and 4860 transitions. [2019-12-18 17:30:08,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:30:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 4860 transitions. [2019-12-18 17:30:08,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:30:08,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:08,345 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] [2019-12-18 17:30:08,345 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:08,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:08,346 INFO L82 PathProgramCache]: Analyzing trace with hash -687244225, now seen corresponding path program 4 times [2019-12-18 17:30:08,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:08,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982008795] [2019-12-18 17:30:08,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:08,503 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 17:30:08,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982008795] [2019-12-18 17:30:08,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:08,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:30:08,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771582474] [2019-12-18 17:30:08,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:30:08,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:08,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:30:08,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:30:08,506 INFO L87 Difference]: Start difference. First operand 1691 states and 4860 transitions. Second operand 7 states. [2019-12-18 17:30:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:08,943 INFO L93 Difference]: Finished difference Result 2634 states and 7483 transitions. [2019-12-18 17:30:08,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:30:08,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-18 17:30:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:08,948 INFO L225 Difference]: With dead ends: 2634 [2019-12-18 17:30:08,948 INFO L226 Difference]: Without dead ends: 2634 [2019-12-18 17:30:08,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:30:08,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2019-12-18 17:30:08,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1607. [2019-12-18 17:30:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-18 17:30:08,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 4612 transitions. [2019-12-18 17:30:08,973 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 4612 transitions. Word has length 58 [2019-12-18 17:30:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:08,973 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 4612 transitions. [2019-12-18 17:30:08,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:30:08,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 4612 transitions. [2019-12-18 17:30:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:30:08,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:08,977 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] [2019-12-18 17:30:08,977 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:08,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:08,978 INFO L82 PathProgramCache]: Analyzing trace with hash 658273713, now seen corresponding path program 1 times [2019-12-18 17:30:08,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:08,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266242340] [2019-12-18 17:30:08,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:30:09,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266242340] [2019-12-18 17:30:09,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:09,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:30:09,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972504122] [2019-12-18 17:30:09,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:30:09,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:09,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:30:09,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:30:09,220 INFO L87 Difference]: Start difference. First operand 1607 states and 4612 transitions. Second operand 12 states. [2019-12-18 17:30:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:10,499 INFO L93 Difference]: Finished difference Result 4023 states and 10606 transitions. [2019-12-18 17:30:10,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 17:30:10,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 17:30:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:10,504 INFO L225 Difference]: With dead ends: 4023 [2019-12-18 17:30:10,504 INFO L226 Difference]: Without dead ends: 2299 [2019-12-18 17:30:10,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=1007, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 17:30:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2019-12-18 17:30:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 1477. [2019-12-18 17:30:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1477 states. [2019-12-18 17:30:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 4172 transitions. [2019-12-18 17:30:10,535 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 4172 transitions. Word has length 59 [2019-12-18 17:30:10,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:10,535 INFO L462 AbstractCegarLoop]: Abstraction has 1477 states and 4172 transitions. [2019-12-18 17:30:10,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:30:10,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 4172 transitions. [2019-12-18 17:30:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:30:10,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:10,539 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] [2019-12-18 17:30:10,540 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:10,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:10,540 INFO L82 PathProgramCache]: Analyzing trace with hash 726022051, now seen corresponding path program 2 times [2019-12-18 17:30:10,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:10,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422849804] [2019-12-18 17:30:10,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:10,651 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 17:30:10,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422849804] [2019-12-18 17:30:10,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:10,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:30:10,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555407672] [2019-12-18 17:30:10,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:30:10,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:10,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:30:10,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:30:10,653 INFO L87 Difference]: Start difference. First operand 1477 states and 4172 transitions. Second operand 3 states. [2019-12-18 17:30:10,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:10,702 INFO L93 Difference]: Finished difference Result 1476 states and 4170 transitions. [2019-12-18 17:30:10,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:30:10,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 17:30:10,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:10,705 INFO L225 Difference]: With dead ends: 1476 [2019-12-18 17:30:10,705 INFO L226 Difference]: Without dead ends: 1476 [2019-12-18 17:30:10,706 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 17:30:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2019-12-18 17:30:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 951. [2019-12-18 17:30:10,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-12-18 17:30:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2688 transitions. [2019-12-18 17:30:10,727 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 2688 transitions. Word has length 59 [2019-12-18 17:30:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:10,728 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 2688 transitions. [2019-12-18 17:30:10,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:30:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 2688 transitions. [2019-12-18 17:30:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:30:10,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:10,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:30:10,731 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:10,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:10,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1147587362, now seen corresponding path program 1 times [2019-12-18 17:30:10,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:10,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434470197] [2019-12-18 17:30:10,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:10,905 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 17:30:10,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434470197] [2019-12-18 17:30:10,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:10,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:30:10,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982415818] [2019-12-18 17:30:10,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:30:10,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:10,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:30:10,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:30:10,907 INFO L87 Difference]: Start difference. First operand 951 states and 2688 transitions. Second operand 6 states. [2019-12-18 17:30:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:11,012 INFO L93 Difference]: Finished difference Result 1371 states and 3700 transitions. [2019-12-18 17:30:11,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:30:11,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 17:30:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:11,015 INFO L225 Difference]: With dead ends: 1371 [2019-12-18 17:30:11,015 INFO L226 Difference]: Without dead ends: 806 [2019-12-18 17:30:11,018 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 17:30:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-12-18 17:30:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 694. [2019-12-18 17:30:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-12-18 17:30:11,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1729 transitions. [2019-12-18 17:30:11,031 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1729 transitions. Word has length 59 [2019-12-18 17:30:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:11,031 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 1729 transitions. [2019-12-18 17:30:11,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:30:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1729 transitions. [2019-12-18 17:30:11,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:30:11,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:11,034 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] [2019-12-18 17:30:11,035 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:11,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:11,035 INFO L82 PathProgramCache]: Analyzing trace with hash 83225480, now seen corresponding path program 2 times [2019-12-18 17:30:11,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:11,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203024310] [2019-12-18 17:30:11,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:11,122 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 17:30:11,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203024310] [2019-12-18 17:30:11,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:11,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:30:11,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300146919] [2019-12-18 17:30:11,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:30:11,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:11,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:30:11,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:30:11,127 INFO L87 Difference]: Start difference. First operand 694 states and 1729 transitions. Second operand 3 states. [2019-12-18 17:30:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:11,144 INFO L93 Difference]: Finished difference Result 653 states and 1575 transitions. [2019-12-18 17:30:11,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:30:11,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 17:30:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:11,146 INFO L225 Difference]: With dead ends: 653 [2019-12-18 17:30:11,146 INFO L226 Difference]: Without dead ends: 653 [2019-12-18 17:30:11,146 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 17:30:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-18 17:30:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 605. [2019-12-18 17:30:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 17:30:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1453 transitions. [2019-12-18 17:30:11,157 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1453 transitions. Word has length 59 [2019-12-18 17:30:11,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:11,158 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1453 transitions. [2019-12-18 17:30:11,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:30:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1453 transitions. [2019-12-18 17:30:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:30:11,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:11,160 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] [2019-12-18 17:30:11,160 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:11,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:11,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1492443498, now seen corresponding path program 1 times [2019-12-18 17:30:11,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:11,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486957669] [2019-12-18 17:30:11,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:11,331 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 17:30:11,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486957669] [2019-12-18 17:30:11,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:11,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:30:11,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992812040] [2019-12-18 17:30:11,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:30:11,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:11,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:30:11,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:30:11,335 INFO L87 Difference]: Start difference. First operand 605 states and 1453 transitions. Second operand 7 states. [2019-12-18 17:30:11,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:11,460 INFO L93 Difference]: Finished difference Result 995 states and 2341 transitions. [2019-12-18 17:30:11,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:30:11,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-18 17:30:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:11,461 INFO L225 Difference]: With dead ends: 995 [2019-12-18 17:30:11,461 INFO L226 Difference]: Without dead ends: 269 [2019-12-18 17:30:11,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:30:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-12-18 17:30:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 237. [2019-12-18 17:30:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-18 17:30:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 414 transitions. [2019-12-18 17:30:11,465 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 414 transitions. Word has length 60 [2019-12-18 17:30:11,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:11,466 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 414 transitions. [2019-12-18 17:30:11,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:30:11,466 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 414 transitions. [2019-12-18 17:30:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:30:11,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:11,467 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] [2019-12-18 17:30:11,467 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:11,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:11,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1893006908, now seen corresponding path program 2 times [2019-12-18 17:30:11,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:11,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176897151] [2019-12-18 17:30:11,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:30:11,692 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 17:30:11,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176897151] [2019-12-18 17:30:11,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:30:11,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:30:11,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466039938] [2019-12-18 17:30:11,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:30:11,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:30:11,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:30:11,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:30:11,700 INFO L87 Difference]: Start difference. First operand 237 states and 414 transitions. Second operand 12 states. [2019-12-18 17:30:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:30:12,096 INFO L93 Difference]: Finished difference Result 387 states and 656 transitions. [2019-12-18 17:30:12,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 17:30:12,097 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 17:30:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:30:12,097 INFO L225 Difference]: With dead ends: 387 [2019-12-18 17:30:12,098 INFO L226 Difference]: Without dead ends: 355 [2019-12-18 17:30:12,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:30:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-12-18 17:30:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 345. [2019-12-18 17:30:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-18 17:30:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 599 transitions. [2019-12-18 17:30:12,103 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 599 transitions. Word has length 60 [2019-12-18 17:30:12,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:30:12,103 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 599 transitions. [2019-12-18 17:30:12,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:30:12,103 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 599 transitions. [2019-12-18 17:30:12,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:30:12,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:30:12,104 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] [2019-12-18 17:30:12,105 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:30:12,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:30:12,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1108974140, now seen corresponding path program 3 times [2019-12-18 17:30:12,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:30:12,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595296751] [2019-12-18 17:30:12,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:30:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:30:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:30:12,215 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:30:12,215 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:30:12,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~z$w_buff0_used~0_862 0) (= 0 v_~z$r_buff1_thd3~0_308) (= 0 v_~z$r_buff0_thd3~0_195) (= |v_#NULL.offset_7| 0) (= v_~z$r_buff1_thd1~0_233 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd0~0_427 0) (= v_~b~0_102 0) (= 0 |v_ULTIMATE.start_main_~#t1165~0.offset_16|) (= v_~y~0_38 0) (= v_~__unbuffered_cnt~0_109 0) (= 0 v_~z$flush_delayed~0_82) (= 0 v_~weak$$choice0~0_17) (= v_~z$w_buff1~0_400 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1165~0.base_19| 4) |v_#length_29|) (= v_~z$r_buff0_thd2~0_88 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p3_EAX~0_243 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1165~0.base_19|)) (= v_~z$r_buff0_thd0~0_435 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 0 v_~__unbuffered_p3_EBX~0_243) (= 0 v_~z$r_buff0_thd4~0_372) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1165~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1165~0.base_19|) |v_ULTIMATE.start_main_~#t1165~0.offset_16| 0)) |v_#memory_int_25|) (= v_~z$w_buff0~0_412 0) (= v_~weak$$choice2~0_150 0) (= 0 v_~z$r_buff1_thd4~0_281) (= v_~z~0_221 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff1_thd2~0_234 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1165~0.base_19|) (= 0 |v_#NULL.base_7|) (= v_~z$r_buff0_thd1~0_87 0) (= v_~x~0_42 0) (= v_~z$w_buff1_used~0_620 0) (= v_~main$tmp_guard1~0_25 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1165~0.base_19| 1)) (= v_~a~0_234 0) (= v_~main$tmp_guard0~0_24 0) (= v_~z$mem_tmp~0_23 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_234, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_44|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_101|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_38|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_120|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_57|, ULTIMATE.start_main_~#t1167~0.base=|v_ULTIMATE.start_main_~#t1167~0.base_21|, ULTIMATE.start_main_~#t1167~0.offset=|v_ULTIMATE.start_main_~#t1167~0.offset_16|, ~a~0=v_~a~0_234, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_435, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_372, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_243, #length=|v_#length_29|, ULTIMATE.start_main_~#t1165~0.offset=|v_ULTIMATE.start_main_~#t1165~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_45|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_620, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_82, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_36|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_69|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_233, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_195, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_42, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_281, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_43|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_40|, ~z$w_buff1~0=v_~z$w_buff1~0_400, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_34|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_36|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_55|, ULTIMATE.start_main_~#t1168~0.base=|v_ULTIMATE.start_main_~#t1168~0.base_22|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_427, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_28|, ~y~0=v_~y~0_38, ULTIMATE.start_main_~#t1165~0.base=|v_ULTIMATE.start_main_~#t1165~0.base_19|, ULTIMATE.start_main_~#t1166~0.offset=|v_ULTIMATE.start_main_~#t1166~0.offset_17|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_88, ULTIMATE.start_main_~#t1166~0.base=|v_ULTIMATE.start_main_~#t1166~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_862, ~z$w_buff0~0=v_~z$w_buff0~0_412, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_40|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_28|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_46|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_243, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_61|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_64|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ~b~0=v_~b~0_102, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_22|, ~z~0=v_~z~0_221, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_87, ULTIMATE.start_main_~#t1168~0.offset=|v_ULTIMATE.start_main_~#t1168~0.offset_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1167~0.base, ULTIMATE.start_main_~#t1167~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1165~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1168~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ULTIMATE.start_main_~#t1165~0.base, ULTIMATE.start_main_~#t1166~0.offset, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1166~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1168~0.offset] because there is no mapped edge [2019-12-18 17:30:12,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L833-1-->L835: Formula: (and (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1166~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1166~0.base_13|)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1166~0.base_13| 1)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1166~0.base_13|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1166~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t1166~0.offset_11|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1166~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1166~0.base_13|) |v_ULTIMATE.start_main_~#t1166~0.offset_11| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1166~0.base=|v_ULTIMATE.start_main_~#t1166~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1166~0.offset=|v_ULTIMATE.start_main_~#t1166~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1166~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1166~0.offset] because there is no mapped edge [2019-12-18 17:30:12,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1167~0.base_12|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1167~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1167~0.base_12|)) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1167~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1167~0.base_12|) |v_ULTIMATE.start_main_~#t1167~0.offset_10| 2))) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1167~0.base_12| 4) |v_#length_21|) (= 0 |v_ULTIMATE.start_main_~#t1167~0.offset_10|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1167~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1167~0.base=|v_ULTIMATE.start_main_~#t1167~0.base_12|, ULTIMATE.start_main_~#t1167~0.offset=|v_ULTIMATE.start_main_~#t1167~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1167~0.base, ULTIMATE.start_main_~#t1167~0.offset] because there is no mapped edge [2019-12-18 17:30:12,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L837-1-->L839: Formula: (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1168~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1168~0.base_12|) |v_ULTIMATE.start_main_~#t1168~0.offset_10| 3))) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1168~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1168~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1168~0.base_12| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1168~0.base_12|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1168~0.base_12| 4)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1168~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1168~0.base=|v_ULTIMATE.start_main_~#t1168~0.base_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1168~0.offset=|v_ULTIMATE.start_main_~#t1168~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1168~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1168~0.offset] because there is no mapped edge [2019-12-18 17:30:12,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_60 v_~z$r_buff1_thd0~0_36) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= v_~z$r_buff0_thd4~0_20 v_~z$r_buff1_thd4~0_14) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_19 1) (= v_~z$r_buff0_thd3~0_17 v_~z$r_buff1_thd3~0_11)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_20, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_14, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_36, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_19, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 17:30:12,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_~b~0_77 1) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~x~0_27 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, ~b~0=v_~b~0_77, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_27, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:30:12,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_12 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_28 v_~__unbuffered_p1_EAX~0_19) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_12) (= v_~x~0_32 2) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~y~0=v_~y~0_28} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_12, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~y~0=v_~y~0_28, ~x~0=v_~x~0_32, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:30:12,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In730845378 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In730845378 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In730845378 |P3Thread1of1ForFork3_#t~ite11_Out730845378|)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out730845378|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In730845378, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In730845378} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In730845378, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In730845378, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out730845378|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 17:30:12,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1519926139 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1519926139 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1519926139 |P2Thread1of1ForFork2_#t~ite3_Out-1519926139|) (not .cse1)) (and (= ~z~0_In-1519926139 |P2Thread1of1ForFork2_#t~ite3_Out-1519926139|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1519926139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1519926139, ~z$w_buff1~0=~z$w_buff1~0_In-1519926139, ~z~0=~z~0_In-1519926139} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1519926139|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1519926139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1519926139, ~z$w_buff1~0=~z$w_buff1~0_In-1519926139, ~z~0=~z~0_In-1519926139} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:30:12,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-626902411 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-626902411 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-626902411 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-626902411 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-626902411|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-626902411 |P3Thread1of1ForFork3_#t~ite12_Out-626902411|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-626902411, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-626902411, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-626902411, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-626902411} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-626902411, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-626902411, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-626902411, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-626902411, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-626902411|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 17:30:12,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In975567051 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In975567051 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out975567051 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out975567051 ~z$r_buff0_thd4~0_In975567051) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In975567051, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In975567051} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In975567051, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out975567051, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out975567051|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 17:30:12,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-577524003 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-577524003 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-577524003 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-577524003 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite14_Out-577524003| 0)) (and (= |P3Thread1of1ForFork3_#t~ite14_Out-577524003| ~z$r_buff1_thd4~0_In-577524003) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-577524003, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-577524003, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-577524003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-577524003} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-577524003, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-577524003, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-577524003|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-577524003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-577524003} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 17:30:12,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_32| v_~z$r_buff1_thd4~0_45) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_31|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 17:30:12,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_16| v_~z~0_56) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_16|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_11|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_15|, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 17:30:12,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In101880710 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In101880710 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out101880710| 0)) (and (= ~z$w_buff0_used~0_In101880710 |P2Thread1of1ForFork2_#t~ite5_Out101880710|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In101880710, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In101880710} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out101880710|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In101880710, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In101880710} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:30:12,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In398234109 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In398234109 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In398234109 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In398234109 256)))) (or (and (= ~z$w_buff1_used~0_In398234109 |P2Thread1of1ForFork2_#t~ite6_Out398234109|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite6_Out398234109| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In398234109, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In398234109, ~z$w_buff1_used~0=~z$w_buff1_used~0_In398234109, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In398234109} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out398234109|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In398234109, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In398234109, ~z$w_buff1_used~0=~z$w_buff1_used~0_In398234109, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In398234109} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:30:12,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1720523751 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1720523751 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-1720523751|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd3~0_In-1720523751 |P2Thread1of1ForFork2_#t~ite7_Out-1720523751|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1720523751, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1720523751} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1720523751, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1720523751, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1720523751|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:30:12,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1734327792 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1734327792 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1734327792 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1734327792 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite8_Out-1734327792| ~z$r_buff1_thd3~0_In-1734327792) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite8_Out-1734327792| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1734327792, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1734327792, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1734327792, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1734327792} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1734327792, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1734327792, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1734327792, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1734327792, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1734327792|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:30:12,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_30| v_~z$r_buff1_thd3~0_74) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_30|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_29|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:30:12,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_34) (= v_~main$tmp_guard0~0_13 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_13, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_12|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 17:30:12,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1952967033 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1952967033 256)))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out-1952967033| ~z~0_In-1952967033) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out-1952967033| ~z$w_buff1~0_In-1952967033)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1952967033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1952967033, ~z$w_buff1~0=~z$w_buff1~0_In-1952967033, ~z~0=~z~0_In-1952967033} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1952967033|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1952967033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1952967033, ~z$w_buff1~0=~z$w_buff1~0_In-1952967033, ~z~0=~z~0_In-1952967033} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 17:30:12,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_30 |v_ULTIMATE.start_main_#t~ite19_9|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|, ~z~0=v_~z~0_30, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:30:12,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In103357815 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In103357815 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In103357815 |ULTIMATE.start_main_#t~ite21_Out103357815|)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out103357815|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In103357815, ~z$w_buff0_used~0=~z$w_buff0_used~0_In103357815} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In103357815, ~z$w_buff0_used~0=~z$w_buff0_used~0_In103357815, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out103357815|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:30:12,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In443664262 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In443664262 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In443664262 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In443664262 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out443664262| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite22_Out443664262| ~z$w_buff1_used~0_In443664262) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In443664262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In443664262, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In443664262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In443664262} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In443664262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In443664262, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In443664262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In443664262, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out443664262|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:30:12,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1345816827 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1345816827 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite23_Out1345816827|)) (and (= ~z$r_buff0_thd0~0_In1345816827 |ULTIMATE.start_main_#t~ite23_Out1345816827|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1345816827, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1345816827} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1345816827, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1345816827, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1345816827|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:30:12,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1459689881 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1459689881 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1459689881 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1459689881 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite24_Out1459689881| ~z$r_buff1_thd0~0_In1459689881) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite24_Out1459689881| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1459689881, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1459689881, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1459689881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1459689881} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1459689881, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1459689881, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1459689881, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1459689881|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1459689881} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 17:30:12,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1096311948 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1096311948 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1096311948 256)) (and (= (mod ~z$w_buff1_used~0_In-1096311948 256) 0) .cse1) (and (= (mod ~z$r_buff1_thd0~0_In-1096311948 256) 0) .cse1))) (= ~z$w_buff1_used~0_In-1096311948 |ULTIMATE.start_main_#t~ite39_Out-1096311948|) (= |ULTIMATE.start_main_#t~ite40_Out-1096311948| |ULTIMATE.start_main_#t~ite39_Out-1096311948|)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1096311948| ~z$w_buff1_used~0_In-1096311948) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_In-1096311948| |ULTIMATE.start_main_#t~ite39_Out-1096311948|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1096311948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1096311948, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-1096311948|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1096311948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1096311948, ~weak$$choice2~0=~weak$$choice2~0_In-1096311948} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1096311948, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1096311948|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1096311948|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1096311948, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1096311948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1096311948, ~weak$$choice2~0=~weak$$choice2~0_In-1096311948} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:30:12,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_125 v_~z$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:30:12,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L862-->L862-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In298534916 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_In298534916| |ULTIMATE.start_main_#t~ite45_Out298534916|) (= ~z$r_buff1_thd0~0_In298534916 |ULTIMATE.start_main_#t~ite46_Out298534916|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite46_Out298534916| |ULTIMATE.start_main_#t~ite45_Out298534916|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In298534916 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In298534916 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In298534916 256)) (and (= (mod ~z$r_buff1_thd0~0_In298534916 256) 0) .cse1))) (= ~z$r_buff1_thd0~0_In298534916 |ULTIMATE.start_main_#t~ite45_Out298534916|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In298534916, ~z$w_buff0_used~0=~z$w_buff0_used~0_In298534916, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In298534916, ~z$w_buff1_used~0=~z$w_buff1_used~0_In298534916, ~weak$$choice2~0=~weak$$choice2~0_In298534916, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In298534916|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In298534916, ~z$w_buff0_used~0=~z$w_buff0_used~0_In298534916, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In298534916, ~z$w_buff1_used~0=~z$w_buff1_used~0_In298534916, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out298534916|, ~weak$$choice2~0=~weak$$choice2~0_In298534916, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out298534916|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:30:12,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L864-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_110) (not (= 0 (mod v_~z$flush_delayed~0_38 256))) (= 0 v_~z$flush_delayed~0_37) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_38} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~z~0=v_~z~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:30:12,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:30:12,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:30:12 BasicIcfg [2019-12-18 17:30:12,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:30:12,335 INFO L168 Benchmark]: Toolchain (without parser) took 30157.32 ms. Allocated memory was 139.5 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 102.7 MB in the beginning and 851.8 MB in the end (delta: -749.2 MB). Peak memory consumption was 705.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:30:12,335 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 17:30:12,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.81 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.2 MB in the beginning and 155.0 MB in the end (delta: -52.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:30:12,336 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.81 ms. Allocated memory is still 203.4 MB. Free memory was 155.0 MB in the beginning and 151.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:30:12,337 INFO L168 Benchmark]: Boogie Preprocessor took 40.13 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 149.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:30:12,338 INFO L168 Benchmark]: RCFGBuilder took 964.99 ms. Allocated memory is still 203.4 MB. Free memory was 149.0 MB in the beginning and 99.9 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:30:12,338 INFO L168 Benchmark]: TraceAbstraction took 28300.02 ms. Allocated memory was 203.4 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 99.2 MB in the beginning and 851.8 MB in the end (delta: -752.6 MB). Peak memory consumption was 638.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:30:12,342 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.81 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.2 MB in the beginning and 155.0 MB in the end (delta: -52.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.81 ms. Allocated memory is still 203.4 MB. Free memory was 155.0 MB in the beginning and 151.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.13 ms. Allocated memory is still 203.4 MB. Free memory was 151.7 MB in the beginning and 149.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 964.99 ms. Allocated memory is still 203.4 MB. Free memory was 149.0 MB in the beginning and 99.9 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28300.02 ms. Allocated memory was 203.4 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 99.2 MB in the beginning and 851.8 MB in the end (delta: -752.6 MB). Peak memory consumption was 638.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 181 ProgramPointsBefore, 92 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 4988 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 145 SemBasedMoverChecksPositive, 210 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 52490 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 1 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.9s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2015 SDtfs, 2245 SDslu, 4617 SDs, 0 SdLazy, 2425 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 39 SyntacticMatches, 14 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51222occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 9509 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 865 NumberOfCodeBlocks, 865 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 152153 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...