/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 15:20:35,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 15:20:35,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 15:20:35,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 15:20:35,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 15:20:35,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 15:20:35,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 15:20:35,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 15:20:35,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 15:20:35,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 15:20:35,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 15:20:35,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 15:20:35,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 15:20:35,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 15:20:35,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 15:20:35,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 15:20:35,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 15:20:35,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 15:20:35,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 15:20:35,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 15:20:35,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 15:20:35,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 15:20:35,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 15:20:35,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 15:20:35,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 15:20:35,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 15:20:35,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 15:20:35,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 15:20:35,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 15:20:35,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 15:20:35,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 15:20:35,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 15:20:35,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 15:20:35,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 15:20:35,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 15:20:35,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 15:20:35,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 15:20:35,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 15:20:35,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 15:20:35,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 15:20:35,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 15:20:35,770 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-WP.epf [2020-11-09 15:20:35,821 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 15:20:35,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 15:20:35,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 15:20:35,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 15:20:35,836 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 15:20:35,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 15:20:35,839 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 15:20:35,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 15:20:35,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 15:20:35,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 15:20:35,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 15:20:35,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 15:20:35,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 15:20:35,841 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 15:20:35,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 15:20:35,841 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 15:20:35,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 15:20:35,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 15:20:35,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 15:20:35,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 15:20:35,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 15:20:35,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:20:35,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 15:20:35,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 15:20:35,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 15:20:35,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 15:20:35,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 15:20:35,844 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 15:20:35,847 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 15:20:35,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 15:20:35,847 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 15:20:36,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 15:20:36,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 15:20:36,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 15:20:36,256 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 15:20:36,257 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 15:20:36,258 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i [2020-11-09 15:20:36,342 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee6e02ca7/08d00f9beaac44398067f2dd3099de04/FLAG67b598892 [2020-11-09 15:20:37,044 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 15:20:37,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i [2020-11-09 15:20:37,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee6e02ca7/08d00f9beaac44398067f2dd3099de04/FLAG67b598892 [2020-11-09 15:20:37,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee6e02ca7/08d00f9beaac44398067f2dd3099de04 [2020-11-09 15:20:37,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 15:20:37,280 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 15:20:37,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 15:20:37,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 15:20:37,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 15:20:37,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:20:37" (1/1) ... [2020-11-09 15:20:37,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c26b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:37, skipping insertion in model container [2020-11-09 15:20:37,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:20:37" (1/1) ... [2020-11-09 15:20:37,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 15:20:37,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 15:20:37,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:20:37,921 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 15:20:37,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:20:38,090 INFO L208 MainTranslator]: Completed translation [2020-11-09 15:20:38,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:38 WrapperNode [2020-11-09 15:20:38,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 15:20:38,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 15:20:38,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 15:20:38,094 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 15:20:38,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:38" (1/1) ... [2020-11-09 15:20:38,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:38" (1/1) ... [2020-11-09 15:20:38,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 15:20:38,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 15:20:38,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 15:20:38,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 15:20:38,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:38" (1/1) ... [2020-11-09 15:20:38,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:38" (1/1) ... [2020-11-09 15:20:38,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:38" (1/1) ... [2020-11-09 15:20:38,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:38" (1/1) ... [2020-11-09 15:20:38,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:38" (1/1) ... [2020-11-09 15:20:38,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:38" (1/1) ... [2020-11-09 15:20:38,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:38" (1/1) ... [2020-11-09 15:20:38,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 15:20:38,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 15:20:38,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 15:20:38,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 15:20:38,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:38" (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-11-09 15:20:38,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 15:20:38,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 15:20:38,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 15:20:38,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 15:20:38,321 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 15:20:38,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 15:20:38,321 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 15:20:38,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 15:20:38,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 15:20:38,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 15:20:38,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 15:20:38,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 15:20:38,324 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 15:20:40,584 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 15:20:40,585 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 15:20:40,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:20:40 BoogieIcfgContainer [2020-11-09 15:20:40,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 15:20:40,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 15:20:40,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 15:20:40,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 15:20:40,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:20:37" (1/3) ... [2020-11-09 15:20:40,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1878fc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:20:40, skipping insertion in model container [2020-11-09 15:20:40,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:20:38" (2/3) ... [2020-11-09 15:20:40,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1878fc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:20:40, skipping insertion in model container [2020-11-09 15:20:40,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:20:40" (3/3) ... [2020-11-09 15:20:40,597 INFO L111 eAbstractionObserver]: Analyzing ICFG mix041_power.opt.i [2020-11-09 15:20:40,615 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 15:20:40,615 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 15:20:40,619 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 15:20:40,620 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 15:20:40,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,656 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,656 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,656 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,657 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,662 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,662 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,663 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,663 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,663 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,664 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,665 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,666 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,675 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,675 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,680 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,682 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,682 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:20:40,685 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 15:20:40,698 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-09 15:20:40,719 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 15:20:40,719 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 15:20:40,719 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 15:20:40,719 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 15:20:40,719 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 15:20:40,720 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 15:20:40,720 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 15:20:40,720 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 15:20:40,735 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 15:20:40,735 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 88 transitions, 186 flow [2020-11-09 15:20:40,739 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 88 transitions, 186 flow [2020-11-09 15:20:40,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 92 places, 88 transitions, 186 flow [2020-11-09 15:20:40,786 INFO L129 PetriNetUnfolder]: 3/86 cut-off events. [2020-11-09 15:20:40,787 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 15:20:40,791 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 86 events. 3/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2020-11-09 15:20:40,794 INFO L116 LiptonReduction]: Number of co-enabled transitions 1182 [2020-11-09 15:20:41,303 WARN L194 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 15:20:41,486 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-09 15:20:42,068 WARN L194 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-11-09 15:20:42,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 15:20:42,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:42,554 WARN L194 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-11-09 15:20:42,741 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-11-09 15:20:42,866 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-11-09 15:20:43,043 WARN L194 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-09 15:20:44,626 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 15:20:44,752 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 15:20:44,997 WARN L194 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 15:20:45,226 WARN L194 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 15:20:45,761 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 15:20:45,873 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 15:20:46,083 WARN L194 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 15:20:46,320 WARN L194 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 15:20:48,886 WARN L194 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-11-09 15:20:48,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-11-09 15:20:48,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:20:48,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 15:20:48,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:20:50,431 WARN L194 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-11-09 15:20:53,059 WARN L194 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 310 DAG size of output: 265 [2020-11-09 15:20:53,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:20:53,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:53,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:20:53,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:53,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 1] term [2020-11-09 15:20:53,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:53,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:20:53,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:53,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:20:53,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:20:53,088 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-09 15:20:53,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-09 15:20:53,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:53,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:20:53,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:53,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:53,122 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 15:20:53,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:53,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:20:53,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:53,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:20:53,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:20:53,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:20:53,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:53,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:20:53,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:53,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:20:53,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:20:53,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:20:53,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:53,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:20:53,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:53,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:20:53,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:20:53,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:20:53,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:53,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:20:53,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:53,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:20:53,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:20:53,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:20:53,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:20:57,598 WARN L194 SmtUtils]: Spent 4.41 s on a formula simplification. DAG size of input: 361 DAG size of output: 274 [2020-11-09 15:20:59,263 WARN L194 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2020-11-09 15:20:59,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-11-09 15:20:59,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:20:59,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 15:20:59,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:21:00,112 WARN L194 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 108 [2020-11-09 15:21:02,746 WARN L194 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 313 DAG size of output: 269 [2020-11-09 15:21:02,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:21:02,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:21:02,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:21:02,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:21:02,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:21:02,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:21:02,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:21:02,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:21:02,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:21:02,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:21:02,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:21:02,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:21:02,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:21:02,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:21:02,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:21:02,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:21:02,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:21:02,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:21:02,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:21:02,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:21:02,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:21:02,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:21:02,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:21:02,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:21:02,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:21:02,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:21:02,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:21:02,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:21:02,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:21:02,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:21:02,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:21:02,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:21:02,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:21:02,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:21:02,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:21:02,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:21:02,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:21:06,636 WARN L194 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 359 DAG size of output: 244 [2020-11-09 15:21:07,760 WARN L194 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 137 DAG size of output: 128 [2020-11-09 15:21:08,279 WARN L194 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-11-09 15:21:12,827 WARN L194 SmtUtils]: Spent 4.55 s on a formula simplification. DAG size of input: 275 DAG size of output: 259 [2020-11-09 15:21:14,454 WARN L194 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 256 [2020-11-09 15:21:14,657 WARN L194 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-09 15:21:14,846 WARN L194 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 15:21:15,048 WARN L194 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-09 15:21:15,237 WARN L194 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 15:21:15,986 WARN L194 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2020-11-09 15:21:16,269 WARN L194 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 15:21:16,867 WARN L194 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2020-11-09 15:21:17,149 WARN L194 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 15:21:17,176 INFO L131 LiptonReduction]: Checked pairs total: 3208 [2020-11-09 15:21:17,176 INFO L133 LiptonReduction]: Total number of compositions: 87 [2020-11-09 15:21:17,183 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 20 transitions, 50 flow [2020-11-09 15:21:17,202 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 187 states. [2020-11-09 15:21:17,204 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states. [2020-11-09 15:21:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-09 15:21:17,210 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:21:17,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-09 15:21:17,212 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:21:17,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:21:17,218 INFO L82 PathProgramCache]: Analyzing trace with hash 926823553, now seen corresponding path program 1 times [2020-11-09 15:21:17,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:21:17,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671336776] [2020-11-09 15:21:17,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:21:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:21:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:21:17,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671336776] [2020-11-09 15:21:17,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:21:17,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:21:17,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1902850551] [2020-11-09 15:21:17,547 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:21:17,553 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:21:17,566 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-11-09 15:21:17,567 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:21:17,572 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:21:17,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:21:17,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:21:17,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:21:17,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:21:17,595 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 3 states. [2020-11-09 15:21:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:21:17,672 INFO L93 Difference]: Finished difference Result 162 states and 385 transitions. [2020-11-09 15:21:17,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:21:17,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-09 15:21:17,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:21:17,687 INFO L225 Difference]: With dead ends: 162 [2020-11-09 15:21:17,687 INFO L226 Difference]: Without dead ends: 132 [2020-11-09 15:21:17,689 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-11-09 15:21:17,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-11-09 15:21:17,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-11-09 15:21:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-11-09 15:21:17,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 306 transitions. [2020-11-09 15:21:17,743 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 306 transitions. Word has length 5 [2020-11-09 15:21:17,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:21:17,743 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 306 transitions. [2020-11-09 15:21:17,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:21:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 306 transitions. [2020-11-09 15:21:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-09 15:21:17,744 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:21:17,744 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:21:17,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 15:21:17,745 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:21:17,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:21:17,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1619268401, now seen corresponding path program 1 times [2020-11-09 15:21:17,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:21:17,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116488475] [2020-11-09 15:21:17,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:21:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:21:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:21:17,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116488475] [2020-11-09 15:21:17,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:21:17,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:21:17,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1101250697] [2020-11-09 15:21:17,895 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:21:17,897 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:21:17,901 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-11-09 15:21:17,902 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:21:17,902 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:21:17,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:21:17,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:21:17,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:21:17,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:21:17,908 INFO L87 Difference]: Start difference. First operand 132 states and 306 transitions. Second operand 3 states. [2020-11-09 15:21:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:21:17,931 INFO L93 Difference]: Finished difference Result 122 states and 278 transitions. [2020-11-09 15:21:17,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:21:17,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-09 15:21:17,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:21:17,937 INFO L225 Difference]: With dead ends: 122 [2020-11-09 15:21:17,937 INFO L226 Difference]: Without dead ends: 122 [2020-11-09 15:21:17,938 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-11-09 15:21:17,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-09 15:21:17,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-11-09 15:21:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-11-09 15:21:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 278 transitions. [2020-11-09 15:21:17,967 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 278 transitions. Word has length 7 [2020-11-09 15:21:17,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:21:17,967 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 278 transitions. [2020-11-09 15:21:17,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:21:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 278 transitions. [2020-11-09 15:21:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 15:21:17,974 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:21:17,974 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:21:17,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 15:21:17,974 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:21:17,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:21:17,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1303932898, now seen corresponding path program 1 times [2020-11-09 15:21:17,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:21:17,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661722438] [2020-11-09 15:21:17,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:21:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:21:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:21:18,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661722438] [2020-11-09 15:21:18,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:21:18,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:21:18,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [760916362] [2020-11-09 15:21:18,132 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:21:18,133 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:21:18,136 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 15 transitions. [2020-11-09 15:21:18,136 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:21:18,144 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:21:18,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:18,146 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:21:18,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:18,250 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:21:18,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:21:18,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:21:18,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:21:18,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:21:18,252 INFO L87 Difference]: Start difference. First operand 122 states and 278 transitions. Second operand 5 states. [2020-11-09 15:21:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:21:18,398 INFO L93 Difference]: Finished difference Result 134 states and 299 transitions. [2020-11-09 15:21:18,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:21:18,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-11-09 15:21:18,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:21:18,403 INFO L225 Difference]: With dead ends: 134 [2020-11-09 15:21:18,403 INFO L226 Difference]: Without dead ends: 134 [2020-11-09 15:21:18,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:21:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-11-09 15:21:18,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-11-09 15:21:18,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-09 15:21:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 299 transitions. [2020-11-09 15:21:18,419 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 299 transitions. Word has length 9 [2020-11-09 15:21:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:21:18,419 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 299 transitions. [2020-11-09 15:21:18,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:21:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 299 transitions. [2020-11-09 15:21:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 15:21:18,424 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:21:18,425 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:21:18,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 15:21:18,425 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:21:18,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:21:18,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1050992703, now seen corresponding path program 1 times [2020-11-09 15:21:18,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:21:18,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258880879] [2020-11-09 15:21:18,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:21:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:21:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:21:18,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258880879] [2020-11-09 15:21:18,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:21:18,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:21:18,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1382068141] [2020-11-09 15:21:18,635 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:21:18,637 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:21:18,640 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 21 transitions. [2020-11-09 15:21:18,641 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:21:18,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:21:18,843 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:21:18,852 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1680#(not (= 2 ~__unbuffered_cnt~0))] [2020-11-09 15:21:18,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:21:18,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:21:18,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:21:18,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:21:18,854 INFO L87 Difference]: Start difference. First operand 134 states and 299 transitions. Second operand 5 states. [2020-11-09 15:21:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:21:18,962 INFO L93 Difference]: Finished difference Result 87 states and 174 transitions. [2020-11-09 15:21:18,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:21:18,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-11-09 15:21:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:21:18,964 INFO L225 Difference]: With dead ends: 87 [2020-11-09 15:21:18,964 INFO L226 Difference]: Without dead ends: 51 [2020-11-09 15:21:18,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:21:18,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-11-09 15:21:18,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-11-09 15:21:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-09 15:21:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2020-11-09 15:21:18,972 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 11 [2020-11-09 15:21:18,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:21:18,972 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2020-11-09 15:21:18,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:21:18,973 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2020-11-09 15:21:18,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:21:18,975 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:21:18,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:21:18,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 15:21:18,975 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:21:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:21:18,978 INFO L82 PathProgramCache]: Analyzing trace with hash 258980126, now seen corresponding path program 1 times [2020-11-09 15:21:18,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:21:18,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058575662] [2020-11-09 15:21:18,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:21:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:21:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:21:19,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058575662] [2020-11-09 15:21:19,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:21:19,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:21:19,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1665634430] [2020-11-09 15:21:19,115 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:21:19,118 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:21:19,125 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 40 transitions. [2020-11-09 15:21:19,125 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:21:19,161 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:21:19,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:19,163 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:21:19,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:19,165 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:21:19,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:19,221 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:21:19,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:19,223 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:21:19,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:19,224 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:21:19,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:19,317 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:21:19,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:19,319 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:21:19,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:19,320 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:21:19,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:19,351 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:21:19,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:21:19,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:21:19,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:21:19,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:21:19,352 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand 4 states. [2020-11-09 15:21:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:21:19,382 INFO L93 Difference]: Finished difference Result 59 states and 91 transitions. [2020-11-09 15:21:19,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:21:19,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-09 15:21:19,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:21:19,385 INFO L225 Difference]: With dead ends: 59 [2020-11-09 15:21:19,385 INFO L226 Difference]: Without dead ends: 25 [2020-11-09 15:21:19,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-11-09 15:21:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-11-09 15:21:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-11-09 15:21:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-09 15:21:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-11-09 15:21:19,389 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2020-11-09 15:21:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:21:19,389 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-11-09 15:21:19,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:21:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-11-09 15:21:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:21:19,390 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:21:19,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:21:19,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 15:21:19,390 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:21:19,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:21:19,391 INFO L82 PathProgramCache]: Analyzing trace with hash 598532766, now seen corresponding path program 2 times [2020-11-09 15:21:19,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:21:19,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546673436] [2020-11-09 15:21:19,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:21:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:21:19,898 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2020-11-09 15:21:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:21:19,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546673436] [2020-11-09 15:21:19,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:21:19,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 15:21:19,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1546756832] [2020-11-09 15:21:19,955 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:21:19,959 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:21:19,964 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 24 transitions. [2020-11-09 15:21:19,965 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:21:19,993 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 3, 2, 1] term [2020-11-09 15:21:19,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:19,995 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-11-09 15:21:19,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:19,997 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:21:19,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:20,000 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:21:20,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:21:20,002 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-11-09 15:21:20,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:20,003 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 6, 1] term [2020-11-09 15:21:20,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:21:20,008 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 2, 3, 6, 1] term [2020-11-09 15:21:20,009 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:21:20,487 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:21:20,488 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:20,489 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 3, 3, 2, 2, 1] term [2020-11-09 15:21:20,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:21:20,492 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 6, 3, 2, 2, 1] term [2020-11-09 15:21:20,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:21:21,038 WARN L194 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 22 [2020-11-09 15:21:21,040 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [1985#(and (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (<= 0 ~x$w_buff1_used~0) (= 0 ~x$w_buff1~0) (<= ~x$w_buff1_used~0 0) (or (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))] [2020-11-09 15:21:21,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 15:21:21,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:21:21,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 15:21:21,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-09 15:21:21,041 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 9 states. [2020-11-09 15:21:21,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:21:21,286 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2020-11-09 15:21:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:21:21,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-11-09 15:21:21,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:21:21,288 INFO L225 Difference]: With dead ends: 33 [2020-11-09 15:21:21,288 INFO L226 Difference]: Without dead ends: 21 [2020-11-09 15:21:21,288 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:21:21,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-11-09 15:21:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-11-09 15:21:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-11-09 15:21:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-11-09 15:21:21,290 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2020-11-09 15:21:21,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:21:21,291 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-11-09 15:21:21,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 15:21:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-11-09 15:21:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:21:21,291 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:21:21,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:21:21,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 15:21:21,292 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:21:21,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:21:21,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1247248418, now seen corresponding path program 3 times [2020-11-09 15:21:21,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:21:21,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704828084] [2020-11-09 15:21:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:21:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:21:21,353 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:21:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:21:21,415 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:21:21,477 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 15:21:21,477 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 15:21:21,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 15:21:21,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 03:21:21 BasicIcfg [2020-11-09 15:21:21,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 15:21:21,614 INFO L168 Benchmark]: Toolchain (without parser) took 44345.41 ms. Allocated memory was 157.3 MB in the beginning and 332.4 MB in the end (delta: 175.1 MB). Free memory was 114.5 MB in the beginning and 115.8 MB in the end (delta: -1.3 MB). Peak memory consumption was 174.9 MB. Max. memory is 8.0 GB. [2020-11-09 15:21:21,618 INFO L168 Benchmark]: CDTParser took 0.72 ms. Allocated memory is still 157.3 MB. Free memory is still 132.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:21:21,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.89 ms. Allocated memory is still 157.3 MB. Free memory was 113.8 MB in the beginning and 137.4 MB in the end (delta: -23.6 MB). Peak memory consumption was 14.9 MB. Max. memory is 8.0 GB. [2020-11-09 15:21:21,620 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.03 ms. Allocated memory is still 157.3 MB. Free memory was 137.4 MB in the beginning and 135.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:21:21,620 INFO L168 Benchmark]: Boogie Preprocessor took 43.91 ms. Allocated memory is still 157.3 MB. Free memory was 135.9 MB in the beginning and 133.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:21:21,621 INFO L168 Benchmark]: RCFGBuilder took 2350.67 ms. Allocated memory was 157.3 MB in the beginning and 188.7 MB in the end (delta: 31.5 MB). Free memory was 133.3 MB in the beginning and 123.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 102.3 MB. Max. memory is 8.0 GB. [2020-11-09 15:21:21,622 INFO L168 Benchmark]: TraceAbstraction took 41023.33 ms. Allocated memory was 188.7 MB in the beginning and 332.4 MB in the end (delta: 143.7 MB). Free memory was 122.7 MB in the beginning and 115.8 MB in the end (delta: 6.9 MB). Peak memory consumption was 150.6 MB. Max. memory is 8.0 GB. [2020-11-09 15:21:21,636 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.72 ms. Allocated memory is still 157.3 MB. Free memory is still 132.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 810.89 ms. Allocated memory is still 157.3 MB. Free memory was 113.8 MB in the beginning and 137.4 MB in the end (delta: -23.6 MB). Peak memory consumption was 14.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 97.03 ms. Allocated memory is still 157.3 MB. Free memory was 137.4 MB in the beginning and 135.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.91 ms. Allocated memory is still 157.3 MB. Free memory was 135.9 MB in the beginning and 133.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2350.67 ms. Allocated memory was 157.3 MB in the beginning and 188.7 MB in the end (delta: 31.5 MB). Free memory was 133.3 MB in the beginning and 123.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 102.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 41023.33 ms. Allocated memory was 188.7 MB in the beginning and 332.4 MB in the end (delta: 143.7 MB). Free memory was 122.7 MB in the beginning and 115.8 MB in the end (delta: 6.9 MB). Peak memory consumption was 150.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 659 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 42 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 36.4s, 92 PlacesBefore, 27 PlacesAfterwards, 88 TransitionsBefore, 20 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 87 TotalNumberOfCompositions, 3208 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091; [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1092; [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix041_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 86 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 40.7s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 36.4s, HoareTripleCheckerStatistics: 100 SDtfs, 86 SDslu, 127 SDs, 0 SdLazy, 89 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 6246 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...