/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-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 17:11:54,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 17:11:54,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 17:11:54,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 17:11:54,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 17:11:54,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 17:11:54,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 17:11:54,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 17:11:54,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 17:11:54,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 17:11:54,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 17:11:54,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 17:11:54,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 17:11:54,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 17:11:54,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 17:11:54,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 17:11:54,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 17:11:54,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 17:11:54,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 17:11:54,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 17:11:54,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 17:11:54,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 17:11:54,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 17:11:54,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 17:11:54,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 17:11:54,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 17:11:54,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 17:11:54,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 17:11:54,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 17:11:54,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 17:11:54,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 17:11:54,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 17:11:54,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 17:11:54,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 17:11:54,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 17:11:54,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 17:11:54,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 17:11:54,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 17:11:54,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 17:11:54,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 17:11:54,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 17:11:54,937 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-11-09 17:11:55,005 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 17:11:55,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 17:11:55,010 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 17:11:55,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 17:11:55,011 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 17:11:55,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 17:11:55,011 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 17:11:55,011 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 17:11:55,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 17:11:55,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 17:11:55,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 17:11:55,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 17:11:55,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 17:11:55,014 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 17:11:55,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 17:11:55,014 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 17:11:55,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 17:11:55,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 17:11:55,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 17:11:55,015 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 17:11:55,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 17:11:55,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 17:11:55,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 17:11:55,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 17:11:55,016 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 17:11:55,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 17:11:55,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 17:11:55,016 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 17:11:55,017 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 17:11:55,017 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 17:11:55,017 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 17:11:55,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 17:11:55,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 17:11:55,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 17:11:55,484 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 17:11:55,485 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 17:11:55,486 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2020-11-09 17:11:55,559 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db8b8fbb/c9837e2ed14b40b5a7eba5bc15b02349/FLAG4871a6891 [2020-11-09 17:11:56,245 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 17:11:56,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2020-11-09 17:11:56,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db8b8fbb/c9837e2ed14b40b5a7eba5bc15b02349/FLAG4871a6891 [2020-11-09 17:11:56,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db8b8fbb/c9837e2ed14b40b5a7eba5bc15b02349 [2020-11-09 17:11:56,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 17:11:56,493 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 17:11:56,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 17:11:56,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 17:11:56,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 17:11:56,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:11:56" (1/1) ... [2020-11-09 17:11:56,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1635be52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:56, skipping insertion in model container [2020-11-09 17:11:56,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:11:56" (1/1) ... [2020-11-09 17:11:56,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 17:11:56,593 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 17:11:57,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 17:11:57,045 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 17:11:57,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 17:11:57,328 INFO L208 MainTranslator]: Completed translation [2020-11-09 17:11:57,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:57 WrapperNode [2020-11-09 17:11:57,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 17:11:57,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 17:11:57,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 17:11:57,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 17:11:57,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:57" (1/1) ... [2020-11-09 17:11:57,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:57" (1/1) ... [2020-11-09 17:11:57,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 17:11:57,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 17:11:57,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 17:11:57,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 17:11:57,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:57" (1/1) ... [2020-11-09 17:11:57,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:57" (1/1) ... [2020-11-09 17:11:57,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:57" (1/1) ... [2020-11-09 17:11:57,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:57" (1/1) ... [2020-11-09 17:11:57,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:57" (1/1) ... [2020-11-09 17:11:57,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:57" (1/1) ... [2020-11-09 17:11:57,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:57" (1/1) ... [2020-11-09 17:11:57,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 17:11:57,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 17:11:57,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 17:11:57,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 17:11:57,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:57" (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 17:11:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 17:11:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 17:11:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 17:11:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 17:11:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 17:11:57,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 17:11:57,587 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 17:11:57,587 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 17:11:57,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 17:11:57,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 17:11:57,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 17:11:57,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 17:11:57,589 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 17:11:59,692 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 17:11:59,693 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 17:11:59,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:11:59 BoogieIcfgContainer [2020-11-09 17:11:59,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 17:11:59,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 17:11:59,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 17:11:59,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 17:11:59,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:11:56" (1/3) ... [2020-11-09 17:11:59,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507ea19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:11:59, skipping insertion in model container [2020-11-09 17:11:59,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:11:57" (2/3) ... [2020-11-09 17:11:59,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507ea19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:11:59, skipping insertion in model container [2020-11-09 17:11:59,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:11:59" (3/3) ... [2020-11-09 17:11:59,704 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2020-11-09 17:11:59,720 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 17:11:59,720 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 17:11:59,724 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 17:11:59,725 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 17:11:59,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,758 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,758 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,759 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,759 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,763 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,763 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,764 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,764 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,764 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,765 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,765 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,767 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,768 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,775 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,776 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,776 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,776 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,784 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,786 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,786 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:11:59,788 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 17:11:59,800 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-09 17:11:59,822 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 17:11:59,822 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 17:11:59,822 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 17:11:59,822 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 17:11:59,823 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 17:11:59,823 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 17:11:59,823 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 17:11:59,823 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 17:11:59,835 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 17:11:59,836 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 83 transitions, 176 flow [2020-11-09 17:11:59,839 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 176 flow [2020-11-09 17:11:59,840 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 176 flow [2020-11-09 17:11:59,883 INFO L129 PetriNetUnfolder]: 3/81 cut-off events. [2020-11-09 17:11:59,883 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 17:11:59,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 3/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2020-11-09 17:11:59,889 INFO L116 LiptonReduction]: Number of co-enabled transitions 1038 [2020-11-09 17:12:00,252 WARN L194 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 17:12:00,373 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-09 17:12:00,966 WARN L194 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-11-09 17:12:00,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 17:12:00,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:01,401 WARN L194 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-11-09 17:12:02,209 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-11-09 17:12:02,364 WARN L194 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-09 17:12:05,172 WARN L194 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-11-09 17:12:05,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-11-09 17:12:05,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:05,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-09 17:12:05,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:06,276 WARN L194 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 143 DAG size of output: 113 [2020-11-09 17:12:08,679 WARN L194 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-11-09 17:12:08,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:08,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:08,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:08,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:08,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:12:08,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:08,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 17:12:08,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:08,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 17:12:08,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:08,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:12:08,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:08,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:08,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:08,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:08,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:08,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:12:08,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:08,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:08,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:08,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:08,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:08,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:12:08,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:08,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:08,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:08,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:08,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:08,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:08,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 17:12:08,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:08,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:08,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:08,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 17:12:08,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:08,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 17:12:08,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:12,158 WARN L194 SmtUtils]: Spent 3.35 s on a formula simplification. DAG size of input: 355 DAG size of output: 250 [2020-11-09 17:12:13,344 WARN L194 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 227 DAG size of output: 187 [2020-11-09 17:12:13,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-11-09 17:12:13,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:13,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-09 17:12:13,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:14,162 WARN L194 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 106 [2020-11-09 17:12:16,668 WARN L194 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 311 DAG size of output: 267 [2020-11-09 17:12:16,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 17:12:16,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:16,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 17:12:16,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:16,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:16,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:16,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:16,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:16,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:16,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 17:12:16,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 17:12:16,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:16,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:16,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:16,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:16,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 3, 2, 1] term [2020-11-09 17:12:16,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:16,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 3, 2, 1] term [2020-11-09 17:12:16,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 17:12:16,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 1] term [2020-11-09 17:12:16,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:16,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-09 17:12:16,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:16,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 2, 1] term [2020-11-09 17:12:16,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:16,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:16,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:16,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:16,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:16,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:12:16,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:16,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:16,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:16,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:16,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:16,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:12:16,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:16,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:16,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:16,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:16,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:16,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:12:16,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:16,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 17:12:16,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:16,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 17:12:16,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:16,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:12:16,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:20,017 WARN L194 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 365 DAG size of output: 229 [2020-11-09 17:12:20,855 WARN L194 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-11-09 17:12:21,222 WARN L194 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-11-09 17:12:22,390 WARN L194 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 245 [2020-11-09 17:12:23,566 WARN L194 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 245 [2020-11-09 17:12:23,724 WARN L194 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-11-09 17:12:23,943 WARN L194 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-11-09 17:12:24,491 WARN L194 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-11-09 17:12:24,848 WARN L194 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-11-09 17:12:25,759 WARN L194 SmtUtils]: Spent 908.00 ms on a formula simplification that was a NOOP. DAG size: 217 [2020-11-09 17:12:26,704 WARN L194 SmtUtils]: Spent 941.00 ms on a formula simplification that was a NOOP. DAG size: 217 [2020-11-09 17:12:26,972 WARN L194 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 1 [2020-11-09 17:12:27,096 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-09 17:12:27,224 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-09 17:12:27,337 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-09 17:12:27,442 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-09 17:12:27,813 WARN L194 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-11-09 17:12:28,195 WARN L194 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-11-09 17:12:29,400 WARN L194 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 247 [2020-11-09 17:12:30,635 WARN L194 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 247 [2020-11-09 17:12:31,152 WARN L194 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-11-09 17:12:31,400 WARN L194 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-11-09 17:12:31,861 WARN L194 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-11-09 17:12:32,080 WARN L194 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-11-09 17:12:32,084 INFO L131 LiptonReduction]: Checked pairs total: 2421 [2020-11-09 17:12:32,084 INFO L133 LiptonReduction]: Total number of compositions: 77 [2020-11-09 17:12:32,092 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-11-09 17:12:32,115 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-11-09 17:12:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-11-09 17:12:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-09 17:12:32,126 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:12:32,127 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-09 17:12:32,127 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:12:32,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:12:32,141 INFO L82 PathProgramCache]: Analyzing trace with hash 907060207, now seen corresponding path program 1 times [2020-11-09 17:12:32,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:12:32,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343117598] [2020-11-09 17:12:32,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:12:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:12:32,402 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 17:12:32,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343117598] [2020-11-09 17:12:32,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:12:32,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:12:32,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1316826963] [2020-11-09 17:12:32,408 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:12:32,412 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:12:32,425 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-11-09 17:12:32,425 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:12:32,430 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:12:32,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:12:32,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:12:32,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:12:32,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:12:32,454 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-11-09 17:12:32,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:12:32,554 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-11-09 17:12:32,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:12:32,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-09 17:12:32,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:12:32,573 INFO L225 Difference]: With dead ends: 137 [2020-11-09 17:12:32,573 INFO L226 Difference]: Without dead ends: 112 [2020-11-09 17:12:32,574 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 17:12:32,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-09 17:12:32,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-09 17:12:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-09 17:12:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-11-09 17:12:32,654 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-11-09 17:12:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:12:32,654 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-11-09 17:12:32,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:12:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-11-09 17:12:32,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-09 17:12:32,655 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:12:32,655 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:12:32,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 17:12:32,658 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:12:32,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:12:32,662 INFO L82 PathProgramCache]: Analyzing trace with hash -193428177, now seen corresponding path program 1 times [2020-11-09 17:12:32,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:12:32,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182824996] [2020-11-09 17:12:32,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:12:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:12:32,869 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 17:12:32,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182824996] [2020-11-09 17:12:32,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:12:32,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 17:12:32,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [83245294] [2020-11-09 17:12:32,871 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:12:32,872 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:12:32,874 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-11-09 17:12:32,874 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:12:32,874 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:12:32,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:12:32,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:12:32,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:12:32,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:12:32,877 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 4 states. [2020-11-09 17:12:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:12:32,933 INFO L93 Difference]: Finished difference Result 111 states and 252 transitions. [2020-11-09 17:12:32,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:12:32,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-11-09 17:12:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:12:32,943 INFO L225 Difference]: With dead ends: 111 [2020-11-09 17:12:32,943 INFO L226 Difference]: Without dead ends: 111 [2020-11-09 17:12:32,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:12:32,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-11-09 17:12:32,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-11-09 17:12:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-11-09 17:12:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 252 transitions. [2020-11-09 17:12:32,968 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 252 transitions. Word has length 7 [2020-11-09 17:12:32,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:12:32,971 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 252 transitions. [2020-11-09 17:12:32,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:12:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 252 transitions. [2020-11-09 17:12:32,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-09 17:12:32,972 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:12:32,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:12:32,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 17:12:32,972 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:12:32,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:12:32,974 INFO L82 PathProgramCache]: Analyzing trace with hash 2141230383, now seen corresponding path program 1 times [2020-11-09 17:12:32,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:12:32,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776343768] [2020-11-09 17:12:32,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:12:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:12:33,135 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 17:12:33,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776343768] [2020-11-09 17:12:33,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:12:33,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:12:33,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [894488851] [2020-11-09 17:12:33,136 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:12:33,137 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:12:33,140 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 16 transitions. [2020-11-09 17:12:33,140 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:12:33,157 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:12:33,158 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:12:33,158 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:12:33,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:12:33,231 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:12:33,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:12:33,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:12:33,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:12:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:12:33,233 INFO L87 Difference]: Start difference. First operand 111 states and 252 transitions. Second operand 3 states. [2020-11-09 17:12:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:12:33,273 INFO L93 Difference]: Finished difference Result 107 states and 241 transitions. [2020-11-09 17:12:33,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:12:33,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-11-09 17:12:33,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:12:33,276 INFO L225 Difference]: With dead ends: 107 [2020-11-09 17:12:33,277 INFO L226 Difference]: Without dead ends: 107 [2020-11-09 17:12:33,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:12:33,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-09 17:12:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-11-09 17:12:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-09 17:12:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 241 transitions. [2020-11-09 17:12:33,286 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 241 transitions. Word has length 8 [2020-11-09 17:12:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:12:33,287 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 241 transitions. [2020-11-09 17:12:33,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:12:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 241 transitions. [2020-11-09 17:12:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-09 17:12:33,288 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:12:33,288 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:12:33,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 17:12:33,288 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:12:33,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:12:33,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1701307072, now seen corresponding path program 1 times [2020-11-09 17:12:33,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:12:33,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827311850] [2020-11-09 17:12:33,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:12:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:12:33,365 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 17:12:33,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827311850] [2020-11-09 17:12:33,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:12:33,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 17:12:33,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2099009606] [2020-11-09 17:12:33,366 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:12:33,367 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:12:33,369 INFO L252 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-11-09 17:12:33,369 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:12:33,369 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:12:33,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:12:33,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:12:33,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:12:33,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:12:33,370 INFO L87 Difference]: Start difference. First operand 107 states and 241 transitions. Second operand 4 states. [2020-11-09 17:12:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:12:33,444 INFO L93 Difference]: Finished difference Result 106 states and 238 transitions. [2020-11-09 17:12:33,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:12:33,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-11-09 17:12:33,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:12:33,447 INFO L225 Difference]: With dead ends: 106 [2020-11-09 17:12:33,447 INFO L226 Difference]: Without dead ends: 106 [2020-11-09 17:12:33,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 17:12:33,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-11-09 17:12:33,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-11-09 17:12:33,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-09 17:12:33,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 238 transitions. [2020-11-09 17:12:33,455 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 238 transitions. Word has length 8 [2020-11-09 17:12:33,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:12:33,455 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 238 transitions. [2020-11-09 17:12:33,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:12:33,455 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 238 transitions. [2020-11-09 17:12:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 17:12:33,456 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:12:33,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:12:33,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 17:12:33,457 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:12:33,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:12:33,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1953631552, now seen corresponding path program 1 times [2020-11-09 17:12:33,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:12:33,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562055205] [2020-11-09 17:12:33,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:12:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:12:33,612 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 17:12:33,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562055205] [2020-11-09 17:12:33,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:12:33,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:12:33,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1480299476] [2020-11-09 17:12:33,613 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:12:33,614 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:12:33,617 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2020-11-09 17:12:33,617 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:12:33,660 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 17:12:33,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:12:33,661 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 17:12:33,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:12:33,708 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:12:33,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 17:12:33,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:12:33,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 17:12:33,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:12:33,709 INFO L87 Difference]: Start difference. First operand 106 states and 238 transitions. Second operand 5 states. [2020-11-09 17:12:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:12:33,809 INFO L93 Difference]: Finished difference Result 113 states and 249 transitions. [2020-11-09 17:12:33,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:12:33,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-11-09 17:12:33,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:12:33,813 INFO L225 Difference]: With dead ends: 113 [2020-11-09 17:12:33,813 INFO L226 Difference]: Without dead ends: 113 [2020-11-09 17:12:33,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 17:12:33,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-11-09 17:12:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-11-09 17:12:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-11-09 17:12:33,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 249 transitions. [2020-11-09 17:12:33,822 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 249 transitions. Word has length 9 [2020-11-09 17:12:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:12:33,822 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 249 transitions. [2020-11-09 17:12:33,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 17:12:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 249 transitions. [2020-11-09 17:12:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 17:12:33,823 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:12:33,823 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:12:33,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 17:12:33,824 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:12:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:12:33,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1426394591, now seen corresponding path program 1 times [2020-11-09 17:12:33,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:12:33,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365064019] [2020-11-09 17:12:33,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:12:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:12:33,880 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 17:12:33,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365064019] [2020-11-09 17:12:33,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:12:33,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 17:12:33,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1137180175] [2020-11-09 17:12:33,881 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:12:33,883 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:12:33,885 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-11-09 17:12:33,885 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:12:33,885 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:12:33,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:12:33,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:12:33,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:12:33,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:12:33,887 INFO L87 Difference]: Start difference. First operand 113 states and 249 transitions. Second operand 3 states. [2020-11-09 17:12:33,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:12:33,902 INFO L93 Difference]: Finished difference Result 153 states and 326 transitions. [2020-11-09 17:12:33,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:12:33,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 17:12:33,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:12:33,904 INFO L225 Difference]: With dead ends: 153 [2020-11-09 17:12:33,905 INFO L226 Difference]: Without dead ends: 95 [2020-11-09 17:12:33,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:12:33,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-09 17:12:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2020-11-09 17:12:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-09 17:12:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 182 transitions. [2020-11-09 17:12:33,910 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 182 transitions. Word has length 10 [2020-11-09 17:12:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:12:33,910 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 182 transitions. [2020-11-09 17:12:33,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:12:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 182 transitions. [2020-11-09 17:12:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 17:12:33,911 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:12:33,911 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:12:33,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 17:12:33,912 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:12:33,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:12:33,912 INFO L82 PathProgramCache]: Analyzing trace with hash 539156191, now seen corresponding path program 1 times [2020-11-09 17:12:33,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:12:33,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148220767] [2020-11-09 17:12:33,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:12:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:12:34,065 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 17:12:34,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148220767] [2020-11-09 17:12:34,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:12:34,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 17:12:34,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1033033879] [2020-11-09 17:12:34,066 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:12:34,069 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:12:34,072 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 23 transitions. [2020-11-09 17:12:34,073 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:12:34,198 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2449#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (= 0 ~x$r_buff0_thd1~0))] [2020-11-09 17:12:34,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 17:12:34,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:12:34,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 17:12:34,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:12:34,199 INFO L87 Difference]: Start difference. First operand 89 states and 182 transitions. Second operand 7 states. [2020-11-09 17:12:34,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:12:34,385 INFO L93 Difference]: Finished difference Result 109 states and 212 transitions. [2020-11-09 17:12:34,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 17:12:34,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-11-09 17:12:34,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:12:34,389 INFO L225 Difference]: With dead ends: 109 [2020-11-09 17:12:34,389 INFO L226 Difference]: Without dead ends: 69 [2020-11-09 17:12:34,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-11-09 17:12:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-09 17:12:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2020-11-09 17:12:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-09 17:12:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 122 transitions. [2020-11-09 17:12:34,398 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 122 transitions. Word has length 11 [2020-11-09 17:12:34,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:12:34,399 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 122 transitions. [2020-11-09 17:12:34,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 17:12:34,399 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 122 transitions. [2020-11-09 17:12:34,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 17:12:34,400 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:12:34,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:12:34,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 17:12:34,402 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:12:34,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:12:34,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1268585729, now seen corresponding path program 1 times [2020-11-09 17:12:34,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:12:34,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582245989] [2020-11-09 17:12:34,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:12:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:12:34,569 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 17:12:34,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582245989] [2020-11-09 17:12:34,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:12:34,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:12:34,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1551860247] [2020-11-09 17:12:34,571 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:12:34,575 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:12:34,579 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-11-09 17:12:34,580 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:12:34,583 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:12:34,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:12:34,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:12:34,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:12:34,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:12:34,584 INFO L87 Difference]: Start difference. First operand 63 states and 122 transitions. Second operand 4 states. [2020-11-09 17:12:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:12:34,661 INFO L93 Difference]: Finished difference Result 78 states and 141 transitions. [2020-11-09 17:12:34,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 17:12:34,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-09 17:12:34,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:12:34,664 INFO L225 Difference]: With dead ends: 78 [2020-11-09 17:12:34,664 INFO L226 Difference]: Without dead ends: 61 [2020-11-09 17:12:34,664 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 17:12:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-11-09 17:12:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-11-09 17:12:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-09 17:12:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 118 transitions. [2020-11-09 17:12:34,667 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 118 transitions. Word has length 11 [2020-11-09 17:12:34,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:12:34,668 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 118 transitions. [2020-11-09 17:12:34,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:12:34,668 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 118 transitions. [2020-11-09 17:12:34,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 17:12:34,669 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:12:34,669 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:12:34,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 17:12:34,669 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:12:34,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:12:34,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1626460929, now seen corresponding path program 2 times [2020-11-09 17:12:34,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:12:34,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235267853] [2020-11-09 17:12:34,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:12:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:12:34,859 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 17:12:34,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235267853] [2020-11-09 17:12:34,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:12:34,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 17:12:34,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [991830424] [2020-11-09 17:12:34,861 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:12:34,863 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:12:34,867 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 38 transitions. [2020-11-09 17:12:34,867 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:12:34,922 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:12:34,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:12:34,923 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:12:34,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:12:34,924 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:12:34,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:12:34,963 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:12:34,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:12:34,964 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:12:34,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:12:34,965 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:12:34,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:12:35,006 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 1] term [2020-11-09 17:12:35,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:12:35,046 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2900#(and (= 0 ~x$r_buff0_thd0~0) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 0 ULTIMATE.start_assume_abort_if_not_~cond))] [2020-11-09 17:12:35,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 17:12:35,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:12:35,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 17:12:35,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-09 17:12:35,048 INFO L87 Difference]: Start difference. First operand 61 states and 118 transitions. Second operand 6 states. [2020-11-09 17:12:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:12:35,241 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2020-11-09 17:12:35,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 17:12:35,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-11-09 17:12:35,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:12:35,243 INFO L225 Difference]: With dead ends: 56 [2020-11-09 17:12:35,243 INFO L226 Difference]: Without dead ends: 40 [2020-11-09 17:12:35,244 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-09 17:12:35,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-11-09 17:12:35,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-11-09 17:12:35,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-09 17:12:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2020-11-09 17:12:35,246 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 11 [2020-11-09 17:12:35,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:12:35,246 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-11-09 17:12:35,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 17:12:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2020-11-09 17:12:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 17:12:35,249 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:12:35,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:12:35,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 17:12:35,250 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:12:35,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:12:35,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1119968960, now seen corresponding path program 1 times [2020-11-09 17:12:35,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:12:35,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659269952] [2020-11-09 17:12:35,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:12:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:12:35,367 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 17:12:35,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659269952] [2020-11-09 17:12:35,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:12:35,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 17:12:35,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [137552160] [2020-11-09 17:12:35,369 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:12:35,370 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:12:35,376 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 27 transitions. [2020-11-09 17:12:35,376 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:12:35,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:12:35,473 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:12:35,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 17:12:35,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:12:35,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 17:12:35,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:12:35,475 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 5 states. [2020-11-09 17:12:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:12:35,528 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-11-09 17:12:35,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 17:12:35,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-09 17:12:35,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:12:35,534 INFO L225 Difference]: With dead ends: 31 [2020-11-09 17:12:35,534 INFO L226 Difference]: Without dead ends: 20 [2020-11-09 17:12:35,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 17:12:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-11-09 17:12:35,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-11-09 17:12:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-09 17:12:35,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-11-09 17:12:35,536 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2020-11-09 17:12:35,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:12:35,536 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-11-09 17:12:35,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 17:12:35,536 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-11-09 17:12:35,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 17:12:35,537 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:12:35,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:12:35,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 17:12:35,537 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:12:35,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:12:35,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1283443941, now seen corresponding path program 1 times [2020-11-09 17:12:35,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:12:35,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803128235] [2020-11-09 17:12:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:12:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 17:12:35,582 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 17:12:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 17:12:35,627 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 17:12:35,677 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 17:12:35,677 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 17:12:35,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 17:12:35,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:12:35 BasicIcfg [2020-11-09 17:12:35,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 17:12:35,752 INFO L168 Benchmark]: Toolchain (without parser) took 39264.29 ms. Allocated memory was 160.4 MB in the beginning and 350.2 MB in the end (delta: 189.8 MB). Free memory was 134.3 MB in the beginning and 315.0 MB in the end (delta: -180.7 MB). Peak memory consumption was 210.8 MB. Max. memory is 8.0 GB. [2020-11-09 17:12:35,752 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 160.4 MB. Free memory is still 135.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 17:12:35,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 832.30 ms. Allocated memory is still 160.4 MB. Free memory was 133.8 MB in the beginning and 136.9 MB in the end (delta: -3.1 MB). Peak memory consumption was 32.5 MB. Max. memory is 8.0 GB. [2020-11-09 17:12:35,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.52 ms. Allocated memory is still 160.4 MB. Free memory was 136.9 MB in the beginning and 134.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-09 17:12:35,754 INFO L168 Benchmark]: Boogie Preprocessor took 60.31 ms. Allocated memory is still 160.4 MB. Free memory was 134.3 MB in the beginning and 132.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 17:12:35,756 INFO L168 Benchmark]: RCFGBuilder took 2195.84 ms. Allocated memory was 160.4 MB in the beginning and 195.0 MB in the end (delta: 34.6 MB). Free memory was 132.2 MB in the beginning and 140.5 MB in the end (delta: -8.3 MB). Peak memory consumption was 106.4 MB. Max. memory is 8.0 GB. [2020-11-09 17:12:35,757 INFO L168 Benchmark]: TraceAbstraction took 36047.82 ms. Allocated memory was 195.0 MB in the beginning and 350.2 MB in the end (delta: 155.2 MB). Free memory was 140.0 MB in the beginning and 315.0 MB in the end (delta: -175.0 MB). Peak memory consumption was 180.6 MB. Max. memory is 8.0 GB. [2020-11-09 17:12:35,762 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.20 ms. Allocated memory is still 160.4 MB. Free memory is still 135.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 832.30 ms. Allocated memory is still 160.4 MB. Free memory was 133.8 MB in the beginning and 136.9 MB in the end (delta: -3.1 MB). Peak memory consumption was 32.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 101.52 ms. Allocated memory is still 160.4 MB. Free memory was 136.9 MB in the beginning and 134.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 60.31 ms. Allocated memory is still 160.4 MB. Free memory was 134.3 MB in the beginning and 132.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2195.84 ms. Allocated memory was 160.4 MB in the beginning and 195.0 MB in the end (delta: 34.6 MB). Free memory was 132.2 MB in the beginning and 140.5 MB in the end (delta: -8.3 MB). Peak memory consumption was 106.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 36047.82 ms. Allocated memory was 195.0 MB in the beginning and 350.2 MB in the end (delta: 155.2 MB). Free memory was 140.0 MB in the beginning and 315.0 MB in the end (delta: -175.0 MB). Peak memory consumption was 180.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 566 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 36 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 32.2s, 87 PlacesBefore, 26 PlacesAfterwards, 83 TransitionsBefore, 19 TransitionsAfterwards, 1038 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 77 TotalNumberOfCompositions, 2421 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; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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] [L765] 2 y = 1 VAL [__unbuffered_cnt=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] [L734] 1 y = 2 VAL [__unbuffered_cnt=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=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=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=2] [L768] 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) [L768] 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) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 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 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 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 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L740] 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) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] 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) [L740] 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) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 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 [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 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 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L799] 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) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] 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) [L799] 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) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 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 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 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 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 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) [L810] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe029_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 35.8s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 32.2s, HoareTripleCheckerStatistics: 142 SDtfs, 102 SDslu, 144 SDs, 0 SdLazy, 194 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 5554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...