/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-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:03:41,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:03:41,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:03:41,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:03:41,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:03:41,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:03:41,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:03:41,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:03:41,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:03:41,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:03:41,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:03:41,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:03:41,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:03:41,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:03:41,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:03:41,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:03:41,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:03:41,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:03:41,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:03:41,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:03:41,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:03:41,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:03:41,167 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:03:41,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:03:41,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:03:41,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:03:41,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:03:41,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:03:41,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:03:41,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:03:41,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:03:41,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:03:41,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:03:41,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:03:41,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:03:41,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:03:41,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:03:41,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:03:41,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:03:41,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:03:41,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:03:41,183 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-10-22 02:03:41,208 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:03:41,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:03:41,210 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:03:41,210 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:03:41,210 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:03:41,211 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:03:41,211 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:03:41,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:03:41,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:03:41,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:03:41,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:03:41,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:03:41,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:03:41,212 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:03:41,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:03:41,212 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:03:41,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:03:41,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:03:41,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:03:41,213 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:03:41,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:03:41,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:03:41,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:03:41,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:03:41,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:03:41,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:03:41,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:03:41,215 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:03:41,215 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:03:41,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:03:41,215 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:03:41,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:03:41,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:03:41,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:03:41,563 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:03:41,564 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:03:41,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2020-10-22 02:03:41,635 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4843b02d0/407072a579534ca6a1cfa7220cf6acdc/FLAG16993275f [2020-10-22 02:03:42,249 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:03:42,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2020-10-22 02:03:42,271 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4843b02d0/407072a579534ca6a1cfa7220cf6acdc/FLAG16993275f [2020-10-22 02:03:42,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4843b02d0/407072a579534ca6a1cfa7220cf6acdc [2020-10-22 02:03:42,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:03:42,541 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:03:42,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:03:42,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:03:42,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:03:42,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:03:42" (1/1) ... [2020-10-22 02:03:42,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344dab00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:42, skipping insertion in model container [2020-10-22 02:03:42,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:03:42" (1/1) ... [2020-10-22 02:03:42,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:03:42,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:03:43,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:03:43,199 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:03:43,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:03:43,350 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:03:43,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:43 WrapperNode [2020-10-22 02:03:43,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:03:43,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:03:43,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:03:43,353 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:03:43,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:43" (1/1) ... [2020-10-22 02:03:43,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:43" (1/1) ... [2020-10-22 02:03:43,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:03:43,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:03:43,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:03:43,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:03:43,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:43" (1/1) ... [2020-10-22 02:03:43,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:43" (1/1) ... [2020-10-22 02:03:43,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:43" (1/1) ... [2020-10-22 02:03:43,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:43" (1/1) ... [2020-10-22 02:03:43,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:43" (1/1) ... [2020-10-22 02:03:43,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:43" (1/1) ... [2020-10-22 02:03:43,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:43" (1/1) ... [2020-10-22 02:03:43,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:03:43,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:03:43,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:03:43,528 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:03:43,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:03:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:03:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:03:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:03:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:03:43,606 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:03:43,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:03:43,606 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:03:43,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:03:43,607 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 02:03:43,607 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 02:03:43,608 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-22 02:03:43,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-22 02:03:43,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:03:43,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:03:43,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:03:43,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:03:43,611 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 02:03:45,584 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:03:45,584 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 02:03:45,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:03:45 BoogieIcfgContainer [2020-10-22 02:03:45,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:03:45,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:03:45,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:03:45,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:03:45,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:03:42" (1/3) ... [2020-10-22 02:03:45,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56227795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:03:45, skipping insertion in model container [2020-10-22 02:03:45,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:43" (2/3) ... [2020-10-22 02:03:45,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56227795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:03:45, skipping insertion in model container [2020-10-22 02:03:45,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:03:45" (3/3) ... [2020-10-22 02:03:45,595 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_pso.opt.i [2020-10-22 02:03:45,607 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:03:45,607 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:03:45,615 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 02:03:45,616 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:03:45,647 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,648 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,648 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,650 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,650 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,651 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,652 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,655 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,655 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,655 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,656 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,663 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,663 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,663 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,663 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,664 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,664 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,664 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,664 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,664 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,665 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,665 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,669 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,669 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,671 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,671 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,673 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,674 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,675 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,675 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:45,676 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:03:45,691 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-22 02:03:45,712 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:03:45,712 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:03:45,712 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:03:45,713 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:03:45,713 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:03:45,713 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:03:45,713 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:03:45,713 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:03:45,729 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:03:45,730 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 116 transitions, 252 flow [2020-10-22 02:03:45,733 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 116 transitions, 252 flow [2020-10-22 02:03:45,736 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 116 transitions, 252 flow [2020-10-22 02:03:45,788 INFO L129 PetriNetUnfolder]: 3/112 cut-off events. [2020-10-22 02:03:45,789 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:03:45,795 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-10-22 02:03:45,799 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-10-22 02:03:46,500 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 02:03:46,623 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-22 02:03:47,954 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-10-22 02:03:49,255 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2020-10-22 02:03:49,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-22 02:03:49,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:03:49,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-22 02:03:49,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:03:50,303 WARN L193 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 109 [2020-10-22 02:03:51,437 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2020-10-22 02:03:51,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-22 02:03:51,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:03:51,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-22 02:03:51,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:03:52,472 WARN L193 SmtUtils]: Spent 995.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 109 [2020-10-22 02:03:52,611 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-10-22 02:03:53,157 WARN L193 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-10-22 02:03:53,348 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-22 02:03:55,406 WARN L193 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 247 DAG size of output: 206 [2020-10-22 02:03:55,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-22 02:03:55,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:03:55,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-22 02:03:55,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:03:57,199 WARN L193 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 163 DAG size of output: 134 [2020-10-22 02:03:57,253 INFO L131 LiptonReduction]: Checked pairs total: 7247 [2020-10-22 02:03:57,254 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-10-22 02:03:57,261 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-22 02:03:57,408 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-10-22 02:03:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-10-22 02:03:57,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 02:03:57,419 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:03:57,420 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:03:57,421 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:03:57,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:03:57,427 INFO L82 PathProgramCache]: Analyzing trace with hash 477405012, now seen corresponding path program 1 times [2020-10-22 02:03:57,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:03:57,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7600470] [2020-10-22 02:03:57,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:03:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:03:57,734 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-22 02:03:57,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7600470] [2020-10-22 02:03:57,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:03:57,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:03:57,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [922619511] [2020-10-22 02:03:57,738 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:03:57,741 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:03:57,757 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 02:03:57,757 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:03:57,763 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:03:57,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:03:57,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:03:57,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:03:57,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:03:57,781 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-10-22 02:03:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:03:57,879 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-10-22 02:03:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:03:57,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 02:03:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:03:57,917 INFO L225 Difference]: With dead ends: 2202 [2020-10-22 02:03:57,917 INFO L226 Difference]: Without dead ends: 1802 [2020-10-22 02:03:57,919 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-22 02:03:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-10-22 02:03:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-10-22 02:03:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-10-22 02:03:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-10-22 02:03:58,130 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-10-22 02:03:58,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:03:58,131 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-10-22 02:03:58,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:03:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-10-22 02:03:58,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:03:58,134 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:03:58,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:03:58,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:03:58,135 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:03:58,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:03:58,135 INFO L82 PathProgramCache]: Analyzing trace with hash -775206985, now seen corresponding path program 1 times [2020-10-22 02:03:58,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:03:58,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269239034] [2020-10-22 02:03:58,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:03:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:03:58,247 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-22 02:03:58,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269239034] [2020-10-22 02:03:58,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:03:58,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:03:58,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [251586688] [2020-10-22 02:03:58,249 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:03:58,251 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:03:58,253 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 02:03:58,253 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:03:58,254 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:03:58,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:03:58,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:03:58,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:03:58,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:03:58,258 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-10-22 02:03:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:03:58,320 INFO L93 Difference]: Finished difference Result 1794 states and 6746 transitions. [2020-10-22 02:03:58,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:03:58,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 02:03:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:03:58,339 INFO L225 Difference]: With dead ends: 1794 [2020-10-22 02:03:58,340 INFO L226 Difference]: Without dead ends: 1794 [2020-10-22 02:03:58,341 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-22 02:03:58,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2020-10-22 02:03:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1794. [2020-10-22 02:03:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-10-22 02:03:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6746 transitions. [2020-10-22 02:03:58,415 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6746 transitions. Word has length 11 [2020-10-22 02:03:58,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:03:58,415 INFO L481 AbstractCegarLoop]: Abstraction has 1794 states and 6746 transitions. [2020-10-22 02:03:58,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:03:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6746 transitions. [2020-10-22 02:03:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:03:58,419 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:03:58,419 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:03:58,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:03:58,419 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:03:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:03:58,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1736968243, now seen corresponding path program 1 times [2020-10-22 02:03:58,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:03:58,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789574363] [2020-10-22 02:03:58,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:03:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:03:58,546 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-22 02:03:58,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789574363] [2020-10-22 02:03:58,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:03:58,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:03:58,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [759060820] [2020-10-22 02:03:58,548 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:03:58,550 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:03:58,552 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 14 transitions. [2020-10-22 02:03:58,553 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:03:58,587 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:03:58,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:03:58,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:03:58,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:03:58,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:03:58,589 INFO L87 Difference]: Start difference. First operand 1794 states and 6746 transitions. Second operand 5 states. [2020-10-22 02:03:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:03:58,674 INFO L93 Difference]: Finished difference Result 2426 states and 8744 transitions. [2020-10-22 02:03:58,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:03:58,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-22 02:03:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:03:58,694 INFO L225 Difference]: With dead ends: 2426 [2020-10-22 02:03:58,695 INFO L226 Difference]: Without dead ends: 1882 [2020-10-22 02:03:58,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:03:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2020-10-22 02:03:58,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1722. [2020-10-22 02:03:58,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2020-10-22 02:03:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 6168 transitions. [2020-10-22 02:03:58,767 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 6168 transitions. Word has length 12 [2020-10-22 02:03:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:03:58,768 INFO L481 AbstractCegarLoop]: Abstraction has 1722 states and 6168 transitions. [2020-10-22 02:03:58,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:03:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 6168 transitions. [2020-10-22 02:03:58,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:03:58,770 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:03:58,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:03:58,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:03:58,771 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:03:58,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:03:58,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1738386307, now seen corresponding path program 1 times [2020-10-22 02:03:58,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:03:58,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874820318] [2020-10-22 02:03:58,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:03:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:03:58,840 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-22 02:03:58,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874820318] [2020-10-22 02:03:58,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:03:58,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:03:58,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1561474187] [2020-10-22 02:03:58,842 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:03:58,847 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:03:58,852 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 20 transitions. [2020-10-22 02:03:58,853 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:03:58,919 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:03:58,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:03:58,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:03:58,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:03:58,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:03:58,920 INFO L87 Difference]: Start difference. First operand 1722 states and 6168 transitions. Second operand 3 states. [2020-10-22 02:03:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:03:58,949 INFO L93 Difference]: Finished difference Result 1682 states and 5986 transitions. [2020-10-22 02:03:58,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:03:58,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-22 02:03:58,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:03:58,964 INFO L225 Difference]: With dead ends: 1682 [2020-10-22 02:03:58,965 INFO L226 Difference]: Without dead ends: 1682 [2020-10-22 02:03:58,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-22 02:03:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2020-10-22 02:03:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1682. [2020-10-22 02:03:59,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2020-10-22 02:03:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 5986 transitions. [2020-10-22 02:03:59,030 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 5986 transitions. Word has length 12 [2020-10-22 02:03:59,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:03:59,030 INFO L481 AbstractCegarLoop]: Abstraction has 1682 states and 5986 transitions. [2020-10-22 02:03:59,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:03:59,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 5986 transitions. [2020-10-22 02:03:59,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:03:59,033 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:03:59,033 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:03:59,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:03:59,033 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:03:59,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:03:59,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1037055385, now seen corresponding path program 1 times [2020-10-22 02:03:59,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:03:59,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813642746] [2020-10-22 02:03:59,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:03:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:03:59,106 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-22 02:03:59,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813642746] [2020-10-22 02:03:59,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:03:59,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:03:59,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [980402305] [2020-10-22 02:03:59,108 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:03:59,110 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:03:59,115 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 47 transitions. [2020-10-22 02:03:59,115 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:03:59,154 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 02:03:59,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:03:59,162 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:03:59,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:03:59,167 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:03:59,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:03:59,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:03:59,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:03:59,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:03:59,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:03:59,245 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:03:59,643 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:03:59,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:03:59,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:03:59,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:03:59,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:03:59,644 INFO L87 Difference]: Start difference. First operand 1682 states and 5986 transitions. Second operand 3 states. [2020-10-22 02:03:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:03:59,688 INFO L93 Difference]: Finished difference Result 1668 states and 5924 transitions. [2020-10-22 02:03:59,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:03:59,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-22 02:03:59,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:03:59,704 INFO L225 Difference]: With dead ends: 1668 [2020-10-22 02:03:59,705 INFO L226 Difference]: Without dead ends: 1668 [2020-10-22 02:03:59,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-22 02:03:59,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2020-10-22 02:03:59,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1668. [2020-10-22 02:03:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2020-10-22 02:03:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 5924 transitions. [2020-10-22 02:03:59,824 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 5924 transitions. Word has length 13 [2020-10-22 02:03:59,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:03:59,825 INFO L481 AbstractCegarLoop]: Abstraction has 1668 states and 5924 transitions. [2020-10-22 02:03:59,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:03:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 5924 transitions. [2020-10-22 02:03:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:03:59,827 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:03:59,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:03:59,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:03:59,829 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:03:59,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:03:59,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2127906781, now seen corresponding path program 1 times [2020-10-22 02:03:59,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:03:59,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944612540] [2020-10-22 02:03:59,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:03:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:03:59,959 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-22 02:03:59,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944612540] [2020-10-22 02:03:59,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:03:59,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:03:59,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [911950226] [2020-10-22 02:03:59,961 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:03:59,963 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:03:59,970 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 67 transitions. [2020-10-22 02:03:59,970 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:00,004 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 02:04:00,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:00,005 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:04:00,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:00,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:00,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:00,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:00,018 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:04:00,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:00,034 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:04:00,042 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:04:00,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:00,755 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:04:00,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:04:00,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:00,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:04:00,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:04:00,756 INFO L87 Difference]: Start difference. First operand 1668 states and 5924 transitions. Second operand 5 states. [2020-10-22 02:04:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:00,863 INFO L93 Difference]: Finished difference Result 1640 states and 5800 transitions. [2020-10-22 02:04:00,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:04:00,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-22 02:04:00,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:00,878 INFO L225 Difference]: With dead ends: 1640 [2020-10-22 02:04:00,879 INFO L226 Difference]: Without dead ends: 1640 [2020-10-22 02:04:00,879 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:04:00,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2020-10-22 02:04:00,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2020-10-22 02:04:00,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1640 states. [2020-10-22 02:04:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 5800 transitions. [2020-10-22 02:04:00,937 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 5800 transitions. Word has length 14 [2020-10-22 02:04:00,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:00,938 INFO L481 AbstractCegarLoop]: Abstraction has 1640 states and 5800 transitions. [2020-10-22 02:04:00,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:04:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 5800 transitions. [2020-10-22 02:04:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:04:00,940 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:00,940 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:00,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:04:00,941 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:04:00,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:00,941 INFO L82 PathProgramCache]: Analyzing trace with hash -2083948285, now seen corresponding path program 1 times [2020-10-22 02:04:00,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:00,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9660547] [2020-10-22 02:04:00,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:01,000 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-22 02:04:01,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9660547] [2020-10-22 02:04:01,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:01,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:04:01,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [790381454] [2020-10-22 02:04:01,002 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:01,004 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:01,008 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 50 transitions. [2020-10-22 02:04:01,008 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:01,044 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:04:01,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:01,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:01,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:01,368 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:04:01,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:04:01,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:01,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:04:01,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:04:01,370 INFO L87 Difference]: Start difference. First operand 1640 states and 5800 transitions. Second operand 4 states. [2020-10-22 02:04:01,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:01,425 INFO L93 Difference]: Finished difference Result 1656 states and 5852 transitions. [2020-10-22 02:04:01,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:04:01,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-22 02:04:01,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:01,448 INFO L225 Difference]: With dead ends: 1656 [2020-10-22 02:04:01,448 INFO L226 Difference]: Without dead ends: 1656 [2020-10-22 02:04:01,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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-22 02:04:01,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2020-10-22 02:04:01,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2020-10-22 02:04:01,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2020-10-22 02:04:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 5852 transitions. [2020-10-22 02:04:01,513 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 5852 transitions. Word has length 14 [2020-10-22 02:04:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:01,514 INFO L481 AbstractCegarLoop]: Abstraction has 1656 states and 5852 transitions. [2020-10-22 02:04:01,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:04:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 5852 transitions. [2020-10-22 02:04:01,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:04:01,517 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:01,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:01,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:04:01,517 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:04:01,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:01,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2085272605, now seen corresponding path program 2 times [2020-10-22 02:04:01,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:01,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027834832] [2020-10-22 02:04:01,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:01,659 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-22 02:04:01,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027834832] [2020-10-22 02:04:01,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:01,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:04:01,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [309198375] [2020-10-22 02:04:01,660 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:01,662 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:01,667 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 60 transitions. [2020-10-22 02:04:01,667 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:01,897 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 15 [2020-10-22 02:04:02,452 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:04:02,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:04:02,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:02,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:04:02,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:04:02,454 INFO L87 Difference]: Start difference. First operand 1656 states and 5852 transitions. Second operand 5 states. [2020-10-22 02:04:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:02,546 INFO L93 Difference]: Finished difference Result 1614 states and 5680 transitions. [2020-10-22 02:04:02,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:04:02,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-22 02:04:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:02,572 INFO L225 Difference]: With dead ends: 1614 [2020-10-22 02:04:02,573 INFO L226 Difference]: Without dead ends: 1614 [2020-10-22 02:04:02,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:04:02,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2020-10-22 02:04:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1598. [2020-10-22 02:04:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2020-10-22 02:04:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 5628 transitions. [2020-10-22 02:04:02,632 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 5628 transitions. Word has length 14 [2020-10-22 02:04:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:02,632 INFO L481 AbstractCegarLoop]: Abstraction has 1598 states and 5628 transitions. [2020-10-22 02:04:02,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:04:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 5628 transitions. [2020-10-22 02:04:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:04:02,635 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:02,636 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:02,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:04:02,636 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:04:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:02,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1540603193, now seen corresponding path program 1 times [2020-10-22 02:04:02,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:02,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264793032] [2020-10-22 02:04:02,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:02,762 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-22 02:04:02,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264793032] [2020-10-22 02:04:02,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:02,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:04:02,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2010189195] [2020-10-22 02:04:02,763 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:02,766 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:02,775 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 70 transitions. [2020-10-22 02:04:02,775 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:02,829 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:04:02,832 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:02,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:02,862 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:04:02,872 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:04:02,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:02,888 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:04:02,900 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:04:03,395 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:04:03,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:04:03,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:03,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:04:03,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:04:03,397 INFO L87 Difference]: Start difference. First operand 1598 states and 5628 transitions. Second operand 5 states. [2020-10-22 02:04:03,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:03,489 INFO L93 Difference]: Finished difference Result 1770 states and 6194 transitions. [2020-10-22 02:04:03,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:04:03,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-22 02:04:03,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:03,499 INFO L225 Difference]: With dead ends: 1770 [2020-10-22 02:04:03,500 INFO L226 Difference]: Without dead ends: 1770 [2020-10-22 02:04:03,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:04:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2020-10-22 02:04:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1678. [2020-10-22 02:04:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1678 states. [2020-10-22 02:04:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 5872 transitions. [2020-10-22 02:04:03,556 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 5872 transitions. Word has length 15 [2020-10-22 02:04:03,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:03,557 INFO L481 AbstractCegarLoop]: Abstraction has 1678 states and 5872 transitions. [2020-10-22 02:04:03,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:04:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 5872 transitions. [2020-10-22 02:04:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:04:03,560 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:03,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:03,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 02:04:03,561 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:04:03,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:03,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1541927513, now seen corresponding path program 2 times [2020-10-22 02:04:03,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:03,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26100714] [2020-10-22 02:04:03,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:03,666 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-22 02:04:03,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26100714] [2020-10-22 02:04:03,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:03,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:04:03,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [431541990] [2020-10-22 02:04:03,667 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:03,669 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:03,676 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 92 transitions. [2020-10-22 02:04:03,676 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:04,063 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 14 [2020-10-22 02:04:04,661 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [52315#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 1))] [2020-10-22 02:04:04,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:04:04,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:04,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:04:04,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:04:04,665 INFO L87 Difference]: Start difference. First operand 1678 states and 5872 transitions. Second operand 7 states. [2020-10-22 02:04:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:04,804 INFO L93 Difference]: Finished difference Result 1774 states and 6158 transitions. [2020-10-22 02:04:04,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:04:04,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-22 02:04:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:04,812 INFO L225 Difference]: With dead ends: 1774 [2020-10-22 02:04:04,813 INFO L226 Difference]: Without dead ends: 1774 [2020-10-22 02:04:04,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:04:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2020-10-22 02:04:04,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1666. [2020-10-22 02:04:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1666 states. [2020-10-22 02:04:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 5832 transitions. [2020-10-22 02:04:04,866 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 5832 transitions. Word has length 15 [2020-10-22 02:04:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:04,866 INFO L481 AbstractCegarLoop]: Abstraction has 1666 states and 5832 transitions. [2020-10-22 02:04:04,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:04:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 5832 transitions. [2020-10-22 02:04:04,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-22 02:04:04,870 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:04,870 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:04,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 02:04:04,871 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:04:04,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:04,871 INFO L82 PathProgramCache]: Analyzing trace with hash -591786302, now seen corresponding path program 1 times [2020-10-22 02:04:04,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:04,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935059376] [2020-10-22 02:04:04,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:04,955 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-22 02:04:04,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935059376] [2020-10-22 02:04:04,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:04,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:04:04,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1382415124] [2020-10-22 02:04:04,956 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:04,958 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:04,968 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 107 transitions. [2020-10-22 02:04:04,969 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:05,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:05,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:05,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:05,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:05,604 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:05,765 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [57430#(not (= 4 ~__unbuffered_cnt~0))] [2020-10-22 02:04:05,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:04:05,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:05,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:04:05,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:04:05,766 INFO L87 Difference]: Start difference. First operand 1666 states and 5832 transitions. Second operand 5 states. [2020-10-22 02:04:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:05,866 INFO L93 Difference]: Finished difference Result 1319 states and 4111 transitions. [2020-10-22 02:04:05,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:04:05,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-22 02:04:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:05,870 INFO L225 Difference]: With dead ends: 1319 [2020-10-22 02:04:05,870 INFO L226 Difference]: Without dead ends: 887 [2020-10-22 02:04:05,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:04:05,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-10-22 02:04:05,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 887. [2020-10-22 02:04:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2020-10-22 02:04:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 2527 transitions. [2020-10-22 02:04:05,899 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 2527 transitions. Word has length 16 [2020-10-22 02:04:05,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:05,899 INFO L481 AbstractCegarLoop]: Abstraction has 887 states and 2527 transitions. [2020-10-22 02:04:05,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:04:05,900 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 2527 transitions. [2020-10-22 02:04:05,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:04:05,902 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:05,902 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:05,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 02:04:05,903 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:04:05,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:05,903 INFO L82 PathProgramCache]: Analyzing trace with hash -232445824, now seen corresponding path program 1 times [2020-10-22 02:04:05,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:05,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955107702] [2020-10-22 02:04:05,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:06,036 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-22 02:04:06,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955107702] [2020-10-22 02:04:06,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:06,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:04:06,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1395274142] [2020-10-22 02:04:06,038 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:06,040 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:06,055 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 130 transitions. [2020-10-22 02:04:06,056 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:06,083 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:07,053 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 3 [2020-10-22 02:04:07,318 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [60533#(= ~z$w_buff1~0 0)] [2020-10-22 02:04:07,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:04:07,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:07,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:04:07,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:04:07,320 INFO L87 Difference]: Start difference. First operand 887 states and 2527 transitions. Second operand 6 states. [2020-10-22 02:04:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:07,471 INFO L93 Difference]: Finished difference Result 1249 states and 3426 transitions. [2020-10-22 02:04:07,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:04:07,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-22 02:04:07,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:07,478 INFO L225 Difference]: With dead ends: 1249 [2020-10-22 02:04:07,478 INFO L226 Difference]: Without dead ends: 897 [2020-10-22 02:04:07,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:04:07,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2020-10-22 02:04:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 875. [2020-10-22 02:04:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2020-10-22 02:04:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 2355 transitions. [2020-10-22 02:04:07,509 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 2355 transitions. Word has length 19 [2020-10-22 02:04:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:07,510 INFO L481 AbstractCegarLoop]: Abstraction has 875 states and 2355 transitions. [2020-10-22 02:04:07,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:04:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 2355 transitions. [2020-10-22 02:04:07,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:04:07,513 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:07,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:07,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 02:04:07,514 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:04:07,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:07,515 INFO L82 PathProgramCache]: Analyzing trace with hash 106051531, now seen corresponding path program 1 times [2020-10-22 02:04:07,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:07,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191756054] [2020-10-22 02:04:07,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:07,661 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-22 02:04:07,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191756054] [2020-10-22 02:04:07,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:07,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:04:07,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1164224326] [2020-10-22 02:04:07,663 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:07,667 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:07,689 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 102 transitions. [2020-10-22 02:04:07,689 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:08,067 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [63543#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:04:08,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:04:08,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:08,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:04:08,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:04:08,069 INFO L87 Difference]: Start difference. First operand 875 states and 2355 transitions. Second operand 7 states. [2020-10-22 02:04:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:08,152 INFO L93 Difference]: Finished difference Result 770 states and 2027 transitions. [2020-10-22 02:04:08,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:04:08,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 02:04:08,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:08,155 INFO L225 Difference]: With dead ends: 770 [2020-10-22 02:04:08,156 INFO L226 Difference]: Without dead ends: 618 [2020-10-22 02:04:08,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:04:08,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-10-22 02:04:08,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 598. [2020-10-22 02:04:08,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2020-10-22 02:04:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1554 transitions. [2020-10-22 02:04:08,170 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1554 transitions. Word has length 19 [2020-10-22 02:04:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:08,171 INFO L481 AbstractCegarLoop]: Abstraction has 598 states and 1554 transitions. [2020-10-22 02:04:08,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:04:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1554 transitions. [2020-10-22 02:04:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 02:04:08,173 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:08,173 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, 1, 1] [2020-10-22 02:04:08,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 02:04:08,174 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:04:08,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:08,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1372551299, now seen corresponding path program 1 times [2020-10-22 02:04:08,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:08,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382512173] [2020-10-22 02:04:08,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:08,224 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-22 02:04:08,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382512173] [2020-10-22 02:04:08,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:08,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:04:08,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1845105502] [2020-10-22 02:04:08,226 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:08,229 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:08,286 INFO L252 McrAutomatonBuilder]: Finished intersection with 179 states and 404 transitions. [2020-10-22 02:04:08,287 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:09,324 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:04:09,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:04:09,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:09,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:04:09,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:04:09,325 INFO L87 Difference]: Start difference. First operand 598 states and 1554 transitions. Second operand 4 states. [2020-10-22 02:04:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:09,347 INFO L93 Difference]: Finished difference Result 803 states and 2028 transitions. [2020-10-22 02:04:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:04:09,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-22 02:04:09,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:09,350 INFO L225 Difference]: With dead ends: 803 [2020-10-22 02:04:09,350 INFO L226 Difference]: Without dead ends: 471 [2020-10-22 02:04:09,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:04:09,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-10-22 02:04:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 468. [2020-10-22 02:04:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2020-10-22 02:04:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1105 transitions. [2020-10-22 02:04:09,364 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1105 transitions. Word has length 22 [2020-10-22 02:04:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:09,366 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 1105 transitions. [2020-10-22 02:04:09,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:04:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1105 transitions. [2020-10-22 02:04:09,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 02:04:09,367 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:09,368 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, 1, 1] [2020-10-22 02:04:09,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-22 02:04:09,368 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:04:09,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:09,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1722088816, now seen corresponding path program 1 times [2020-10-22 02:04:09,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:09,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596064979] [2020-10-22 02:04:09,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:09,561 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-22 02:04:09,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596064979] [2020-10-22 02:04:09,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:09,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:04:09,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [946228621] [2020-10-22 02:04:09,562 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:09,566 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:09,676 INFO L252 McrAutomatonBuilder]: Finished intersection with 209 states and 484 transitions. [2020-10-22 02:04:09,676 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:09,704 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-22 02:04:09,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:09,705 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-22 02:04:09,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:09,706 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:04:09,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:09,708 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 1] term [2020-10-22 02:04:09,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:04:09,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:09,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:09,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:09,714 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:09,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:04:09,728 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:04:09,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:09,730 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:04:09,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:09,741 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:09,742 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:09,749 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:04:09,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:09,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:09,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:09,768 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-22 02:04:09,769 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:10,001 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 27 [2020-10-22 02:04:10,347 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-22 02:04:10,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:10,348 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-22 02:04:10,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:10,349 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:04:10,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:10,351 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:04:10,351 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:04:10,352 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-22 02:04:10,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:10,353 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 4, 3, 4, 1] term [2020-10-22 02:04:10,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:04:10,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:04:10,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:10,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:04:10,361 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:04:10,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:10,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:10,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:10,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:10,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:10,380 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 1] term [2020-10-22 02:04:10,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:04:10,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:10,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:10,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:10,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:10,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:04:10,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:10,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:04:10,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:10,408 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:04:10,414 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:10,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:10,421 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:04:10,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:10,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:10,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:12,962 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [67265#(or (not (= (mod ~z$w_buff0_used~0 256) 0)) (and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (= ~z~0 1) (= ~z$w_buff0_used~0 0))), 67264#(and (or (= (mod ~z$w_buff0_used~0 256) 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 1))) (or (and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1)) (and (not (= (mod ~z$r_buff0_thd3~0 256) 0)) (not (= (mod ~z$w_buff0_used~0 256) 0))))), 67267#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (or (= (mod ~z$w_buff0_used~0 256) 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (= ~z$w_buff0~0 1))), 67266#(or (and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0)) (not (= (mod ~z$w_buff0_used~0 256) 0))), 67269#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$r_buff0_thd3~0 0)) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0)))), 67268#(or (not (= (mod ~z$w_buff0_used~0 256) 0)) (and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (= ~z$w_buff0_used~0 0)))] [2020-10-22 02:04:12,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-22 02:04:12,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:12,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-22 02:04:12,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-22 02:04:12,963 INFO L87 Difference]: Start difference. First operand 468 states and 1105 transitions. Second operand 13 states. [2020-10-22 02:04:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:13,262 INFO L93 Difference]: Finished difference Result 563 states and 1295 transitions. [2020-10-22 02:04:13,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 02:04:13,263 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-10-22 02:04:13,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:13,264 INFO L225 Difference]: With dead ends: 563 [2020-10-22 02:04:13,264 INFO L226 Difference]: Without dead ends: 299 [2020-10-22 02:04:13,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-10-22 02:04:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-10-22 02:04:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2020-10-22 02:04:13,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-10-22 02:04:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 646 transitions. [2020-10-22 02:04:13,272 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 646 transitions. Word has length 22 [2020-10-22 02:04:13,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:13,272 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 646 transitions. [2020-10-22 02:04:13,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-22 02:04:13,273 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 646 transitions. [2020-10-22 02:04:13,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 02:04:13,274 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:13,274 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, 1, 1] [2020-10-22 02:04:13,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-22 02:04:13,274 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:04:13,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:13,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2144444351, now seen corresponding path program 1 times [2020-10-22 02:04:13,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:13,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375823762] [2020-10-22 02:04:13,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:13,385 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-22 02:04:13,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375823762] [2020-10-22 02:04:13,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:13,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 02:04:13,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1532644866] [2020-10-22 02:04:13,386 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:13,393 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:13,415 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 126 transitions. [2020-10-22 02:04:13,415 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:13,641 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [68440#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:04:13,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 02:04:13,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:13,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 02:04:13,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:04:13,642 INFO L87 Difference]: Start difference. First operand 296 states and 646 transitions. Second operand 8 states. [2020-10-22 02:04:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:13,728 INFO L93 Difference]: Finished difference Result 276 states and 607 transitions. [2020-10-22 02:04:13,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 02:04:13,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-22 02:04:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:13,729 INFO L225 Difference]: With dead ends: 276 [2020-10-22 02:04:13,730 INFO L226 Difference]: Without dead ends: 63 [2020-10-22 02:04:13,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:04:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-22 02:04:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-22 02:04:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-22 02:04:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 121 transitions. [2020-10-22 02:04:13,732 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 121 transitions. Word has length 22 [2020-10-22 02:04:13,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:13,732 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 121 transitions. [2020-10-22 02:04:13,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 02:04:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 121 transitions. [2020-10-22 02:04:13,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 02:04:13,733 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:13,733 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, 1, 1, 1, 1, 1] [2020-10-22 02:04:13,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-22 02:04:13,733 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:04:13,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:13,734 INFO L82 PathProgramCache]: Analyzing trace with hash 81887815, now seen corresponding path program 1 times [2020-10-22 02:04:13,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:13,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093837673] [2020-10-22 02:04:13,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:04:13,805 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:04:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:04:13,860 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:04:13,905 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:04:13,905 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:04:13,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-22 02:04:13,907 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 02:04:13,922 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L3-->L852: Formula: (let ((.cse7 (= (mod ~z$r_buff0_thd0~0_In1535792678 256) 0)) (.cse6 (= (mod ~z$w_buff0_used~0_In1535792678 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In1535792678 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In1535792678 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (= ~z$r_buff0_thd0~0_In1535792678 ~z$r_buff0_thd0~0_Out1535792678) (or (and .cse0 (= ~z$w_buff1_used~0_Out1535792678 0) .cse1) (and .cse2 (= ~z$w_buff1_used~0_Out1535792678 ~z$w_buff1_used~0_In1535792678))) (or (and (or (and (= ~z$w_buff1~0_In1535792678 ~z~0_Out1535792678) .cse0 .cse1) (and (= ~z~0_In1535792678 ~z~0_Out1535792678) .cse2)) .cse3) (and (= ~z~0_Out1535792678 ~z$w_buff0~0_In1535792678) .cse4 .cse5)) (or (and (= ~z$w_buff0_used~0_Out1535792678 0) .cse4 .cse5) (and (= ~z$w_buff0_used~0_Out1535792678 ~z$w_buff0_used~0_In1535792678) .cse3)) (= ~z$r_buff1_thd0~0_Out1535792678 ~z$r_buff1_thd0~0_In1535792678) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1535792678 0))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1535792678, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1535792678, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1535792678, ~z$w_buff0~0=~z$w_buff0~0_In1535792678, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1535792678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1535792678, ~z$w_buff1~0=~z$w_buff1~0_In1535792678, ~z~0=~z~0_In1535792678} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1535792678, ~z$w_buff0~0=~z$w_buff0~0_In1535792678, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1535792678, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1535792678|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1535792678|, ~z$w_buff1~0=~z$w_buff1~0_In1535792678, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1535792678|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1535792678|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1535792678|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1535792678|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1535792678, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1535792678, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1535792678, ~z~0=~z~0_Out1535792678} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ~z~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-22 02:04:13,929 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-22 02:04:13,930 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [795] [2020-10-22 02:04:13,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-22 02:04:13,932 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,932 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,932 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,933 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,933 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,934 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,934 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,935 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,935 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,935 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,936 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,937 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,937 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,938 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,938 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,938 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,939 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,939 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,939 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,940 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,940 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,940 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:13,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-22 02:04:13,941 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:14,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:04:14 BasicIcfg [2020-10-22 02:04:14,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:04:14,015 INFO L168 Benchmark]: Toolchain (without parser) took 31479.85 ms. Allocated memory was 146.3 MB in the beginning and 528.5 MB in the end (delta: 382.2 MB). Free memory was 101.0 MB in the beginning and 235.8 MB in the end (delta: -134.9 MB). Peak memory consumption was 247.3 MB. Max. memory is 7.1 GB. [2020-10-22 02:04:14,015 INFO L168 Benchmark]: CDTParser took 2.56 ms. Allocated memory is still 146.3 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 02:04:14,016 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.80 ms. Allocated memory was 146.3 MB in the beginning and 202.4 MB in the end (delta: 56.1 MB). Free memory was 99.9 MB in the beginning and 152.4 MB in the end (delta: -52.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2020-10-22 02:04:14,016 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.47 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 149.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-22 02:04:14,017 INFO L168 Benchmark]: Boogie Preprocessor took 78.21 ms. Allocated memory is still 202.4 MB. Free memory was 149.6 MB in the beginning and 146.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:04:14,018 INFO L168 Benchmark]: RCFGBuilder took 2060.64 ms. Allocated memory was 202.4 MB in the beginning and 250.1 MB in the end (delta: 47.7 MB). Free memory was 146.8 MB in the beginning and 177.4 MB in the end (delta: -30.6 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB. [2020-10-22 02:04:14,018 INFO L168 Benchmark]: TraceAbstraction took 28425.38 ms. Allocated memory was 250.1 MB in the beginning and 528.5 MB in the end (delta: 278.4 MB). Free memory was 177.4 MB in the beginning and 235.8 MB in the end (delta: -58.4 MB). Peak memory consumption was 220.0 MB. Max. memory is 7.1 GB. [2020-10-22 02:04:14,022 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.56 ms. Allocated memory is still 146.3 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.80 ms. Allocated memory was 146.3 MB in the beginning and 202.4 MB in the end (delta: 56.1 MB). Free memory was 99.9 MB in the beginning and 152.4 MB in the end (delta: -52.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 88.47 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 149.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.21 ms. Allocated memory is still 202.4 MB. Free memory was 149.6 MB in the beginning and 146.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2060.64 ms. Allocated memory was 202.4 MB in the beginning and 250.1 MB in the end (delta: 47.7 MB). Free memory was 146.8 MB in the beginning and 177.4 MB in the end (delta: -30.6 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28425.38 ms. Allocated memory was 250.1 MB in the beginning and 528.5 MB in the end (delta: 278.4 MB). Free memory was 177.4 MB in the beginning and 235.8 MB in the end (delta: -58.4 MB). Peak memory consumption was 220.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1396 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 105 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.5s, 126 PlacesBefore, 44 PlacesAfterwards, 116 TransitionsBefore, 31 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, 7247 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1525; [L835] FCALL, FORK 0 pthread_create(&t1525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1526; [L837] FCALL, FORK 0 pthread_create(&t1526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1527; [L839] FCALL, FORK 0 pthread_create(&t1527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1528; [L841] FCALL, FORK 0 pthread_create(&t1528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0: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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix057_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 28.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.6s, HoareTripleCheckerStatistics: 475 SDtfs, 648 SDslu, 833 SDs, 0 SdLazy, 377 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 383 SyntacticMatches, 20 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred 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.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 424 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 274 NumberOfCodeBlocks, 274 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 25036 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...