/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 15:35:55,207 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 15:35:55,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 15:35:55,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 15:35:55,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 15:35:55,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 15:35:55,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 15:35:55,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 15:35:55,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 15:35:55,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 15:35:55,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 15:35:55,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 15:35:55,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 15:35:55,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 15:35:55,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 15:35:55,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 15:35:55,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 15:35:55,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 15:35:55,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 15:35:55,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 15:35:55,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 15:35:55,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 15:35:55,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 15:35:55,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 15:35:55,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 15:35:55,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 15:35:55,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 15:35:55,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 15:35:55,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 15:35:55,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 15:35:55,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 15:35:55,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 15:35:55,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 15:35:55,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 15:35:55,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 15:35:55,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 15:35:55,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 15:35:55,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 15:35:55,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 15:35:55,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 15:35:55,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 15:35:55,333 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-11-09 15:35:55,360 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 15:35:55,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 15:35:55,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 15:35:55,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 15:35:55,362 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 15:35:55,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 15:35:55,363 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 15:35:55,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 15:35:55,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 15:35:55,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 15:35:55,364 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 15:35:55,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 15:35:55,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 15:35:55,364 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 15:35:55,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 15:35:55,365 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 15:35:55,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 15:35:55,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 15:35:55,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 15:35:55,365 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 15:35:55,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 15:35:55,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:35:55,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 15:35:55,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 15:35:55,366 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 15:35:55,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 15:35:55,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 15:35:55,367 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 15:35:55,367 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 15:35:55,367 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 15:35:55,368 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 15:35:55,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 15:35:55,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 15:35:55,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 15:35:55,819 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 15:35:55,820 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 15:35:55,822 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2020-11-09 15:35:55,918 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d373a5ff1/7a282f1ec84c485aaf7a7e746d45c00f/FLAGe0c68a35d [2020-11-09 15:35:56,743 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 15:35:56,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2020-11-09 15:35:56,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d373a5ff1/7a282f1ec84c485aaf7a7e746d45c00f/FLAGe0c68a35d [2020-11-09 15:35:57,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d373a5ff1/7a282f1ec84c485aaf7a7e746d45c00f [2020-11-09 15:35:57,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 15:35:57,025 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 15:35:57,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 15:35:57,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 15:35:57,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 15:35:57,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:35:57" (1/1) ... [2020-11-09 15:35:57,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c41e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:35:57, skipping insertion in model container [2020-11-09 15:35:57,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:35:57" (1/1) ... [2020-11-09 15:35:57,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 15:35:57,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 15:35:57,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:35:57,723 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 15:35:57,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:35:58,016 INFO L208 MainTranslator]: Completed translation [2020-11-09 15:35:58,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:35:58 WrapperNode [2020-11-09 15:35:58,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 15:35:58,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 15:35:58,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 15:35:58,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 15:35:58,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:35:58" (1/1) ... [2020-11-09 15:35:58,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:35:58" (1/1) ... [2020-11-09 15:35:58,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 15:35:58,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 15:35:58,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 15:35:58,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 15:35:58,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:35:58" (1/1) ... [2020-11-09 15:35:58,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:35:58" (1/1) ... [2020-11-09 15:35:58,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:35:58" (1/1) ... [2020-11-09 15:35:58,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:35:58" (1/1) ... [2020-11-09 15:35:58,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:35:58" (1/1) ... [2020-11-09 15:35:58,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:35:58" (1/1) ... [2020-11-09 15:35:58,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:35:58" (1/1) ... [2020-11-09 15:35:58,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 15:35:58,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 15:35:58,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 15:35:58,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 15:35:58,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:35:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:35:58,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 15:35:58,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 15:35:58,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 15:35:58,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 15:35:58,253 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 15:35:58,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 15:35:58,253 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 15:35:58,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 15:35:58,254 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 15:35:58,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 15:35:58,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 15:35:58,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 15:35:58,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 15:35:58,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 15:35:58,257 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 15:36:00,762 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 15:36:00,762 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 15:36:00,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:36:00 BoogieIcfgContainer [2020-11-09 15:36:00,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 15:36:00,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 15:36:00,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 15:36:00,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 15:36:00,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:35:57" (1/3) ... [2020-11-09 15:36:00,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32187ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:36:00, skipping insertion in model container [2020-11-09 15:36:00,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:35:58" (2/3) ... [2020-11-09 15:36:00,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32187ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:36:00, skipping insertion in model container [2020-11-09 15:36:00,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:36:00" (3/3) ... [2020-11-09 15:36:00,774 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i [2020-11-09 15:36:00,792 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 15:36:00,792 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 15:36:00,797 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 15:36:00,798 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 15:36:00,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,834 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,834 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,834 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,835 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,835 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,836 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,837 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,837 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,838 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,838 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,841 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,842 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,843 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,843 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,844 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,844 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,845 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,849 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,849 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,850 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,850 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,857 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,859 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,859 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,864 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,864 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,869 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,870 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:36:00,873 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 15:36:00,887 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 15:36:00,912 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 15:36:00,912 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 15:36:00,912 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 15:36:00,912 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 15:36:00,913 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 15:36:00,913 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 15:36:00,913 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 15:36:00,913 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 15:36:00,927 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 15:36:00,928 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-11-09 15:36:00,932 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-11-09 15:36:00,934 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-11-09 15:36:00,987 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-11-09 15:36:00,988 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 15:36:00,993 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 15:36:00,997 INFO L116 LiptonReduction]: Number of co-enabled transitions 1870 [2020-11-09 15:36:01,654 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-09 15:36:01,779 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 15:36:03,978 WARN L194 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-11-09 15:36:04,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-11-09 15:36:04,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:36:04,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 15:36:04,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:36:05,382 WARN L194 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-11-09 15:36:07,896 WARN L194 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2020-11-09 15:36:07,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:36:07,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:36:07,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:36:07,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:36:07,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:36:07,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:36:07,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:36:07,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:36:07,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:36:07,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:36:07,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:36:07,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:36:07,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:36:07,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:36:07,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:36:07,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:36:07,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:36:07,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:36:07,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:36:07,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:36:07,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:36:07,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:36:08,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:36:08,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:36:08,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:36:08,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:36:08,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:36:08,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:36:08,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:36:08,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:36:08,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:36:08,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:36:08,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:36:08,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:36:08,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:36:08,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:36:12,079 WARN L194 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 357 DAG size of output: 265 [2020-11-09 15:36:13,221 WARN L194 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 15:36:13,354 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 15:36:13,992 WARN L194 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-11-09 15:36:13,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 15:36:13,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:36:14,467 WARN L194 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 15:36:15,857 WARN L194 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-11-09 15:36:16,066 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-11-09 15:36:16,963 WARN L194 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-11-09 15:36:17,316 WARN L194 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-11-09 15:36:20,600 WARN L194 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 254 DAG size of output: 234 [2020-11-09 15:36:21,649 WARN L194 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 230 [2020-11-09 15:36:22,290 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-09 15:36:23,409 WARN L194 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-11-09 15:36:23,917 WARN L194 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-11-09 15:36:27,517 WARN L194 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 268 DAG size of output: 257 [2020-11-09 15:36:28,754 WARN L194 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 253 [2020-11-09 15:36:29,382 WARN L194 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-11-09 15:36:29,680 WARN L194 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 15:36:30,288 WARN L194 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-11-09 15:36:30,563 WARN L194 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 15:36:30,622 INFO L131 LiptonReduction]: Checked pairs total: 4956 [2020-11-09 15:36:30,622 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-11-09 15:36:30,629 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-11-09 15:36:30,683 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 824 states. [2020-11-09 15:36:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2020-11-09 15:36:30,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-09 15:36:30,691 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:36:30,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-09 15:36:30,692 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 15:36:30,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:36:30,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1092291, now seen corresponding path program 1 times [2020-11-09 15:36:30,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:36:30,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779710009] [2020-11-09 15:36:30,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:36:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:36:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:36:31,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779710009] [2020-11-09 15:36:31,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:36:31,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:36:31,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [864444328] [2020-11-09 15:36:31,007 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:36:31,009 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:36:31,020 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-11-09 15:36:31,020 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:36:31,024 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:36:31,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:36:31,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:36:31,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:36:31,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:36:31,042 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 3 states. [2020-11-09 15:36:31,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:36:31,167 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-11-09 15:36:31,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:36:31,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-09 15:36:31,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:36:31,192 INFO L225 Difference]: With dead ends: 687 [2020-11-09 15:36:31,192 INFO L226 Difference]: Without dead ends: 562 [2020-11-09 15:36:31,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:36:31,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-11-09 15:36:31,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-11-09 15:36:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-11-09 15:36:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-11-09 15:36:31,331 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2020-11-09 15:36:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:36:31,332 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-11-09 15:36:31,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:36:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-11-09 15:36:31,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 15:36:31,334 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:36:31,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:36:31,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 15:36:31,334 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 15:36:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:36:31,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1825720558, now seen corresponding path program 1 times [2020-11-09 15:36:31,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:36:31,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984512394] [2020-11-09 15:36:31,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:36:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:36:31,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:36:31,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984512394] [2020-11-09 15:36:31,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:36:31,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:36:31,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1067994930] [2020-11-09 15:36:31,578 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:36:31,591 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:36:31,593 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 15:36:31,593 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:36:31,594 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:36:31,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:36:31,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:36:31,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:36:31,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:36:31,596 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-11-09 15:36:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:36:31,641 INFO L93 Difference]: Finished difference Result 557 states and 1706 transitions. [2020-11-09 15:36:31,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:36:31,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 15:36:31,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:36:31,649 INFO L225 Difference]: With dead ends: 557 [2020-11-09 15:36:31,650 INFO L226 Difference]: Without dead ends: 557 [2020-11-09 15:36:31,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:36:31,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-11-09 15:36:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2020-11-09 15:36:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2020-11-09 15:36:31,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1706 transitions. [2020-11-09 15:36:31,675 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1706 transitions. Word has length 9 [2020-11-09 15:36:31,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:36:31,676 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 1706 transitions. [2020-11-09 15:36:31,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:36:31,676 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1706 transitions. [2020-11-09 15:36:31,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 15:36:31,677 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:36:31,678 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:36:31,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 15:36:31,678 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 15:36:31,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:36:31,679 INFO L82 PathProgramCache]: Analyzing trace with hash -128941837, now seen corresponding path program 1 times [2020-11-09 15:36:31,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:36:31,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491802992] [2020-11-09 15:36:31,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:36:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:36:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:36:31,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491802992] [2020-11-09 15:36:31,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:36:31,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:36:31,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1218850467] [2020-11-09 15:36:31,746 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:36:31,748 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:36:31,751 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 20 transitions. [2020-11-09 15:36:31,751 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:36:31,888 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:36:31,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:36:31,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:36:31,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:36:31,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:36:31,891 INFO L87 Difference]: Start difference. First operand 557 states and 1706 transitions. Second operand 3 states. [2020-11-09 15:36:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:36:31,908 INFO L93 Difference]: Finished difference Result 537 states and 1635 transitions. [2020-11-09 15:36:31,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:36:31,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 15:36:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:36:31,914 INFO L225 Difference]: With dead ends: 537 [2020-11-09 15:36:31,914 INFO L226 Difference]: Without dead ends: 537 [2020-11-09 15:36:31,914 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 15:36:31,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-11-09 15:36:31,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2020-11-09 15:36:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2020-11-09 15:36:31,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1635 transitions. [2020-11-09 15:36:31,933 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1635 transitions. Word has length 10 [2020-11-09 15:36:31,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:36:31,933 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 1635 transitions. [2020-11-09 15:36:31,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:36:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1635 transitions. [2020-11-09 15:36:31,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 15:36:31,937 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:36:31,938 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:36:31,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 15:36:31,939 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 15:36:31,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:36:31,940 INFO L82 PathProgramCache]: Analyzing trace with hash -762762965, now seen corresponding path program 1 times [2020-11-09 15:36:31,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:36:31,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995600021] [2020-11-09 15:36:31,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:36:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:36:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:36:32,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995600021] [2020-11-09 15:36:32,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:36:32,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:36:32,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1357781489] [2020-11-09 15:36:32,089 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:36:32,091 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:36:32,092 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 14 transitions. [2020-11-09 15:36:32,092 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:36:32,180 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:36:32,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:36:32,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:36:32,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:36:32,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:36:32,182 INFO L87 Difference]: Start difference. First operand 537 states and 1635 transitions. Second operand 3 states. [2020-11-09 15:36:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:36:32,236 INFO L93 Difference]: Finished difference Result 533 states and 1620 transitions. [2020-11-09 15:36:32,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:36:32,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 15:36:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:36:32,245 INFO L225 Difference]: With dead ends: 533 [2020-11-09 15:36:32,248 INFO L226 Difference]: Without dead ends: 533 [2020-11-09 15:36:32,249 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 15:36:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-11-09 15:36:32,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2020-11-09 15:36:32,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2020-11-09 15:36:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1620 transitions. [2020-11-09 15:36:32,288 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 1620 transitions. Word has length 10 [2020-11-09 15:36:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:36:32,289 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 1620 transitions. [2020-11-09 15:36:32,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:36:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1620 transitions. [2020-11-09 15:36:32,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 15:36:32,290 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:36:32,290 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:36:32,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 15:36:32,291 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 15:36:32,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:36:32,291 INFO L82 PathProgramCache]: Analyzing trace with hash 297769834, now seen corresponding path program 1 times [2020-11-09 15:36:32,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:36:32,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051458009] [2020-11-09 15:36:32,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:36:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:36:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:36:32,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051458009] [2020-11-09 15:36:32,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:36:32,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:36:32,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [56755421] [2020-11-09 15:36:32,374 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:36:32,376 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:36:32,383 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 30 transitions. [2020-11-09 15:36:32,383 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:36:32,583 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:36:32,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:36:32,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:36:32,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:36:32,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:36:32,585 INFO L87 Difference]: Start difference. First operand 533 states and 1620 transitions. Second operand 4 states. [2020-11-09 15:36:32,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:36:32,682 INFO L93 Difference]: Finished difference Result 517 states and 1564 transitions. [2020-11-09 15:36:32,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:36:32,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-09 15:36:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:36:32,690 INFO L225 Difference]: With dead ends: 517 [2020-11-09 15:36:32,690 INFO L226 Difference]: Without dead ends: 517 [2020-11-09 15:36:32,691 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 15:36:32,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-11-09 15:36:32,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2020-11-09 15:36:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-11-09 15:36:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1564 transitions. [2020-11-09 15:36:32,715 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1564 transitions. Word has length 11 [2020-11-09 15:36:32,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:36:32,716 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1564 transitions. [2020-11-09 15:36:32,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:36:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1564 transitions. [2020-11-09 15:36:32,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 15:36:32,722 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:36:32,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:36:32,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 15:36:32,722 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 15:36:32,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:36:32,723 INFO L82 PathProgramCache]: Analyzing trace with hash 2124151563, now seen corresponding path program 1 times [2020-11-09 15:36:32,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:36:32,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529615577] [2020-11-09 15:36:32,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:36:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:36:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:36:32,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529615577] [2020-11-09 15:36:32,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:36:32,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:36:32,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1567243250] [2020-11-09 15:36:32,849 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:36:32,852 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:36:32,855 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 31 transitions. [2020-11-09 15:36:32,855 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:36:33,014 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:36:33,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:36:33,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:36:33,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:36:33,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:36:33,016 INFO L87 Difference]: Start difference. First operand 517 states and 1564 transitions. Second operand 4 states. [2020-11-09 15:36:33,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:36:33,114 INFO L93 Difference]: Finished difference Result 549 states and 1660 transitions. [2020-11-09 15:36:33,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:36:33,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-09 15:36:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:36:33,121 INFO L225 Difference]: With dead ends: 549 [2020-11-09 15:36:33,121 INFO L226 Difference]: Without dead ends: 549 [2020-11-09 15:36:33,121 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 15:36:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2020-11-09 15:36:33,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2020-11-09 15:36:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-11-09 15:36:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1660 transitions. [2020-11-09 15:36:33,141 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1660 transitions. Word has length 11 [2020-11-09 15:36:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:36:33,141 INFO L481 AbstractCegarLoop]: Abstraction has 549 states and 1660 transitions. [2020-11-09 15:36:33,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:36:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1660 transitions. [2020-11-09 15:36:33,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 15:36:33,142 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:36:33,143 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:36:33,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 15:36:33,143 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 15:36:33,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:36:33,143 INFO L82 PathProgramCache]: Analyzing trace with hash 640929964, now seen corresponding path program 1 times [2020-11-09 15:36:33,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:36:33,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000152294] [2020-11-09 15:36:33,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:36:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:36:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:36:33,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000152294] [2020-11-09 15:36:33,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:36:33,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:36:33,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1410686456] [2020-11-09 15:36:33,218 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:36:33,220 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:36:33,227 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 65 transitions. [2020-11-09 15:36:33,227 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:36:33,590 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 15:36:33,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:36:33,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:36:33,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:36:33,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:36:33,591 INFO L87 Difference]: Start difference. First operand 549 states and 1660 transitions. Second operand 6 states. [2020-11-09 15:36:33,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:36:33,757 INFO L93 Difference]: Finished difference Result 677 states and 2012 transitions. [2020-11-09 15:36:33,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 15:36:33,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-11-09 15:36:33,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:36:33,762 INFO L225 Difference]: With dead ends: 677 [2020-11-09 15:36:33,762 INFO L226 Difference]: Without dead ends: 377 [2020-11-09 15:36:33,763 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 15:36:33,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-11-09 15:36:33,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-11-09 15:36:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-11-09 15:36:33,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1077 transitions. [2020-11-09 15:36:33,776 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1077 transitions. Word has length 12 [2020-11-09 15:36:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:36:33,776 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 1077 transitions. [2020-11-09 15:36:33,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:36:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1077 transitions. [2020-11-09 15:36:33,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 15:36:33,777 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:36:33,777 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:36:33,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 15:36:33,777 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 15:36:33,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:36:33,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1424343219, now seen corresponding path program 1 times [2020-11-09 15:36:33,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:36:33,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244992345] [2020-11-09 15:36:33,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:36:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:36:33,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:36:33,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244992345] [2020-11-09 15:36:33,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:36:33,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:36:33,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [287478916] [2020-11-09 15:36:33,868 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:36:33,870 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:36:33,890 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 32 transitions. [2020-11-09 15:36:33,890 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:36:33,899 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:36:33,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:33,900 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:36:33,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:33,948 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:36:33,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:33,950 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:36:33,950 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:34,002 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:36:34,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:34,003 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:36:34,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:34,056 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:36:34,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:36:34,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:36:34,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:36:34,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:36:34,058 INFO L87 Difference]: Start difference. First operand 377 states and 1077 transitions. Second operand 3 states. [2020-11-09 15:36:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:36:34,104 INFO L93 Difference]: Finished difference Result 365 states and 1036 transitions. [2020-11-09 15:36:34,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:36:34,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-09 15:36:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:36:34,109 INFO L225 Difference]: With dead ends: 365 [2020-11-09 15:36:34,109 INFO L226 Difference]: Without dead ends: 365 [2020-11-09 15:36:34,109 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 15:36:34,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2020-11-09 15:36:34,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2020-11-09 15:36:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2020-11-09 15:36:34,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1036 transitions. [2020-11-09 15:36:34,122 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 1036 transitions. Word has length 12 [2020-11-09 15:36:34,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:36:34,122 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 1036 transitions. [2020-11-09 15:36:34,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:36:34,122 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 1036 transitions. [2020-11-09 15:36:34,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 15:36:34,123 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:36:34,123 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:36:34,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 15:36:34,123 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 15:36:34,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:36:34,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1605853390, now seen corresponding path program 1 times [2020-11-09 15:36:34,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:36:34,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451694592] [2020-11-09 15:36:34,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:36:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:36:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:36:34,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451694592] [2020-11-09 15:36:34,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:36:34,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:36:34,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [593956728] [2020-11-09 15:36:34,448 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:36:34,450 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:36:34,458 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 70 transitions. [2020-11-09 15:36:34,458 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:36:34,464 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:36:34,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:34,464 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:36:34,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:34,466 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:36:34,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:34,622 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:36:34,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:34,623 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:36:34,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:34,624 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:36:34,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:34,688 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:36:34,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:34,689 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:36:34,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:34,690 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:36:34,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:35,114 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 15:36:35,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:36:35,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:36:35,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:36:35,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:36:35,115 INFO L87 Difference]: Start difference. First operand 365 states and 1036 transitions. Second operand 7 states. [2020-11-09 15:36:35,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:36:35,368 INFO L93 Difference]: Finished difference Result 441 states and 1256 transitions. [2020-11-09 15:36:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:36:35,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-11-09 15:36:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:36:35,373 INFO L225 Difference]: With dead ends: 441 [2020-11-09 15:36:35,374 INFO L226 Difference]: Without dead ends: 441 [2020-11-09 15:36:35,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-09 15:36:35,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2020-11-09 15:36:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2020-11-09 15:36:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-11-09 15:36:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1256 transitions. [2020-11-09 15:36:35,389 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1256 transitions. Word has length 13 [2020-11-09 15:36:35,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:36:35,389 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 1256 transitions. [2020-11-09 15:36:35,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:36:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1256 transitions. [2020-11-09 15:36:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 15:36:35,390 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:36:35,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:36:35,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 15:36:35,390 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 15:36:35,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:36:35,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1758105819, now seen corresponding path program 1 times [2020-11-09 15:36:35,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:36:35,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424117446] [2020-11-09 15:36:35,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:36:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:36:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:36:35,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424117446] [2020-11-09 15:36:35,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:36:35,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:36:35,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [677175826] [2020-11-09 15:36:35,877 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:36:35,879 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:36:35,887 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 73 transitions. [2020-11-09 15:36:35,887 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:36:35,899 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:35,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:35,900 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:35,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:35,901 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:35,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:35,903 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:36:35,903 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:35,903 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:36:35,903 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:36,126 WARN L194 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 24 [2020-11-09 15:36:36,130 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:36:36,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:36,131 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:36:36,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:36,204 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-11-09 15:36:36,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:36,204 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-11-09 15:36:36,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:36,304 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-11-09 15:36:36,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:36,305 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-11-09 15:36:36,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:36,742 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [15554#(and (or (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)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (not (= 2 ~z~0))), 15555#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff0~0 2)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (not (= 2 ~z~0)) (= (mod ~z$r_buff0_thd2~0 256) 0)), 15556#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (not (= ~z$w_buff0~0 2)) (<= 0 ~z$r_buff0_thd2~0) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (not (= 2 ~z~0)) (= (mod ~z$r_buff0_thd2~0 256) 0))] [2020-11-09 15:36:36,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 15:36:36,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:36:36,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 15:36:36,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-11-09 15:36:36,744 INFO L87 Difference]: Start difference. First operand 441 states and 1256 transitions. Second operand 9 states. [2020-11-09 15:36:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:36:36,932 INFO L93 Difference]: Finished difference Result 457 states and 1292 transitions. [2020-11-09 15:36:36,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:36:36,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-11-09 15:36:36,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:36:36,937 INFO L225 Difference]: With dead ends: 457 [2020-11-09 15:36:36,937 INFO L226 Difference]: Without dead ends: 457 [2020-11-09 15:36:36,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:36:36,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2020-11-09 15:36:36,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 389. [2020-11-09 15:36:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2020-11-09 15:36:36,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1094 transitions. [2020-11-09 15:36:36,951 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1094 transitions. Word has length 14 [2020-11-09 15:36:36,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:36:36,951 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 1094 transitions. [2020-11-09 15:36:36,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 15:36:36,951 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1094 transitions. [2020-11-09 15:36:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:36:36,952 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:36:36,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:36:36,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 15:36:36,953 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 15:36:36,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:36:36,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1331906639, now seen corresponding path program 1 times [2020-11-09 15:36:36,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:36:36,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841775359] [2020-11-09 15:36:36,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:36:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:36:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:36:37,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841775359] [2020-11-09 15:36:37,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:36:37,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:36:37,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [742294780] [2020-11-09 15:36:37,386 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:36:37,388 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:36:37,395 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 72 transitions. [2020-11-09 15:36:37,395 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:36:37,876 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [16801#(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 15:36:37,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 15:36:37,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:36:37,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 15:36:37,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:36:37,878 INFO L87 Difference]: Start difference. First operand 389 states and 1094 transitions. Second operand 8 states. [2020-11-09 15:36:38,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:36:38,077 INFO L93 Difference]: Finished difference Result 515 states and 1424 transitions. [2020-11-09 15:36:38,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:36:38,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-11-09 15:36:38,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:36:38,081 INFO L225 Difference]: With dead ends: 515 [2020-11-09 15:36:38,081 INFO L226 Difference]: Without dead ends: 479 [2020-11-09 15:36:38,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-09 15:36:38,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2020-11-09 15:36:38,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 437. [2020-11-09 15:36:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-11-09 15:36:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1231 transitions. [2020-11-09 15:36:38,096 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1231 transitions. Word has length 15 [2020-11-09 15:36:38,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:36:38,096 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 1231 transitions. [2020-11-09 15:36:38,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 15:36:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1231 transitions. [2020-11-09 15:36:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:36:38,097 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:36:38,097 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:36:38,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 15:36:38,098 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 15:36:38,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:36:38,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1331920527, now seen corresponding path program 1 times [2020-11-09 15:36:38,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:36:38,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959354574] [2020-11-09 15:36:38,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:36:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:36:38,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:36:38,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959354574] [2020-11-09 15:36:38,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:36:38,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:36:38,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1126142042] [2020-11-09 15:36:38,167 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:36:38,170 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:36:38,183 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 120 transitions. [2020-11-09 15:36:38,183 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:36:38,285 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:38,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:38,286 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:38,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:38,287 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:38,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:38,392 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:36:38,393 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:38,393 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:38,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:38,394 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:38,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:38,719 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:36:38,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:36:38,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:36:38,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:36:38,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:36:38,721 INFO L87 Difference]: Start difference. First operand 437 states and 1231 transitions. Second operand 5 states. [2020-11-09 15:36:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:36:38,805 INFO L93 Difference]: Finished difference Result 657 states and 1804 transitions. [2020-11-09 15:36:38,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:36:38,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-09 15:36:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:36:38,809 INFO L225 Difference]: With dead ends: 657 [2020-11-09 15:36:38,809 INFO L226 Difference]: Without dead ends: 380 [2020-11-09 15:36:38,810 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 15:36:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2020-11-09 15:36:38,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 364. [2020-11-09 15:36:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-11-09 15:36:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 929 transitions. [2020-11-09 15:36:38,822 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 929 transitions. Word has length 15 [2020-11-09 15:36:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:36:38,822 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 929 transitions. [2020-11-09 15:36:38,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:36:38,823 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 929 transitions. [2020-11-09 15:36:38,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:36:38,824 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:36:38,824 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:36:38,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 15:36:38,824 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 15:36:38,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:36:38,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1154086099, now seen corresponding path program 2 times [2020-11-09 15:36:38,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:36:38,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669545704] [2020-11-09 15:36:38,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:36:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:36:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:36:38,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669545704] [2020-11-09 15:36:38,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:36:38,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:36:38,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [599721811] [2020-11-09 15:36:38,895 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:36:38,897 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:36:38,910 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 113 transitions. [2020-11-09 15:36:38,910 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:36:38,914 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:36:38,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:38,916 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:38,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:38,916 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:38,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:38,983 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:38,984 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:38,984 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:38,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:38,985 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:38,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:39,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:36:39,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:36:39,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:36:39,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:36:39,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:36:39,249 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [19589#(not (= 3 ~__unbuffered_cnt~0))] [2020-11-09 15:36:39,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:36:39,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:36:39,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:36:39,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:36:39,250 INFO L87 Difference]: Start difference. First operand 364 states and 929 transitions. Second operand 5 states. [2020-11-09 15:36:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:36:39,333 INFO L93 Difference]: Finished difference Result 271 states and 609 transitions. [2020-11-09 15:36:39,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:36:39,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-09 15:36:39,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:36:39,336 INFO L225 Difference]: With dead ends: 271 [2020-11-09 15:36:39,336 INFO L226 Difference]: Without dead ends: 181 [2020-11-09 15:36:39,336 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 15:36:39,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-11-09 15:36:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2020-11-09 15:36:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-11-09 15:36:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 355 transitions. [2020-11-09 15:36:39,342 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 355 transitions. Word has length 15 [2020-11-09 15:36:39,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:36:39,342 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 355 transitions. [2020-11-09 15:36:39,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:36:39,342 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 355 transitions. [2020-11-09 15:36:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 15:36:39,343 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:36:39,343 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 15:36:39,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 15:36:39,344 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 15:36:39,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:36:39,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2038631197, now seen corresponding path program 1 times [2020-11-09 15:36:39,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:36:39,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383975783] [2020-11-09 15:36:39,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:36:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:36:39,752 WARN L194 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-11-09 15:36:39,939 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2020-11-09 15:36:40,103 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-11-09 15:36:40,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 15:36:40,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383975783] [2020-11-09 15:36:40,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:36:40,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 15:36:40,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [590252478] [2020-11-09 15:36:40,276 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:36:40,279 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:36:40,288 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 56 transitions. [2020-11-09 15:36:40,288 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:36:40,684 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [20229#(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 (+ (div ~z$r_buff0_thd3~0 256) 1)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (not (= 2 ~z~0))), 20230#(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 (+ (div ~z$r_buff0_thd3~0 256) 1)) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)))] [2020-11-09 15:36:40,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 15:36:40,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:36:40,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 15:36:40,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:36:40,686 INFO L87 Difference]: Start difference. First operand 178 states and 355 transitions. Second operand 10 states. [2020-11-09 15:36:40,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:36:40,951 INFO L93 Difference]: Finished difference Result 201 states and 391 transitions. [2020-11-09 15:36:40,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:36:40,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-11-09 15:36:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:36:40,954 INFO L225 Difference]: With dead ends: 201 [2020-11-09 15:36:40,955 INFO L226 Difference]: Without dead ends: 135 [2020-11-09 15:36:40,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-09 15:36:40,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-09 15:36:40,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2020-11-09 15:36:40,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-09 15:36:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 249 transitions. [2020-11-09 15:36:40,960 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 249 transitions. Word has length 18 [2020-11-09 15:36:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:36:40,960 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 249 transitions. [2020-11-09 15:36:40,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 15:36:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 249 transitions. [2020-11-09 15:36:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 15:36:40,961 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:36:40,961 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 15:36:40,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 15:36:40,962 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 15:36:40,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:36:40,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1448239176, now seen corresponding path program 1 times [2020-11-09 15:36:40,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:36:40,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650791458] [2020-11-09 15:36:40,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:36:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:36:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:36:41,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650791458] [2020-11-09 15:36:41,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:36:41,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:36:41,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1063191444] [2020-11-09 15:36:41,071 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:36:41,074 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:36:41,091 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 150 transitions. [2020-11-09 15:36:41,092 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:36:41,138 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:36:41,164 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,165 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,166 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,244 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,246 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,246 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,247 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,295 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:36:41,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,296 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,297 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,334 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,334 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,335 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,335 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,336 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,336 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,369 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,371 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,372 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,406 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,407 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,408 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,450 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,451 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,452 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,486 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,488 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,488 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,488 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,516 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,517 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,517 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,518 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,547 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,547 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,548 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,548 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,549 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,582 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,583 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,584 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,620 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,621 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,621 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,660 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,661 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,662 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,716 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:36:41,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,717 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,718 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,753 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:36:41,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,754 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,755 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,793 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:36:41,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,794 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,795 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,837 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:36:41,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,838 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,838 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,922 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,923 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:36:41,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,924 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:36:41,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:36:41,962 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:36:41,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:36:41,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:36:41,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:36:41,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:36:41,964 INFO L87 Difference]: Start difference. First operand 124 states and 249 transitions. Second operand 6 states. [2020-11-09 15:36:42,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:36:42,038 INFO L93 Difference]: Finished difference Result 111 states and 222 transitions. [2020-11-09 15:36:42,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:36:42,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-09 15:36:42,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:36:42,041 INFO L225 Difference]: With dead ends: 111 [2020-11-09 15:36:42,041 INFO L226 Difference]: Without dead ends: 62 [2020-11-09 15:36:42,041 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 15:36:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-09 15:36:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-11-09 15:36:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-09 15:36:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2020-11-09 15:36:42,044 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 18 [2020-11-09 15:36:42,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:36:42,044 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2020-11-09 15:36:42,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:36:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2020-11-09 15:36:42,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 15:36:42,045 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:36:42,045 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 15:36:42,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 15:36:42,045 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 15:36:42,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:36:42,046 INFO L82 PathProgramCache]: Analyzing trace with hash 357676392, now seen corresponding path program 1 times [2020-11-09 15:36:42,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:36:42,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229292888] [2020-11-09 15:36:42,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:36:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:36:42,121 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:36:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:36:42,173 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:36:42,241 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 15:36:42,244 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 15:36:42,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 15:36:42,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 03:36:42 BasicIcfg [2020-11-09 15:36:42,389 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 15:36:42,394 INFO L168 Benchmark]: Toolchain (without parser) took 45372.55 ms. Allocated memory was 154.1 MB in the beginning and 323.0 MB in the end (delta: 168.8 MB). Free memory was 129.0 MB in the beginning and 115.5 MB in the end (delta: 13.5 MB). Peak memory consumption was 182.9 MB. Max. memory is 8.0 GB. [2020-11-09 15:36:42,397 INFO L168 Benchmark]: CDTParser took 0.70 ms. Allocated memory is still 125.8 MB. Free memory was 93.3 MB in the beginning and 93.2 MB in the end (delta: 167.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:36:42,398 INFO L168 Benchmark]: CACSL2BoogieTranslator took 989.68 ms. Allocated memory is still 154.1 MB. Free memory was 128.3 MB in the beginning and 127.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 29.6 MB. Max. memory is 8.0 GB. [2020-11-09 15:36:42,399 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.82 ms. Allocated memory is still 154.1 MB. Free memory was 127.2 MB in the beginning and 124.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:36:42,399 INFO L168 Benchmark]: Boogie Preprocessor took 43.96 ms. Allocated memory is still 154.1 MB. Free memory was 124.2 MB in the beginning and 122.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:36:42,400 INFO L168 Benchmark]: RCFGBuilder took 2608.65 ms. Allocated memory was 154.1 MB in the beginning and 185.6 MB in the end (delta: 31.5 MB). Free memory was 122.1 MB in the beginning and 108.2 MB in the end (delta: 13.9 MB). Peak memory consumption was 76.6 MB. Max. memory is 8.0 GB. [2020-11-09 15:36:42,400 INFO L168 Benchmark]: TraceAbstraction took 41622.46 ms. Allocated memory was 185.6 MB in the beginning and 323.0 MB in the end (delta: 137.4 MB). Free memory was 107.7 MB in the beginning and 115.5 MB in the end (delta: -7.8 MB). Peak memory consumption was 129.0 MB. Max. memory is 8.0 GB. [2020-11-09 15:36:42,406 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.70 ms. Allocated memory is still 125.8 MB. Free memory was 93.3 MB in the beginning and 93.2 MB in the end (delta: 167.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 989.68 ms. Allocated memory is still 154.1 MB. Free memory was 128.3 MB in the beginning and 127.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 29.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 91.82 ms. Allocated memory is still 154.1 MB. Free memory was 127.2 MB in the beginning and 124.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.96 ms. Allocated memory is still 154.1 MB. Free memory was 124.2 MB in the beginning and 122.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2608.65 ms. Allocated memory was 154.1 MB in the beginning and 185.6 MB in the end (delta: 31.5 MB). Free memory was 122.1 MB in the beginning and 108.2 MB in the end (delta: 13.9 MB). Peak memory consumption was 76.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 41622.46 ms. Allocated memory was 185.6 MB in the beginning and 323.0 MB in the end (delta: 137.4 MB). Free memory was 107.7 MB in the beginning and 115.5 MB in the end (delta: -7.8 MB). Peak memory consumption was 129.0 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: 29.6s, 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 t2037; [L819] FCALL, FORK 0 pthread_create(&t2037, ((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 t2038; [L821] FCALL, FORK 0 pthread_create(&t2038, ((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 t2039; [L823] FCALL, FORK 0 pthread_create(&t2039, ((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_rmo.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: 41.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 29.7s, HoareTripleCheckerStatistics: 301 SDtfs, 403 SDslu, 539 SDs, 0 SdLazy, 362 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 217 SyntacticMatches, 35 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 3.3s 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, 15 MinimizatonAttempts, 140 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 39330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...