/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/safe011_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 17:04:16,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 17:04:16,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 17:04:16,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 17:04:16,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 17:04:16,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 17:04:16,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 17:04:16,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 17:04:16,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 17:04:16,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 17:04:16,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 17:04:16,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 17:04:16,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 17:04:16,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 17:04:16,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 17:04:16,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 17:04:17,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 17:04:17,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 17:04:17,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 17:04:17,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 17:04:17,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 17:04:17,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 17:04:17,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 17:04:17,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 17:04:17,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 17:04:17,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 17:04:17,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 17:04:17,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 17:04:17,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 17:04:17,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 17:04:17,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 17:04:17,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 17:04:17,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 17:04:17,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 17:04:17,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 17:04:17,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 17:04:17,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 17:04:17,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 17:04:17,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 17:04:17,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 17:04:17,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 17:04:17,060 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:04:17,113 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 17:04:17,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 17:04:17,118 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 17:04:17,118 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 17:04:17,118 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 17:04:17,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 17:04:17,118 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 17:04:17,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 17:04:17,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 17:04:17,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 17:04:17,121 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 17:04:17,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 17:04:17,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 17:04:17,121 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 17:04:17,122 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 17:04:17,122 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 17:04:17,122 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 17:04:17,122 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 17:04:17,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 17:04:17,122 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 17:04:17,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 17:04:17,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 17:04:17,123 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 17:04:17,123 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 17:04:17,124 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 17:04:17,124 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 17:04:17,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 17:04:17,124 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 17:04:17,124 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 17:04:17,125 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 17:04:17,125 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:04:17,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 17:04:17,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 17:04:17,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 17:04:17,557 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 17:04:17,559 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 17:04:17,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2020-11-09 17:04:17,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63680671/634880bc91a54e2b9e445de347ae5d65/FLAG5a0ff7e2c [2020-11-09 17:04:18,438 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 17:04:18,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2020-11-09 17:04:18,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63680671/634880bc91a54e2b9e445de347ae5d65/FLAG5a0ff7e2c [2020-11-09 17:04:18,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63680671/634880bc91a54e2b9e445de347ae5d65 [2020-11-09 17:04:18,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 17:04:18,674 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 17:04:18,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 17:04:18,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 17:04:18,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 17:04:18,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:04:18" (1/1) ... [2020-11-09 17:04:18,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e97b856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:18, skipping insertion in model container [2020-11-09 17:04:18,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:04:18" (1/1) ... [2020-11-09 17:04:18,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 17:04:18,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 17:04:19,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 17:04:19,292 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 17:04:19,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 17:04:19,484 INFO L208 MainTranslator]: Completed translation [2020-11-09 17:04:19,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:19 WrapperNode [2020-11-09 17:04:19,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 17:04:19,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 17:04:19,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 17:04:19,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 17:04:19,495 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:04:19" (1/1) ... [2020-11-09 17:04:19,514 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:04:19" (1/1) ... [2020-11-09 17:04:19,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 17:04:19,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 17:04:19,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 17:04:19,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 17:04:19,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:19" (1/1) ... [2020-11-09 17:04:19,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:19" (1/1) ... [2020-11-09 17:04:19,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:19" (1/1) ... [2020-11-09 17:04:19,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:19" (1/1) ... [2020-11-09 17:04:19,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:19" (1/1) ... [2020-11-09 17:04:19,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:19" (1/1) ... [2020-11-09 17:04:19,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:19" (1/1) ... [2020-11-09 17:04:19,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 17:04:19,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 17:04:19,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 17:04:19,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 17:04:19,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:19" (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:04:19,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 17:04:19,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 17:04:19,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 17:04:19,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 17:04:19,700 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 17:04:19,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 17:04:19,700 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 17:04:19,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 17:04:19,700 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 17:04:19,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 17:04:19,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 17:04:19,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 17:04:19,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 17:04:19,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 17:04:19,703 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:04:22,124 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 17:04:22,124 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 17:04:22,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:04:22 BoogieIcfgContainer [2020-11-09 17:04:22,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 17:04:22,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 17:04:22,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 17:04:22,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 17:04:22,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:04:18" (1/3) ... [2020-11-09 17:04:22,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22860b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:04:22, skipping insertion in model container [2020-11-09 17:04:22,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:04:19" (2/3) ... [2020-11-09 17:04:22,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22860b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:04:22, skipping insertion in model container [2020-11-09 17:04:22,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:04:22" (3/3) ... [2020-11-09 17:04:22,135 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_pso.oepc.i [2020-11-09 17:04:22,152 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 17:04:22,152 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 17:04:22,156 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 17:04:22,157 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 17:04:22,193 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,194 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,194 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,194 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,194 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,195 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,195 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,195 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,195 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,196 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,196 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,197 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,198 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,203 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,203 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,204 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,204 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,209 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,209 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,209 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,209 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,217 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,218 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,218 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,222 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,223 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,226 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,226 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:04:22,229 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 17:04:22,241 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 17:04:22,263 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 17:04:22,263 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 17:04:22,263 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 17:04:22,263 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 17:04:22,264 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 17:04:22,264 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 17:04:22,264 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 17:04:22,264 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 17:04:22,276 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 17:04:22,277 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-11-09 17:04:22,280 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-11-09 17:04:22,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-11-09 17:04:22,329 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-11-09 17:04:22,330 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 17:04:22,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-11-09 17:04:22,338 INFO L116 LiptonReduction]: Number of co-enabled transitions 1870 [2020-11-09 17:04:23,020 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-09 17:04:23,133 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 17:04:23,282 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2020-11-09 17:04:25,102 WARN L194 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-11-09 17:04:25,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-11-09 17:04:25,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:04:25,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 17:04:25,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:04:26,487 WARN L194 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-11-09 17:04:28,890 WARN L194 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2020-11-09 17:04:28,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:04:28,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:04:28,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:04:28,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:04:28,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 17:04:28,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:04:28,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:04:28,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:04:28,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:04:28,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:04:28,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:04:28,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:04:28,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:04:28,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:04:28,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:04:28,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:04:28,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:04:28,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:04:28,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:04:28,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:04:28,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:04:28,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:04:28,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:04:28,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:04:28,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:04:28,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:04:28,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 17:04:28,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:04:28,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 17:04:28,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:04:28,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 17:04:28,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:04:28,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 17:04:28,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:04:28,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:04:28,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:04:32,750 WARN L194 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 357 DAG size of output: 265 [2020-11-09 17:04:33,794 WARN L194 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 17:04:33,930 WARN L194 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 17:04:34,535 WARN L194 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-11-09 17:04:34,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 17:04:34,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:04:34,966 WARN L194 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 17:04:36,316 WARN L194 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-11-09 17:04:36,527 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-11-09 17:04:37,372 WARN L194 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-11-09 17:04:37,690 WARN L194 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-11-09 17:04:40,720 WARN L194 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 254 DAG size of output: 234 [2020-11-09 17:04:41,718 WARN L194 SmtUtils]: Spent 988.00 ms on a formula simplification that was a NOOP. DAG size: 230 [2020-11-09 17:04:42,339 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-09 17:04:42,443 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-09 17:04:43,444 WARN L194 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-11-09 17:04:43,919 WARN L194 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-11-09 17:04:48,189 WARN L194 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 268 DAG size of output: 257 [2020-11-09 17:04:49,632 WARN L194 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 253 [2020-11-09 17:04:50,179 WARN L194 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-11-09 17:04:50,436 WARN L194 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 17:04:50,953 WARN L194 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-11-09 17:04:51,194 WARN L194 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 17:04:51,234 INFO L131 LiptonReduction]: Checked pairs total: 4956 [2020-11-09 17:04:51,234 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-11-09 17:04:51,241 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-11-09 17:04:51,293 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 824 states. [2020-11-09 17:04:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2020-11-09 17:04:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-09 17:04:51,301 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:04:51,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-09 17:04:51,302 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:04:51,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:04:51,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1092291, now seen corresponding path program 1 times [2020-11-09 17:04:51,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:04:51,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843138090] [2020-11-09 17:04:51,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:04:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:04:51,562 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:04:51,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843138090] [2020-11-09 17:04:51,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:04:51,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:04:51,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [363814101] [2020-11-09 17:04:51,566 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:04:51,568 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:04:51,580 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-11-09 17:04:51,580 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:04:51,585 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:04:51,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:04:51,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:04:51,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:04:51,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:04:51,606 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 3 states. [2020-11-09 17:04:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:04:51,738 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-11-09 17:04:51,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:04:51,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-09 17:04:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:04:51,764 INFO L225 Difference]: With dead ends: 687 [2020-11-09 17:04:51,764 INFO L226 Difference]: Without dead ends: 562 [2020-11-09 17:04:51,765 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:04:51,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-11-09 17:04:51,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-11-09 17:04:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-11-09 17:04:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-11-09 17:04:51,885 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2020-11-09 17:04:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:04:51,886 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-11-09 17:04:51,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:04:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-11-09 17:04:51,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 17:04:51,887 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:04:51,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:04:51,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 17:04:51,888 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:04:51,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:04:51,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1825720558, now seen corresponding path program 1 times [2020-11-09 17:04:51,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:04:51,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225344308] [2020-11-09 17:04:51,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:04:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:04:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:04:52,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225344308] [2020-11-09 17:04:52,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:04:52,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:04:52,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1665848994] [2020-11-09 17:04:52,108 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:04:52,110 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:04:52,112 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 17:04:52,112 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:04:52,112 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:04:52,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:04:52,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:04:52,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:04:52,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:04:52,115 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-11-09 17:04:52,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:04:52,159 INFO L93 Difference]: Finished difference Result 557 states and 1706 transitions. [2020-11-09 17:04:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:04:52,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 17:04:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:04:52,167 INFO L225 Difference]: With dead ends: 557 [2020-11-09 17:04:52,167 INFO L226 Difference]: Without dead ends: 557 [2020-11-09 17:04:52,168 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:04:52,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-11-09 17:04:52,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2020-11-09 17:04:52,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2020-11-09 17:04:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1706 transitions. [2020-11-09 17:04:52,196 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1706 transitions. Word has length 9 [2020-11-09 17:04:52,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:04:52,197 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 1706 transitions. [2020-11-09 17:04:52,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:04:52,197 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1706 transitions. [2020-11-09 17:04:52,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 17:04:52,199 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:04:52,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:04:52,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 17:04:52,200 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:04:52,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:04:52,200 INFO L82 PathProgramCache]: Analyzing trace with hash -128941837, now seen corresponding path program 1 times [2020-11-09 17:04:52,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:04:52,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770099336] [2020-11-09 17:04:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:04:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:04:52,275 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:04:52,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770099336] [2020-11-09 17:04:52,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:04:52,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:04:52,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [128818492] [2020-11-09 17:04:52,277 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:04:52,279 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:04:52,282 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 20 transitions. [2020-11-09 17:04:52,283 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:04:52,392 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:04:52,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:04:52,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:04:52,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:04:52,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:04:52,394 INFO L87 Difference]: Start difference. First operand 557 states and 1706 transitions. Second operand 3 states. [2020-11-09 17:04:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:04:52,411 INFO L93 Difference]: Finished difference Result 537 states and 1635 transitions. [2020-11-09 17:04:52,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:04:52,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 17:04:52,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:04:52,418 INFO L225 Difference]: With dead ends: 537 [2020-11-09 17:04:52,418 INFO L226 Difference]: Without dead ends: 537 [2020-11-09 17:04:52,418 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:04:52,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-11-09 17:04:52,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2020-11-09 17:04:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2020-11-09 17:04:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1635 transitions. [2020-11-09 17:04:52,441 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1635 transitions. Word has length 10 [2020-11-09 17:04:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:04:52,441 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 1635 transitions. [2020-11-09 17:04:52,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:04:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1635 transitions. [2020-11-09 17:04:52,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 17:04:52,443 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:04:52,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:04:52,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 17:04:52,459 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:04:52,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:04:52,460 INFO L82 PathProgramCache]: Analyzing trace with hash -762762965, now seen corresponding path program 1 times [2020-11-09 17:04:52,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:04:52,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627182806] [2020-11-09 17:04:52,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:04:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:04:52,598 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:04:52,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627182806] [2020-11-09 17:04:52,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:04:52,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:04:52,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1276305274] [2020-11-09 17:04:52,600 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:04:52,601 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:04:52,603 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 14 transitions. [2020-11-09 17:04:52,604 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:04:52,698 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:04:52,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:04:52,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:04:52,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:04:52,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:04:52,700 INFO L87 Difference]: Start difference. First operand 537 states and 1635 transitions. Second operand 3 states. [2020-11-09 17:04:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:04:52,754 INFO L93 Difference]: Finished difference Result 533 states and 1620 transitions. [2020-11-09 17:04:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:04:52,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 17:04:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:04:52,761 INFO L225 Difference]: With dead ends: 533 [2020-11-09 17:04:52,761 INFO L226 Difference]: Without dead ends: 533 [2020-11-09 17:04:52,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:04:52,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-11-09 17:04:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2020-11-09 17:04:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2020-11-09 17:04:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1620 transitions. [2020-11-09 17:04:52,781 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 1620 transitions. Word has length 10 [2020-11-09 17:04:52,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:04:52,781 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 1620 transitions. [2020-11-09 17:04:52,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:04:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1620 transitions. [2020-11-09 17:04:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 17:04:52,786 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:04:52,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:04:52,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 17:04:52,787 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:04:52,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:04:52,787 INFO L82 PathProgramCache]: Analyzing trace with hash 297769834, now seen corresponding path program 1 times [2020-11-09 17:04:52,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:04:52,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707279735] [2020-11-09 17:04:52,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:04:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:04:52,904 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:04:52,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707279735] [2020-11-09 17:04:52,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:04:52,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 17:04:52,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [660283484] [2020-11-09 17:04:52,907 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:04:52,909 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:04:52,913 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 30 transitions. [2020-11-09 17:04:52,913 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:04:53,078 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:04:53,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:04:53,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:04:53,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:04:53,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:04:53,079 INFO L87 Difference]: Start difference. First operand 533 states and 1620 transitions. Second operand 4 states. [2020-11-09 17:04:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:04:53,168 INFO L93 Difference]: Finished difference Result 517 states and 1564 transitions. [2020-11-09 17:04:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:04:53,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-09 17:04:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:04:53,174 INFO L225 Difference]: With dead ends: 517 [2020-11-09 17:04:53,174 INFO L226 Difference]: Without dead ends: 517 [2020-11-09 17:04:53,175 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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:04:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-11-09 17:04:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2020-11-09 17:04:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-11-09 17:04:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1564 transitions. [2020-11-09 17:04:53,194 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1564 transitions. Word has length 11 [2020-11-09 17:04:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:04:53,195 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1564 transitions. [2020-11-09 17:04:53,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:04:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1564 transitions. [2020-11-09 17:04:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 17:04:53,196 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:04:53,196 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:04:53,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 17:04:53,197 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:04:53,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:04:53,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2124151563, now seen corresponding path program 1 times [2020-11-09 17:04:53,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:04:53,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446805169] [2020-11-09 17:04:53,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:04:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:04:53,264 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:04:53,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446805169] [2020-11-09 17:04:53,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:04:53,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 17:04:53,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [636615614] [2020-11-09 17:04:53,266 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:04:53,268 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:04:53,271 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 31 transitions. [2020-11-09 17:04:53,272 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:04:53,421 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:04:53,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:04:53,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:04:53,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:04:53,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:04:53,422 INFO L87 Difference]: Start difference. First operand 517 states and 1564 transitions. Second operand 4 states. [2020-11-09 17:04:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:04:53,516 INFO L93 Difference]: Finished difference Result 549 states and 1660 transitions. [2020-11-09 17:04:53,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:04:53,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-09 17:04:53,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:04:53,522 INFO L225 Difference]: With dead ends: 549 [2020-11-09 17:04:53,523 INFO L226 Difference]: Without dead ends: 549 [2020-11-09 17:04:53,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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:04:53,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-11-09 17:04:53,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2020-11-09 17:04:53,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-11-09 17:04:53,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1660 transitions. [2020-11-09 17:04:53,543 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1660 transitions. Word has length 11 [2020-11-09 17:04:53,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:04:53,544 INFO L481 AbstractCegarLoop]: Abstraction has 549 states and 1660 transitions. [2020-11-09 17:04:53,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:04:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1660 transitions. [2020-11-09 17:04:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 17:04:53,545 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:04:53,545 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:04:53,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 17:04:53,545 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:04:53,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:04:53,546 INFO L82 PathProgramCache]: Analyzing trace with hash 640929964, now seen corresponding path program 1 times [2020-11-09 17:04:53,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:04:53,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703574022] [2020-11-09 17:04:53,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:04:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:04:53,649 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:04:53,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703574022] [2020-11-09 17:04:53,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:04:53,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:04:53,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [633009404] [2020-11-09 17:04:53,650 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:04:53,653 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:04:53,660 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 65 transitions. [2020-11-09 17:04:53,660 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:04:54,043 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11678#(and (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~z$w_buff0~0 2)))] [2020-11-09 17:04:54,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 17:04:54,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:04:54,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 17:04:54,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-09 17:04:54,045 INFO L87 Difference]: Start difference. First operand 549 states and 1660 transitions. Second operand 6 states. [2020-11-09 17:04:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:04:54,212 INFO L93 Difference]: Finished difference Result 677 states and 2012 transitions. [2020-11-09 17:04:54,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 17:04:54,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-11-09 17:04:54,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:04:54,217 INFO L225 Difference]: With dead ends: 677 [2020-11-09 17:04:54,217 INFO L226 Difference]: Without dead ends: 377 [2020-11-09 17:04:54,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-11-09 17:04:54,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-11-09 17:04:54,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-11-09 17:04:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-11-09 17:04:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1077 transitions. [2020-11-09 17:04:54,232 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1077 transitions. Word has length 12 [2020-11-09 17:04:54,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:04:54,232 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 1077 transitions. [2020-11-09 17:04:54,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 17:04:54,233 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1077 transitions. [2020-11-09 17:04:54,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 17:04:54,234 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:04:54,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:04:54,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 17:04:54,234 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:04:54,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:04:54,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1424343219, now seen corresponding path program 1 times [2020-11-09 17:04:54,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:04:54,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290141272] [2020-11-09 17:04:54,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:04:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:04:54,332 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:04:54,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290141272] [2020-11-09 17:04:54,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:04:54,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:04:54,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [443746035] [2020-11-09 17:04:54,333 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:04:54,335 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:04:54,339 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 32 transitions. [2020-11-09 17:04:54,339 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:04:54,344 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:04:54,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:54,345 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:04:54,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:54,391 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:04:54,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:54,392 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:04:54,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:54,441 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:04:54,441 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:54,442 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:04:54,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:54,499 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:04:54,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:04:54,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:04:54,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:04:54,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:04:54,500 INFO L87 Difference]: Start difference. First operand 377 states and 1077 transitions. Second operand 3 states. [2020-11-09 17:04:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:04:54,546 INFO L93 Difference]: Finished difference Result 365 states and 1036 transitions. [2020-11-09 17:04:54,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:04:54,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-09 17:04:54,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:04:54,550 INFO L225 Difference]: With dead ends: 365 [2020-11-09 17:04:54,550 INFO L226 Difference]: Without dead ends: 365 [2020-11-09 17:04:54,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 4 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:04:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2020-11-09 17:04:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2020-11-09 17:04:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2020-11-09 17:04:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1036 transitions. [2020-11-09 17:04:54,563 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 1036 transitions. Word has length 12 [2020-11-09 17:04:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:04:54,563 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 1036 transitions. [2020-11-09 17:04:54,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:04:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 1036 transitions. [2020-11-09 17:04:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 17:04:54,564 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:04:54,564 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:04:54,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 17:04:54,564 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:04:54,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:04:54,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1605853390, now seen corresponding path program 1 times [2020-11-09 17:04:54,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:04:54,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913147052] [2020-11-09 17:04:54,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:04:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:04:54,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:04:54,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913147052] [2020-11-09 17:04:54,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:04:54,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:04:54,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1439408656] [2020-11-09 17:04:54,870 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:04:54,872 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:04:54,879 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 70 transitions. [2020-11-09 17:04:54,879 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:04:54,884 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 17:04:54,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:54,885 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 17:04:54,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:54,886 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 2, 3, 2, 1] term [2020-11-09 17:04:54,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:55,058 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 17:04:55,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:55,059 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 17:04:55,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:55,060 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 2, 3, 2, 1] term [2020-11-09 17:04:55,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:55,140 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 17:04:55,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:55,141 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 17:04:55,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:55,142 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 2, 3, 2, 1] term [2020-11-09 17:04:55,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:55,524 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [14219#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= 2 ~z~0))) (or (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= (mod ~z$w_buff0_used~0 256) 0))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (<= 0 ~z$w_buff0_used~0)) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)))), 14220#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= 2 ~z~0))) (or (<= ~z$w_buff0_used~0 0) (not (= (mod ~z$w_buff0_used~0 256) 0))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (<= 0 ~z$w_buff0_used~0)) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))) (or (<= ~z$r_buff0_thd0~0 0) (not (= (mod ~z$w_buff0_used~0 256) 0))))] [2020-11-09 17:04:55,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 17:04:55,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:04:55,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 17:04:55,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:04:55,526 INFO L87 Difference]: Start difference. First operand 365 states and 1036 transitions. Second operand 7 states. [2020-11-09 17:04:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:04:55,780 INFO L93 Difference]: Finished difference Result 441 states and 1256 transitions. [2020-11-09 17:04:55,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:04:55,782 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-11-09 17:04:55,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:04:55,785 INFO L225 Difference]: With dead ends: 441 [2020-11-09 17:04:55,785 INFO L226 Difference]: Without dead ends: 441 [2020-11-09 17:04:55,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-09 17:04:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2020-11-09 17:04:55,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2020-11-09 17:04:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-11-09 17:04:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1256 transitions. [2020-11-09 17:04:55,802 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1256 transitions. Word has length 13 [2020-11-09 17:04:55,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:04:55,803 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 1256 transitions. [2020-11-09 17:04:55,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 17:04:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1256 transitions. [2020-11-09 17:04:55,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 17:04:55,804 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:04:55,804 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:04:55,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 17:04:55,804 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:04:55,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:04:55,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1758105819, now seen corresponding path program 1 times [2020-11-09 17:04:55,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:04:55,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78176783] [2020-11-09 17:04:55,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:04:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:04:56,310 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:04:56,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78176783] [2020-11-09 17:04:56,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:04:56,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 17:04:56,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1504781170] [2020-11-09 17:04:56,311 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:04:56,313 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:04:56,337 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 73 transitions. [2020-11-09 17:04:56,337 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:04:56,349 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 3, 2, 1] term [2020-11-09 17:04:56,349 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:56,350 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-11-09 17:04:56,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:56,354 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:04:56,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:56,355 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:04:56,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:56,356 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-11-09 17:04:56,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 17:04:56,522 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-11-09 17:04:56,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:56,523 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-11-09 17:04:56,523 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:56,524 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 3, 2, 3, 2, 1] term [2020-11-09 17:04:56,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:56,583 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-11-09 17:04:56,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:56,584 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-11-09 17:04:56,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:56,587 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 3, 2, 3, 2, 1] term [2020-11-09 17:04:56,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:56,654 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-11-09 17:04:56,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:56,656 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-11-09 17:04:56,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:56,657 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 3, 2, 3, 2, 1] term [2020-11-09 17:04:56,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:57,051 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2020-11-09 17:04:57,157 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [15554#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= 2 ~z~0))) (or (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= (mod ~z$w_buff0_used~0 256) 0))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))) (or (<= ~z$r_buff0_thd2~0 (* 256 (div ~z$r_buff0_thd2~0 256))) (not (= (mod ~z$w_buff0_used~0 256) 0))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= ~z$w_buff0~0 2)))), 15555#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= 2 ~z~0))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))) (or (<= ~z$r_buff0_thd0~0 0) (not (= (mod ~z$w_buff0_used~0 256) 0))) (or (<= ~z$r_buff0_thd2~0 (* 256 (div ~z$r_buff0_thd2~0 256))) (not (= (mod ~z$w_buff0_used~0 256) 0))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= ~z$w_buff0~0 2))))] [2020-11-09 17:04:57,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 17:04:57,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:04:57,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 17:04:57,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-11-09 17:04:57,159 INFO L87 Difference]: Start difference. First operand 441 states and 1256 transitions. Second operand 8 states. [2020-11-09 17:04:57,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:04:57,301 INFO L93 Difference]: Finished difference Result 487 states and 1368 transitions. [2020-11-09 17:04:57,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 17:04:57,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-11-09 17:04:57,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:04:57,307 INFO L225 Difference]: With dead ends: 487 [2020-11-09 17:04:57,307 INFO L226 Difference]: Without dead ends: 487 [2020-11-09 17:04:57,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-11-09 17:04:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2020-11-09 17:04:57,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 419. [2020-11-09 17:04:57,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-11-09 17:04:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1178 transitions. [2020-11-09 17:04:57,322 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 1178 transitions. Word has length 14 [2020-11-09 17:04:57,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:04:57,322 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 1178 transitions. [2020-11-09 17:04:57,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 17:04:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 1178 transitions. [2020-11-09 17:04:57,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 17:04:57,324 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:04:57,324 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:04:57,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 17:04:57,324 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:04:57,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:04:57,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1966267931, now seen corresponding path program 2 times [2020-11-09 17:04:57,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:04:57,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147285590] [2020-11-09 17:04:57,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:04:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:04:57,659 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-11-09 17:04:57,882 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:04:57,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147285590] [2020-11-09 17:04:57,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:04:57,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 17:04:57,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1420526664] [2020-11-09 17:04:57,883 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:04:57,886 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:04:57,892 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 42 transitions. [2020-11-09 17:04:57,893 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:04:57,903 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:04:57,904 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:57,905 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:04:57,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:57,906 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:04:57,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:57,909 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 17:04:57,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:57,910 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 17:04:57,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:58,244 WARN L194 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 31 [2020-11-09 17:04:58,559 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2020-11-09 17:04:58,611 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 17:04:58,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:58,612 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 17:04:58,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:58,613 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 2, 3, 2, 1] term [2020-11-09 17:04:58,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:58,949 WARN L194 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 35 [2020-11-09 17:04:58,966 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-11-09 17:04:58,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:58,967 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-11-09 17:04:58,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:58,968 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 3, 2, 3, 2, 1] term [2020-11-09 17:04:58,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:59,379 WARN L194 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 37 [2020-11-09 17:04:59,383 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-11-09 17:04:59,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:59,384 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-11-09 17:04:59,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:59,384 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 3, 2, 3, 2, 1] term [2020-11-09 17:04:59,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:04:59,447 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [16887#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= 2 ~z~0))) (or (= (mod ~z$w_buff0_used~0 256) 0) (not (= ~z$w_buff0~0 2)) (= (mod ~z$r_buff0_thd2~0 256) 0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff1~0 2)) (or (not (= 2 ~z~0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0))) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))), 16888#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= 2 ~z~0))) (or (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= (mod ~z$w_buff0_used~0 256) 0))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= ~z$w_buff0~0 2))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= (mod ~z$r_buff0_thd2~0 256) 0))), 16889#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= 2 ~z~0))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (<= 0 ~z$r_buff0_thd2~0)) (or (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= (mod ~z$w_buff0_used~0 256) 0))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= ~z$w_buff0~0 2))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= (mod ~z$r_buff0_thd2~0 256) 0))), 16890#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= 2 ~z~0))) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (or (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= ~z$w_buff1~0 2))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= ~z$w_buff0~0 2))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= (mod ~z$r_buff0_thd2~0 256) 0))), 16891#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= 2 ~z~0))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (<= 0 ~z$r_buff0_thd2~0)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (or (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= ~z$w_buff1~0 2))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= ~z$w_buff0~0 2))) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= (mod ~z$r_buff0_thd2~0 256) 0)))] [2020-11-09 17:04:59,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 17:04:59,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:04:59,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 17:04:59,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-09 17:04:59,449 INFO L87 Difference]: Start difference. First operand 419 states and 1178 transitions. Second operand 11 states. [2020-11-09 17:04:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:04:59,828 INFO L93 Difference]: Finished difference Result 435 states and 1214 transitions. [2020-11-09 17:04:59,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:04:59,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-11-09 17:04:59,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:04:59,836 INFO L225 Difference]: With dead ends: 435 [2020-11-09 17:04:59,836 INFO L226 Difference]: Without dead ends: 435 [2020-11-09 17:04:59,837 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-11-09 17:04:59,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2020-11-09 17:04:59,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 389. [2020-11-09 17:04:59,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-11-09 17:04:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1094 transitions. [2020-11-09 17:04:59,852 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1094 transitions. Word has length 14 [2020-11-09 17:04:59,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:04:59,852 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 1094 transitions. [2020-11-09 17:04:59,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 17:04:59,852 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1094 transitions. [2020-11-09 17:04:59,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 17:04:59,853 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:04:59,853 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:04:59,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 17:04:59,853 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:04:59,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:04:59,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1331906639, now seen corresponding path program 1 times [2020-11-09 17:04:59,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:04:59,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515706912] [2020-11-09 17:04:59,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:04:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:05:00,255 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:05:00,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515706912] [2020-11-09 17:05:00,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:05:00,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 17:05:00,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [771990824] [2020-11-09 17:05:00,256 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:05:00,258 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:05:00,265 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 72 transitions. [2020-11-09 17:05:00,265 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:05:00,760 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [18116#(and (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff0~0 2)) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)))] [2020-11-09 17:05:00,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 17:05:00,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:05:00,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 17:05:00,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-09 17:05:00,762 INFO L87 Difference]: Start difference. First operand 389 states and 1094 transitions. Second operand 8 states. [2020-11-09 17:05:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:05:01,180 INFO L93 Difference]: Finished difference Result 576 states and 1589 transitions. [2020-11-09 17:05:01,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 17:05:01,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-11-09 17:05:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:05:01,187 INFO L225 Difference]: With dead ends: 576 [2020-11-09 17:05:01,187 INFO L226 Difference]: Without dead ends: 536 [2020-11-09 17:05:01,188 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-11-09 17:05:01,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-11-09 17:05:01,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 415. [2020-11-09 17:05:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2020-11-09 17:05:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1157 transitions. [2020-11-09 17:05:01,205 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1157 transitions. Word has length 15 [2020-11-09 17:05:01,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:05:01,207 INFO L481 AbstractCegarLoop]: Abstraction has 415 states and 1157 transitions. [2020-11-09 17:05:01,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 17:05:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1157 transitions. [2020-11-09 17:05:01,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 17:05:01,208 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:05:01,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:05:01,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 17:05:01,209 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:05:01,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:05:01,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1331920527, now seen corresponding path program 1 times [2020-11-09 17:05:01,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:05:01,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324898186] [2020-11-09 17:05:01,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:05:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:05:01,271 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:05:01,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324898186] [2020-11-09 17:05:01,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:05:01,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:05:01,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [708097740] [2020-11-09 17:05:01,272 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:05:01,275 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:05:01,287 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 120 transitions. [2020-11-09 17:05:01,288 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:05:01,383 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:05:01,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:01,384 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:01,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:01,385 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:01,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:01,472 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:01,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:01,473 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:01,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:01,474 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:01,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:01,819 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:05:01,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 17:05:01,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:05:01,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 17:05:01,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:05:01,820 INFO L87 Difference]: Start difference. First operand 415 states and 1157 transitions. Second operand 5 states. [2020-11-09 17:05:01,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:05:01,929 INFO L93 Difference]: Finished difference Result 631 states and 1724 transitions. [2020-11-09 17:05:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 17:05:01,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-09 17:05:01,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:05:01,934 INFO L225 Difference]: With dead ends: 631 [2020-11-09 17:05:01,934 INFO L226 Difference]: Without dead ends: 341 [2020-11-09 17:05:01,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 17:05:01,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-11-09 17:05:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 329. [2020-11-09 17:05:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2020-11-09 17:05:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 840 transitions. [2020-11-09 17:05:01,948 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 840 transitions. Word has length 15 [2020-11-09 17:05:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:05:01,948 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 840 transitions. [2020-11-09 17:05:01,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 17:05:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 840 transitions. [2020-11-09 17:05:01,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 17:05:01,949 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:05:01,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:05:01,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 17:05:01,950 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:05:01,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:05:01,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1154086099, now seen corresponding path program 2 times [2020-11-09 17:05:01,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:05:01,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571274981] [2020-11-09 17:05:01,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:05:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:05:02,048 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:05:02,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571274981] [2020-11-09 17:05:02,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:05:02,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:05:02,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1515759122] [2020-11-09 17:05:02,049 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:05:02,052 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:05:02,064 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 113 transitions. [2020-11-09 17:05:02,065 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:05:02,097 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:05:02,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:02,099 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:02,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:02,100 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:02,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:02,176 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:05:02,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:02,179 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:02,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:02,180 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:02,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:02,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:05:02,257 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:05:02,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:05:02,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:05:02,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:05:02,485 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [20831#(not (= 3 ~__unbuffered_cnt~0))] [2020-11-09 17:05:02,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 17:05:02,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:05:02,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 17:05:02,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:05:02,487 INFO L87 Difference]: Start difference. First operand 329 states and 840 transitions. Second operand 5 states. [2020-11-09 17:05:02,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:05:02,572 INFO L93 Difference]: Finished difference Result 249 states and 558 transitions. [2020-11-09 17:05:02,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 17:05:02,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-09 17:05:02,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:05:02,574 INFO L225 Difference]: With dead ends: 249 [2020-11-09 17:05:02,574 INFO L226 Difference]: Without dead ends: 168 [2020-11-09 17:05:02,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:05:02,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-11-09 17:05:02,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2020-11-09 17:05:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-09 17:05:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 335 transitions. [2020-11-09 17:05:02,580 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 335 transitions. Word has length 15 [2020-11-09 17:05:02,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:05:02,580 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 335 transitions. [2020-11-09 17:05:02,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 17:05:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 335 transitions. [2020-11-09 17:05:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 17:05:02,581 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:05:02,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:05:02,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 17:05:02,582 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:05:02,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:05:02,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2038631197, now seen corresponding path program 1 times [2020-11-09 17:05:02,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:05:02,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029604674] [2020-11-09 17:05:02,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:05:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:05:02,977 WARN L194 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2020-11-09 17:05:03,165 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2020-11-09 17:05:03,306 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-11-09 17:05:03,449 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:05:03,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029604674] [2020-11-09 17:05:03,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:05:03,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 17:05:03,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [349165797] [2020-11-09 17:05:03,450 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:05:03,453 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:05:03,461 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 56 transitions. [2020-11-09 17:05:03,461 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:05:03,887 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [21429#(and (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= ~z$r_buff0_thd0~0 0) (<= ~z$r_buff0_thd2~0 (* 256 (div ~z$r_buff0_thd2~0 256))) (not (= ~z$w_buff0~0 2)) (<= 0 ~z$r_buff0_thd2~0) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (not (= 2 ~z~0))), 21430#(and (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= ~z$r_buff0_thd0~0 0) (<= ~z$r_buff0_thd2~0 (* 256 (div ~z$r_buff0_thd2~0 256))) (not (= ~z$w_buff0~0 2)) (<= 0 ~z$r_buff0_thd2~0) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)))] [2020-11-09 17:05:03,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 17:05:03,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:05:03,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 17:05:03,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-09 17:05:03,888 INFO L87 Difference]: Start difference. First operand 168 states and 335 transitions. Second operand 10 states. [2020-11-09 17:05:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:05:04,126 INFO L93 Difference]: Finished difference Result 191 states and 371 transitions. [2020-11-09 17:05:04,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 17:05:04,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-11-09 17:05:04,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:05:04,129 INFO L225 Difference]: With dead ends: 191 [2020-11-09 17:05:04,129 INFO L226 Difference]: Without dead ends: 135 [2020-11-09 17:05:04,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-09 17:05:04,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-09 17:05:04,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2020-11-09 17:05:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-09 17:05:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 249 transitions. [2020-11-09 17:05:04,136 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 249 transitions. Word has length 18 [2020-11-09 17:05:04,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:05:04,136 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 249 transitions. [2020-11-09 17:05:04,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 17:05:04,136 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 249 transitions. [2020-11-09 17:05:04,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 17:05:04,137 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:05:04,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:05:04,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 17:05:04,137 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:05:04,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:05:04,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1448239176, now seen corresponding path program 1 times [2020-11-09 17:05:04,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:05:04,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536846377] [2020-11-09 17:05:04,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:05:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:05:04,256 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:05:04,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536846377] [2020-11-09 17:05:04,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:05:04,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 17:05:04,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1732296302] [2020-11-09 17:05:04,258 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:05:04,262 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:05:04,279 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 150 transitions. [2020-11-09 17:05:04,279 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:05:04,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:05:04,345 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:05:04,346 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,347 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,347 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:04,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,402 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:05:04,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,403 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,404 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:04,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,449 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,450 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,452 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:04,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,489 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,490 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,491 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:04,491 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,531 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,532 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,532 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,533 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:04,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,580 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,581 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,582 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:04,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,621 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:05:04,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,622 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,623 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:04,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,656 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,657 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,658 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:04,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,685 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:05:04,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,686 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,687 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:04,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,726 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:05:04,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,727 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,728 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:04,728 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,757 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:05:04,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,759 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,760 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:04,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,809 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:05:04,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,810 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,811 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:04,811 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,850 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:05:04,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,877 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,880 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:04,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,932 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:05:04,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,933 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,934 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:04,934 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,962 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,963 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:04,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:04,964 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:04,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:05,003 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:05,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:05,004 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:05,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:05,006 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:05,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:05,047 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:05,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:05,048 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:05,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:05,049 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:05,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:05,130 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:05:05,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:05,131 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:05:05,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:05,132 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:05:05,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:05:05,170 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:05:05,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 17:05:05,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:05:05,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 17:05:05,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 17:05:05,171 INFO L87 Difference]: Start difference. First operand 124 states and 249 transitions. Second operand 6 states. [2020-11-09 17:05:05,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:05:05,244 INFO L93 Difference]: Finished difference Result 111 states and 222 transitions. [2020-11-09 17:05:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 17:05:05,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-09 17:05:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:05:05,250 INFO L225 Difference]: With dead ends: 111 [2020-11-09 17:05:05,250 INFO L226 Difference]: Without dead ends: 62 [2020-11-09 17:05:05,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:05:05,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-09 17:05:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-11-09 17:05:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-09 17:05:05,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2020-11-09 17:05:05,253 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 18 [2020-11-09 17:05:05,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:05:05,254 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2020-11-09 17:05:05,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 17:05:05,254 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2020-11-09 17:05:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 17:05:05,254 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:05:05,254 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:05:05,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 17:05:05,255 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:05:05,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:05:05,255 INFO L82 PathProgramCache]: Analyzing trace with hash 357676392, now seen corresponding path program 1 times [2020-11-09 17:05:05,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:05:05,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948175866] [2020-11-09 17:05:05,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:05:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 17:05:05,320 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 17:05:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 17:05:05,364 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 17:05:05,411 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 17:05:05,411 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 17:05:05,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 17:05:05,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:05:05 BasicIcfg [2020-11-09 17:05:05,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 17:05:05,545 INFO L168 Benchmark]: Toolchain (without parser) took 46875.43 ms. Allocated memory was 151.0 MB in the beginning and 308.3 MB in the end (delta: 157.3 MB). Free memory was 125.0 MB in the beginning and 178.4 MB in the end (delta: -53.4 MB). Peak memory consumption was 105.1 MB. Max. memory is 8.0 GB. [2020-11-09 17:05:05,545 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory is still 124.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 17:05:05,546 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.64 ms. Allocated memory is still 151.0 MB. Free memory was 124.2 MB in the beginning and 130.7 MB in the end (delta: -6.5 MB). Peak memory consumption was 37.4 MB. Max. memory is 8.0 GB. [2020-11-09 17:05:05,547 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.62 ms. Allocated memory is still 151.0 MB. Free memory was 130.7 MB in the beginning and 127.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 17:05:05,547 INFO L168 Benchmark]: Boogie Preprocessor took 56.66 ms. Allocated memory is still 151.0 MB. Free memory was 127.5 MB in the beginning and 125.5 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:05:05,548 INFO L168 Benchmark]: RCFGBuilder took 2506.94 ms. Allocated memory was 151.0 MB in the beginning and 191.9 MB in the end (delta: 40.9 MB). Free memory was 125.5 MB in the beginning and 109.3 MB in the end (delta: 16.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 8.0 GB. [2020-11-09 17:05:05,549 INFO L168 Benchmark]: TraceAbstraction took 43413.62 ms. Allocated memory was 191.9 MB in the beginning and 308.3 MB in the end (delta: 116.4 MB). Free memory was 108.8 MB in the beginning and 178.4 MB in the end (delta: -69.6 MB). Peak memory consumption was 46.8 MB. Max. memory is 8.0 GB. [2020-11-09 17:05:05,555 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.23 ms. Allocated memory is still 151.0 MB. Free memory is still 124.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 807.64 ms. Allocated memory is still 151.0 MB. Free memory was 124.2 MB in the beginning and 130.7 MB in the end (delta: -6.5 MB). Peak memory consumption was 37.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 64.62 ms. Allocated memory is still 151.0 MB. Free memory was 130.7 MB in the beginning and 127.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 56.66 ms. Allocated memory is still 151.0 MB. Free memory was 127.5 MB in the beginning and 125.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2506.94 ms. Allocated memory was 151.0 MB in the beginning and 191.9 MB in the end (delta: 40.9 MB). Free memory was 125.5 MB in the beginning and 109.3 MB in the end (delta: 16.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 43413.62 ms. Allocated memory was 191.9 MB in the beginning and 308.3 MB in the end (delta: 116.4 MB). Free memory was 108.8 MB in the beginning and 178.4 MB in the end (delta: -69.6 MB). Peak memory consumption was 46.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1029 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 82 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 28.9s, 108 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 26 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 4956 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2031; [L819] FCALL, FORK 0 pthread_create(&t2031, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2032; [L821] FCALL, FORK 0 pthread_create(&t2032, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2033; [L823] FCALL, FORK 0 pthread_create(&t2033, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L793] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe011_pso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 43.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 29.0s, HoareTripleCheckerStatistics: 316 SDtfs, 490 SDslu, 604 SDs, 0 SdLazy, 409 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 235 SyntacticMatches, 27 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred 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.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 258 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 45598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...