/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 13:22:39,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 13:22:39,079 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 13:22:39,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 13:22:39,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 13:22:39,134 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 13:22:39,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 13:22:39,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 13:22:39,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 13:22:39,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 13:22:39,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 13:22:39,142 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 13:22:39,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 13:22:39,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 13:22:39,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 13:22:39,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 13:22:39,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 13:22:39,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 13:22:39,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 13:22:39,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 13:22:39,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 13:22:39,153 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 13:22:39,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 13:22:39,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 13:22:39,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 13:22:39,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 13:22:39,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 13:22:39,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 13:22:39,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 13:22:39,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 13:22:39,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 13:22:39,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 13:22:39,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 13:22:39,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 13:22:39,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 13:22:39,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 13:22:39,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 13:22:39,164 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 13:22:39,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 13:22:39,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 13:22:39,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 13:22:39,166 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-16 13:22:39,188 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 13:22:39,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 13:22:39,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 13:22:39,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 13:22:39,190 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 13:22:39,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 13:22:39,190 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 13:22:39,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 13:22:39,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 13:22:39,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 13:22:39,191 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 13:22:39,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 13:22:39,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 13:22:39,191 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 13:22:39,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 13:22:39,192 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 13:22:39,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 13:22:39,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 13:22:39,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 13:22:39,192 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 13:22:39,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 13:22:39,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:22:39,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 13:22:39,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 13:22:39,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 13:22:39,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 13:22:39,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 13:22:39,194 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 13:22:39,194 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 13:22:39,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 13:22:39,195 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 13:22:39,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 13:22:39,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 13:22:39,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 13:22:39,523 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 13:22:39,523 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 13:22:39,525 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2020-10-16 13:22:39,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fbea0f1d7/7ff7ea65abea453c874357205106c144/FLAGac4307118 [2020-10-16 13:22:40,106 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 13:22:40,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2020-10-16 13:22:40,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fbea0f1d7/7ff7ea65abea453c874357205106c144/FLAGac4307118 [2020-10-16 13:22:40,389 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fbea0f1d7/7ff7ea65abea453c874357205106c144 [2020-10-16 13:22:40,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 13:22:40,400 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 13:22:40,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 13:22:40,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 13:22:40,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 13:22:40,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:22:40" (1/1) ... [2020-10-16 13:22:40,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56167900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:40, skipping insertion in model container [2020-10-16 13:22:40,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:22:40" (1/1) ... [2020-10-16 13:22:40,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 13:22:40,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 13:22:40,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:22:40,971 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 13:22:41,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:22:41,144 INFO L208 MainTranslator]: Completed translation [2020-10-16 13:22:41,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:41 WrapperNode [2020-10-16 13:22:41,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 13:22:41,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 13:22:41,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 13:22:41,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 13:22:41,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:41" (1/1) ... [2020-10-16 13:22:41,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:41" (1/1) ... [2020-10-16 13:22:41,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 13:22:41,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 13:22:41,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 13:22:41,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 13:22:41,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:41" (1/1) ... [2020-10-16 13:22:41,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:41" (1/1) ... [2020-10-16 13:22:41,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:41" (1/1) ... [2020-10-16 13:22:41,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:41" (1/1) ... [2020-10-16 13:22:41,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:41" (1/1) ... [2020-10-16 13:22:41,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:41" (1/1) ... [2020-10-16 13:22:41,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:41" (1/1) ... [2020-10-16 13:22:41,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 13:22:41,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 13:22:41,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 13:22:41,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 13:22:41,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:41" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-10-16 13:22:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 13:22:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 13:22:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 13:22:41,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 13:22:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 13:22:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 13:22:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 13:22:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 13:22:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 13:22:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 13:22:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 13:22:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 13:22:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 13:22:41,335 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 13:22:43,146 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 13:22:43,146 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 13:22:43,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:22:43 BoogieIcfgContainer [2020-10-16 13:22:43,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 13:22:43,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 13:22:43,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 13:22:43,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 13:22:43,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:22:40" (1/3) ... [2020-10-16 13:22:43,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6d0ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:22:43, skipping insertion in model container [2020-10-16 13:22:43,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:41" (2/3) ... [2020-10-16 13:22:43,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6d0ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:22:43, skipping insertion in model container [2020-10-16 13:22:43,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:22:43" (3/3) ... [2020-10-16 13:22:43,157 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_tso.oepc.i [2020-10-16 13:22:43,168 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 13:22:43,168 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 13:22:43,175 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 13:22:43,176 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 13:22:43,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,203 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,203 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,205 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,205 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,208 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,208 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,208 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,209 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,215 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,215 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,222 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,222 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,223 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,225 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,226 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:43,227 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 13:22:43,240 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 13:22:43,260 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 13:22:43,261 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 13:22:43,261 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 13:22:43,261 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 13:22:43,261 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 13:22:43,261 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 13:22:43,261 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 13:22:43,262 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 13:22:43,274 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 13:22:43,275 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-16 13:22:43,278 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-16 13:22:43,280 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-16 13:22:43,324 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-16 13:22:43,324 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 13:22:43,329 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 13:22:43,333 INFO L117 LiptonReduction]: Number of co-enabled transitions 1536 [2020-10-16 13:22:43,813 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 13:22:46,037 WARN L193 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2020-10-16 13:22:46,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-16 13:22:46,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:22:46,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 13:22:46,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:22:46,744 WARN L193 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 106 [2020-10-16 13:22:47,725 WARN L193 SmtUtils]: Spent 978.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2020-10-16 13:22:47,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-16 13:22:47,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:22:47,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 13:22:47,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:22:48,419 WARN L193 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 107 [2020-10-16 13:22:50,199 WARN L193 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 243 DAG size of output: 203 [2020-10-16 13:22:50,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 13:22:50,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:22:50,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 13:22:50,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:22:51,565 WARN L193 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-10-16 13:22:51,825 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 13:22:51,930 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 13:22:51,938 INFO L132 LiptonReduction]: Checked pairs total: 4174 [2020-10-16 13:22:51,938 INFO L134 LiptonReduction]: Total number of compositions: 80 [2020-10-16 13:22:51,944 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-16 13:22:51,994 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-16 13:22:51,996 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-16 13:22:52,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 13:22:52,003 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:52,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:52,004 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:52,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:52,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1913445642, now seen corresponding path program 1 times [2020-10-16 13:22:52,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:52,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173845432] [2020-10-16 13:22:52,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:22:52,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173845432] [2020-10-16 13:22:52,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:52,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:22:52,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1474577595] [2020-10-16 13:22:52,272 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:52,275 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:52,293 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-16 13:22:52,293 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:52,297 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:52,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:22:52,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:52,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:22:52,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:22:52,322 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-16 13:22:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:52,416 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-16 13:22:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:22:52,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 13:22:52,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:52,440 INFO L225 Difference]: With dead ends: 550 [2020-10-16 13:22:52,440 INFO L226 Difference]: Without dead ends: 450 [2020-10-16 13:22:52,441 INFO L677 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 [2020-10-16 13:22:52,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-16 13:22:52,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-16 13:22:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-16 13:22:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-16 13:22:52,529 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-16 13:22:52,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:52,530 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-16 13:22:52,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:22:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-16 13:22:52,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:22:52,531 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:52,532 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:52,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 13:22:52,532 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:52,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:52,533 INFO L82 PathProgramCache]: Analyzing trace with hash 575294358, now seen corresponding path program 1 times [2020-10-16 13:22:52,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:52,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766768753] [2020-10-16 13:22:52,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:22:52,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766768753] [2020-10-16 13:22:52,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:52,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:22:52,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2137632504] [2020-10-16 13:22:52,651 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:52,653 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:52,654 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-16 13:22:52,654 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:52,655 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:52,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:22:52,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:52,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:22:52,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:22:52,668 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-16 13:22:52,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:52,683 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-16 13:22:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:22:52,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 13:22:52,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:52,696 INFO L225 Difference]: With dead ends: 440 [2020-10-16 13:22:52,696 INFO L226 Difference]: Without dead ends: 440 [2020-10-16 13:22:52,697 INFO L677 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 [2020-10-16 13:22:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-16 13:22:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-16 13:22:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-16 13:22:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-16 13:22:52,719 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-10-16 13:22:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:52,720 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-16 13:22:52,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:22:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-16 13:22:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 13:22:52,721 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:52,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:52,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 13:22:52,722 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:52,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:52,722 INFO L82 PathProgramCache]: Analyzing trace with hash 654255379, now seen corresponding path program 1 times [2020-10-16 13:22:52,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:52,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662557770] [2020-10-16 13:22:52,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:22:52,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662557770] [2020-10-16 13:22:52,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:52,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:22:52,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [408533212] [2020-10-16 13:22:52,845 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:52,846 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:52,848 INFO L258 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-10-16 13:22:52,848 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:52,864 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:22:52,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:52,865 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:22:52,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:52,868 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:52,888 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:52,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:52,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:52,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:52,928 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:52,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:52,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:52,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:52,990 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:52,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:22:52,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:52,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:22:52,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:22:52,992 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 4 states. [2020-10-16 13:22:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:53,029 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-10-16 13:22:53,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:22:53,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-16 13:22:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:53,034 INFO L225 Difference]: With dead ends: 434 [2020-10-16 13:22:53,034 INFO L226 Difference]: Without dead ends: 434 [2020-10-16 13:22:53,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:22:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-16 13:22:53,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-16 13:22:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-16 13:22:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-10-16 13:22:53,049 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-10-16 13:22:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:53,050 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-10-16 13:22:53,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:22:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-10-16 13:22:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:22:53,052 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:53,052 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:53,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 13:22:53,052 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:53,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:53,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1192921599, now seen corresponding path program 1 times [2020-10-16 13:22:53,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:53,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864630123] [2020-10-16 13:22:53,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:22:53,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864630123] [2020-10-16 13:22:53,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:53,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:22:53,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [438659112] [2020-10-16 13:22:53,128 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:53,129 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:53,131 INFO L258 McrAutomatonBuilder]: Finished intersection with 16 states and 19 transitions. [2020-10-16 13:22:53,131 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:53,155 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:53,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:53,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:53,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:53,199 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:53,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:22:53,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:53,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:22:53,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:22:53,200 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 4 states. [2020-10-16 13:22:53,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:53,257 INFO L93 Difference]: Finished difference Result 438 states and 1309 transitions. [2020-10-16 13:22:53,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:22:53,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 13:22:53,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:53,261 INFO L225 Difference]: With dead ends: 438 [2020-10-16 13:22:53,261 INFO L226 Difference]: Without dead ends: 438 [2020-10-16 13:22:53,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:22:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-10-16 13:22:53,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2020-10-16 13:22:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-10-16 13:22:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1309 transitions. [2020-10-16 13:22:53,276 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1309 transitions. Word has length 11 [2020-10-16 13:22:53,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:53,276 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 1309 transitions. [2020-10-16 13:22:53,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:22:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1309 transitions. [2020-10-16 13:22:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:22:53,278 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:53,278 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:53,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 13:22:53,278 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:53,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:53,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1192920235, now seen corresponding path program 1 times [2020-10-16 13:22:53,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:53,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119689967] [2020-10-16 13:22:53,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:53,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:22:53,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119689967] [2020-10-16 13:22:53,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:53,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:22:53,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1976342721] [2020-10-16 13:22:53,503 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:53,504 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:53,507 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 21 transitions. [2020-10-16 13:22:53,507 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:53,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:53,519 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:53,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:53,523 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:53,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:53,533 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:53,539 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-16 13:22:53,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:53,590 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:53,617 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:53,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:22:53,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:53,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:22:53,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:22:53,619 INFO L87 Difference]: Start difference. First operand 438 states and 1309 transitions. Second operand 5 states. [2020-10-16 13:22:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:53,663 INFO L93 Difference]: Finished difference Result 426 states and 1265 transitions. [2020-10-16 13:22:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:22:53,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-16 13:22:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:53,668 INFO L225 Difference]: With dead ends: 426 [2020-10-16 13:22:53,668 INFO L226 Difference]: Without dead ends: 426 [2020-10-16 13:22:53,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:22:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-10-16 13:22:53,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2020-10-16 13:22:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-10-16 13:22:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1265 transitions. [2020-10-16 13:22:53,681 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1265 transitions. Word has length 11 [2020-10-16 13:22:53,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:53,681 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 1265 transitions. [2020-10-16 13:22:53,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:22:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1265 transitions. [2020-10-16 13:22:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:22:53,682 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:53,683 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:53,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 13:22:53,683 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:53,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:53,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1194181749, now seen corresponding path program 2 times [2020-10-16 13:22:53,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:53,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684297854] [2020-10-16 13:22:53,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:22:53,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684297854] [2020-10-16 13:22:53,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:53,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:22:53,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1870994432] [2020-10-16 13:22:53,760 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:53,762 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:53,764 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 23 transitions. [2020-10-16 13:22:53,764 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:53,781 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:53,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:22:53,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:53,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:22:53,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:22:53,782 INFO L87 Difference]: Start difference. First operand 426 states and 1265 transitions. Second operand 5 states. [2020-10-16 13:22:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:53,833 INFO L93 Difference]: Finished difference Result 414 states and 1224 transitions. [2020-10-16 13:22:53,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:22:53,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-16 13:22:53,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:53,841 INFO L225 Difference]: With dead ends: 414 [2020-10-16 13:22:53,841 INFO L226 Difference]: Without dead ends: 414 [2020-10-16 13:22:53,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:22:53,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2020-10-16 13:22:53,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 410. [2020-10-16 13:22:53,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-10-16 13:22:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1213 transitions. [2020-10-16 13:22:53,853 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1213 transitions. Word has length 11 [2020-10-16 13:22:53,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:53,854 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 1213 transitions. [2020-10-16 13:22:53,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:22:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1213 transitions. [2020-10-16 13:22:53,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 13:22:53,855 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:53,855 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:53,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 13:22:53,856 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:53,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:53,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1674135591, now seen corresponding path program 1 times [2020-10-16 13:22:53,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:53,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021916253] [2020-10-16 13:22:53,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:22:53,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021916253] [2020-10-16 13:22:53,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:53,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:22:53,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1590445865] [2020-10-16 13:22:53,972 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:53,974 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:53,978 INFO L258 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-10-16 13:22:53,978 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:53,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:53,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:53,998 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:54,004 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:54,008 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:22:54,054 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9330#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))))] [2020-10-16 13:22:54,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:22:54,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:54,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:22:54,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:54,055 INFO L87 Difference]: Start difference. First operand 410 states and 1213 transitions. Second operand 7 states. [2020-10-16 13:22:54,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:54,156 INFO L93 Difference]: Finished difference Result 434 states and 1271 transitions. [2020-10-16 13:22:54,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:22:54,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-10-16 13:22:54,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:54,162 INFO L225 Difference]: With dead ends: 434 [2020-10-16 13:22:54,162 INFO L226 Difference]: Without dead ends: 434 [2020-10-16 13:22:54,162 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:22:54,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-16 13:22:54,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 426. [2020-10-16 13:22:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-10-16 13:22:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1253 transitions. [2020-10-16 13:22:54,176 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1253 transitions. Word has length 12 [2020-10-16 13:22:54,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:54,176 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 1253 transitions. [2020-10-16 13:22:54,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:22:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1253 transitions. [2020-10-16 13:22:54,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:22:54,177 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:54,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:54,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 13:22:54,178 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash 358553942, now seen corresponding path program 1 times [2020-10-16 13:22:54,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:54,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455669513] [2020-10-16 13:22:54,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:22:54,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455669513] [2020-10-16 13:22:54,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:54,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:22:54,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1271872898] [2020-10-16 13:22:54,371 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:54,373 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:54,376 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 21 transitions. [2020-10-16 13:22:54,377 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:54,379 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:22:54,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:54,384 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:54,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:54,387 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:54,414 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:54,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:22:54,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:54,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:22:54,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:54,415 INFO L87 Difference]: Start difference. First operand 426 states and 1253 transitions. Second operand 7 states. [2020-10-16 13:22:54,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:54,529 INFO L93 Difference]: Finished difference Result 510 states and 1504 transitions. [2020-10-16 13:22:54,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:22:54,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-16 13:22:54,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:54,534 INFO L225 Difference]: With dead ends: 510 [2020-10-16 13:22:54,535 INFO L226 Difference]: Without dead ends: 510 [2020-10-16 13:22:54,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:22:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-10-16 13:22:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 486. [2020-10-16 13:22:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2020-10-16 13:22:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1422 transitions. [2020-10-16 13:22:54,551 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1422 transitions. Word has length 13 [2020-10-16 13:22:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:54,551 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 1422 transitions. [2020-10-16 13:22:54,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:22:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1422 transitions. [2020-10-16 13:22:54,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:22:54,552 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:54,553 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:54,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 13:22:54,553 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:54,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:54,553 INFO L82 PathProgramCache]: Analyzing trace with hash 358593932, now seen corresponding path program 2 times [2020-10-16 13:22:54,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:54,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213734979] [2020-10-16 13:22:54,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:54,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:22:54,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213734979] [2020-10-16 13:22:54,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:54,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:22:54,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1872317149] [2020-10-16 13:22:54,876 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:54,879 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:54,882 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 25 transitions. [2020-10-16 13:22:54,882 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:54,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:54,894 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:54,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:54,903 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:54,905 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:22:54,980 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12119#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff1~0)))] [2020-10-16 13:22:54,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 13:22:54,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:54,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 13:22:54,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:22:54,982 INFO L87 Difference]: Start difference. First operand 486 states and 1422 transitions. Second operand 8 states. [2020-10-16 13:22:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:55,191 INFO L93 Difference]: Finished difference Result 542 states and 1532 transitions. [2020-10-16 13:22:55,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:22:55,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-10-16 13:22:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:55,196 INFO L225 Difference]: With dead ends: 542 [2020-10-16 13:22:55,196 INFO L226 Difference]: Without dead ends: 470 [2020-10-16 13:22:55,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-16 13:22:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-10-16 13:22:55,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 386. [2020-10-16 13:22:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-10-16 13:22:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1107 transitions. [2020-10-16 13:22:55,210 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1107 transitions. Word has length 13 [2020-10-16 13:22:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:55,210 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 1107 transitions. [2020-10-16 13:22:55,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 13:22:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1107 transitions. [2020-10-16 13:22:55,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:22:55,212 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:55,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:55,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 13:22:55,212 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:55,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:55,212 INFO L82 PathProgramCache]: Analyzing trace with hash 359870388, now seen corresponding path program 1 times [2020-10-16 13:22:55,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:55,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831853541] [2020-10-16 13:22:55,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:22:55,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831853541] [2020-10-16 13:22:55,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:55,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:22:55,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1883954085] [2020-10-16 13:22:55,284 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:55,285 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:55,293 INFO L258 McrAutomatonBuilder]: Finished intersection with 21 states and 27 transitions. [2020-10-16 13:22:55,293 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:55,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:55,346 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [13442#(= (mod ~main$tmp_guard0~0 256) 0), 13443#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-16 13:22:55,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 13:22:55,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:55,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 13:22:55,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:22:55,347 INFO L87 Difference]: Start difference. First operand 386 states and 1107 transitions. Second operand 6 states. [2020-10-16 13:22:55,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:55,401 INFO L93 Difference]: Finished difference Result 283 states and 721 transitions. [2020-10-16 13:22:55,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:22:55,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-16 13:22:55,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:55,405 INFO L225 Difference]: With dead ends: 283 [2020-10-16 13:22:55,405 INFO L226 Difference]: Without dead ends: 183 [2020-10-16 13:22:55,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:22:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-10-16 13:22:55,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2020-10-16 13:22:55,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-10-16 13:22:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 406 transitions. [2020-10-16 13:22:55,411 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 406 transitions. Word has length 13 [2020-10-16 13:22:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:55,411 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 406 transitions. [2020-10-16 13:22:55,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 13:22:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 406 transitions. [2020-10-16 13:22:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 13:22:55,412 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:55,412 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:55,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 13:22:55,412 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:55,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:55,413 INFO L82 PathProgramCache]: Analyzing trace with hash 329564957, now seen corresponding path program 1 times [2020-10-16 13:22:55,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:55,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192542856] [2020-10-16 13:22:55,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:22:55,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192542856] [2020-10-16 13:22:55,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:55,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:22:55,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1055695305] [2020-10-16 13:22:55,464 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:55,466 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:55,469 INFO L258 McrAutomatonBuilder]: Finished intersection with 21 states and 24 transitions. [2020-10-16 13:22:55,470 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:55,478 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:55,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:22:55,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:55,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:22:55,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:22:55,479 INFO L87 Difference]: Start difference. First operand 183 states and 406 transitions. Second operand 3 states. [2020-10-16 13:22:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:55,489 INFO L93 Difference]: Finished difference Result 258 states and 551 transitions. [2020-10-16 13:22:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:22:55,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-16 13:22:55,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:55,491 INFO L225 Difference]: With dead ends: 258 [2020-10-16 13:22:55,491 INFO L226 Difference]: Without dead ends: 180 [2020-10-16 13:22:55,492 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:22:55,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-16 13:22:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2020-10-16 13:22:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-10-16 13:22:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 364 transitions. [2020-10-16 13:22:55,497 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 364 transitions. Word has length 16 [2020-10-16 13:22:55,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:55,498 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 364 transitions. [2020-10-16 13:22:55,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:22:55,498 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 364 transitions. [2020-10-16 13:22:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 13:22:55,498 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:55,499 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:55,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 13:22:55,499 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:55,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:55,499 INFO L82 PathProgramCache]: Analyzing trace with hash -85316920, now seen corresponding path program 1 times [2020-10-16 13:22:55,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:55,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400089685] [2020-10-16 13:22:55,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:55,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:22:55,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400089685] [2020-10-16 13:22:55,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:55,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:22:55,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [716243555] [2020-10-16 13:22:55,603 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:55,606 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:55,612 INFO L258 McrAutomatonBuilder]: Finished intersection with 29 states and 39 transitions. [2020-10-16 13:22:55,612 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:55,670 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [14720#(<= ~__unbuffered_cnt~0 0)] [2020-10-16 13:22:55,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:22:55,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:55,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:22:55,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:55,672 INFO L87 Difference]: Start difference. First operand 178 states and 364 transitions. Second operand 7 states. [2020-10-16 13:22:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:55,725 INFO L93 Difference]: Finished difference Result 161 states and 330 transitions. [2020-10-16 13:22:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:22:55,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-16 13:22:55,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:55,726 INFO L225 Difference]: With dead ends: 161 [2020-10-16 13:22:55,726 INFO L226 Difference]: Without dead ends: 85 [2020-10-16 13:22:55,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-16 13:22:55,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-16 13:22:55,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-10-16 13:22:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-16 13:22:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 168 transitions. [2020-10-16 13:22:55,734 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 168 transitions. Word has length 17 [2020-10-16 13:22:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:55,735 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 168 transitions. [2020-10-16 13:22:55,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:22:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 168 transitions. [2020-10-16 13:22:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 13:22:55,736 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:55,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:55,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 13:22:55,736 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:55,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:55,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1585187057, now seen corresponding path program 1 times [2020-10-16 13:22:55,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:55,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068525243] [2020-10-16 13:22:55,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:22:55,812 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:22:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:22:55,878 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:22:55,910 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 13:22:55,910 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 13:22:55,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 13:22:55,912 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 13:22:55,925 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L810-->L818: Formula: (let ((.cse9 (= (mod ~y$w_buff1_used~0_In-1329922597 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-1329922597 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In-1329922597 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In-1329922597 256) 0))) (let ((.cse2 (or .cse6 .cse7)) (.cse4 (not .cse8)) (.cse5 (not .cse9)) (.cse3 (or .cse8 .cse9)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1329922597 0)) (= ~y$r_buff1_thd0~0_In-1329922597 ~y$r_buff1_thd0~0_Out-1329922597) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1329922597| (mod ~main$tmp_guard0~0_In-1329922597 256)) (= ~y$r_buff0_thd0~0_Out-1329922597 ~y$r_buff0_thd0~0_In-1329922597) (or (and (= 0 ~y$w_buff0_used~0_Out-1329922597) .cse0 .cse1) (and .cse2 (= ~y$w_buff0_used~0_In-1329922597 ~y$w_buff0_used~0_Out-1329922597))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1329922597| ULTIMATE.start_assume_abort_if_not_~cond_Out-1329922597) (or (and (= ~y$w_buff1_used~0_Out-1329922597 ~y$w_buff1_used~0_In-1329922597) .cse3) (and (= ~y$w_buff1_used~0_Out-1329922597 0) .cse4 .cse5)) (or (and .cse2 (or (and .cse4 (= ~y$w_buff1~0_In-1329922597 ~y~0_Out-1329922597) .cse5) (and (= ~y~0_Out-1329922597 ~y~0_In-1329922597) .cse3))) (and .cse0 (= ~y~0_Out-1329922597 ~y$w_buff0~0_In-1329922597) .cse1))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1329922597, ~y$w_buff1~0=~y$w_buff1~0_In-1329922597, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1329922597, ~y$w_buff0~0=~y$w_buff0~0_In-1329922597, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1329922597, ~y~0=~y~0_In-1329922597, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1329922597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1329922597} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1329922597, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1329922597|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1329922597|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1329922597|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1329922597, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1329922597|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1329922597|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1329922597|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1329922597|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1329922597, ~y$w_buff1~0=~y$w_buff1~0_In-1329922597, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1329922597, ~y$w_buff0~0=~y$w_buff0~0_In-1329922597, ~y~0=~y~0_Out-1329922597, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1329922597, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1329922597} AuxVars[] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 13:22:55,930 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,931 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,932 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,932 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,933 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,933 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,933 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,933 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,933 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,934 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,934 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,934 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,934 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,935 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,935 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,935 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,935 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,935 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,935 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,936 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,936 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,936 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,937 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,937 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,937 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,937 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,937 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,938 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,938 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,938 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,938 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,938 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,938 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,939 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,939 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,939 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,939 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,939 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,939 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,940 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,940 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,940 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,940 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,940 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,941 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,941 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,941 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,941 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,941 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,941 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,942 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:22:55,942 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:55,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:22:55 BasicIcfg [2020-10-16 13:22:55,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 13:22:55,998 INFO L168 Benchmark]: Toolchain (without parser) took 15598.82 ms. Allocated memory was 141.0 MB in the beginning and 370.7 MB in the end (delta: 229.6 MB). Free memory was 102.9 MB in the beginning and 171.1 MB in the end (delta: -68.2 MB). Peak memory consumption was 161.5 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:55,999 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 13:22:56,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.90 ms. Allocated memory was 141.0 MB in the beginning and 206.0 MB in the end (delta: 65.0 MB). Free memory was 102.7 MB in the beginning and 162.5 MB in the end (delta: -59.8 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:56,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.70 ms. Allocated memory is still 206.0 MB. Free memory was 162.5 MB in the beginning and 159.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:56,001 INFO L168 Benchmark]: Boogie Preprocessor took 37.05 ms. Allocated memory is still 206.0 MB. Free memory was 159.2 MB in the beginning and 157.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:56,002 INFO L168 Benchmark]: RCFGBuilder took 1893.16 ms. Allocated memory was 206.0 MB in the beginning and 246.4 MB in the end (delta: 40.4 MB). Free memory was 157.2 MB in the beginning and 190.7 MB in the end (delta: -33.5 MB). Peak memory consumption was 100.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:56,003 INFO L168 Benchmark]: TraceAbstraction took 12846.73 ms. Allocated memory was 246.4 MB in the beginning and 370.7 MB in the end (delta: 124.3 MB). Free memory was 190.7 MB in the beginning and 171.1 MB in the end (delta: 19.6 MB). Peak memory consumption was 143.8 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:56,007 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 743.90 ms. Allocated memory was 141.0 MB in the beginning and 206.0 MB in the end (delta: 65.0 MB). Free memory was 102.7 MB in the beginning and 162.5 MB in the end (delta: -59.8 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.70 ms. Allocated memory is still 206.0 MB. Free memory was 162.5 MB in the beginning and 159.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.05 ms. Allocated memory is still 206.0 MB. Free memory was 159.2 MB in the beginning and 157.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1893.16 ms. Allocated memory was 206.0 MB in the beginning and 246.4 MB in the end (delta: 40.4 MB). Free memory was 157.2 MB in the beginning and 190.7 MB in the end (delta: -33.5 MB). Peak memory consumption was 100.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12846.73 ms. Allocated memory was 246.4 MB in the beginning and 370.7 MB in the end (delta: 124.3 MB). Free memory was 190.7 MB in the beginning and 171.1 MB in the end (delta: 19.6 MB). Peak memory consumption was 143.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 801 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 55 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.6s, 99 PlacesBefore, 35 PlacesAfterwards, 91 TransitionsBefore, 25 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 80 TotalNumberOfCompositions, 4174 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L724] 0 int z = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1507; [L803] FCALL, FORK 0 pthread_create(&t1507, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t1508; [L805] FCALL, FORK 0 pthread_create(&t1508, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 0 pthread_t t1509; [L807] FCALL, FORK 0 pthread_create(&t1509, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 3 y$w_buff1 = y$w_buff0 [L766] 3 y$w_buff0 = 2 [L767] 3 y$w_buff1_used = y$w_buff0_used [L768] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L770] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L771] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L772] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L773] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L774] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L730] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L740] 1 return 0; [L745] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L752] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 2 return 0; [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L780] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 3 return 0; [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L827] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.6s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 256 SDtfs, 330 SDslu, 329 SDs, 0 SdLazy, 200 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 122 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 12391 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...