/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 16:54:49,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 16:54:49,908 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 16:54:49,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 16:54:49,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 16:54:49,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 16:54:49,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 16:54:49,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 16:54:49,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 16:54:49,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 16:54:49,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 16:54:49,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 16:54:49,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 16:54:49,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 16:54:49,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 16:54:49,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 16:54:50,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 16:54:50,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 16:54:50,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 16:54:50,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 16:54:50,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 16:54:50,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 16:54:50,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 16:54:50,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 16:54:50,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 16:54:50,024 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 16:54:50,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 16:54:50,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 16:54:50,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 16:54:50,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 16:54:50,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 16:54:50,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 16:54:50,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 16:54:50,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 16:54:50,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 16:54:50,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 16:54:50,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 16:54:50,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 16:54:50,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 16:54:50,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 16:54:50,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 16:54:50,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-11-09 16:54:50,089 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 16:54:50,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 16:54:50,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 16:54:50,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 16:54:50,095 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 16:54:50,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 16:54:50,095 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 16:54:50,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 16:54:50,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 16:54:50,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 16:54:50,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 16:54:50,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 16:54:50,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 16:54:50,098 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 16:54:50,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 16:54:50,098 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 16:54:50,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 16:54:50,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 16:54:50,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 16:54:50,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 16:54:50,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 16:54:50,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:54:50,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 16:54:50,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 16:54:50,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 16:54:50,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 16:54:50,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 16:54:50,101 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 16:54:50,101 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 16:54:50,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 16:54:50,102 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 16:54:50,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 16:54:50,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 16:54:50,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 16:54:50,554 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 16:54:50,555 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 16:54:50,556 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i [2020-11-09 16:54:50,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86148bcdb/0375211b5e2f41e096049e22d4a8749c/FLAG416714d78 [2020-11-09 16:54:51,386 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 16:54:51,390 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.oepc.i [2020-11-09 16:54:51,419 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86148bcdb/0375211b5e2f41e096049e22d4a8749c/FLAG416714d78 [2020-11-09 16:54:51,643 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86148bcdb/0375211b5e2f41e096049e22d4a8749c [2020-11-09 16:54:51,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 16:54:51,655 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 16:54:51,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 16:54:51,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 16:54:51,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 16:54:51,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:54:51" (1/1) ... [2020-11-09 16:54:51,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16761391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:51, skipping insertion in model container [2020-11-09 16:54:51,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:54:51" (1/1) ... [2020-11-09 16:54:51,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 16:54:51,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 16:54:52,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:54:52,361 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 16:54:52,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:54:52,580 INFO L208 MainTranslator]: Completed translation [2020-11-09 16:54:52,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:52 WrapperNode [2020-11-09 16:54:52,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 16:54:52,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 16:54:52,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 16:54:52,582 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 16:54:52,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:52" (1/1) ... [2020-11-09 16:54:52,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:52" (1/1) ... [2020-11-09 16:54:52,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 16:54:52,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 16:54:52,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 16:54:52,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 16:54:52,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:52" (1/1) ... [2020-11-09 16:54:52,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:52" (1/1) ... [2020-11-09 16:54:52,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:52" (1/1) ... [2020-11-09 16:54:52,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:52" (1/1) ... [2020-11-09 16:54:52,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:52" (1/1) ... [2020-11-09 16:54:52,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:52" (1/1) ... [2020-11-09 16:54:52,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:52" (1/1) ... [2020-11-09 16:54:52,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 16:54:52,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 16:54:52,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 16:54:52,715 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 16:54:52,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:52" (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 16:54:52,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 16:54:52,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 16:54:52,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 16:54:52,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 16:54:52,827 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 16:54:52,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 16:54:52,828 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 16:54:52,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 16:54:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 16:54:52,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 16:54:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-09 16:54:52,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-09 16:54:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 16:54:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 16:54:52,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 16:54:52,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 16:54:52,832 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 16:54:55,389 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 16:54:55,389 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 16:54:55,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:54:55 BoogieIcfgContainer [2020-11-09 16:54:55,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 16:54:55,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 16:54:55,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 16:54:55,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 16:54:55,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:54:51" (1/3) ... [2020-11-09 16:54:55,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e8f860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:54:55, skipping insertion in model container [2020-11-09 16:54:55,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:52" (2/3) ... [2020-11-09 16:54:55,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e8f860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:54:55, skipping insertion in model container [2020-11-09 16:54:55,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:54:55" (3/3) ... [2020-11-09 16:54:55,400 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.oepc.i [2020-11-09 16:54:55,417 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 16:54:55,417 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 16:54:55,421 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 16:54:55,422 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 16:54:55,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,462 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,463 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,463 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,464 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,464 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,466 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,466 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,466 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,466 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,471 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,471 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,472 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,472 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,472 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,473 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,474 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,475 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,482 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,483 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,484 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,485 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,489 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,489 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,494 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,495 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,497 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,498 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:54:55,500 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 16:54:55,513 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-09 16:54:55,536 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 16:54:55,536 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 16:54:55,536 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 16:54:55,537 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 16:54:55,537 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 16:54:55,537 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 16:54:55,537 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 16:54:55,537 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 16:54:55,550 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 16:54:55,551 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 116 transitions, 252 flow [2020-11-09 16:54:55,554 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 116 transitions, 252 flow [2020-11-09 16:54:55,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 116 transitions, 252 flow [2020-11-09 16:54:55,610 INFO L129 PetriNetUnfolder]: 3/112 cut-off events. [2020-11-09 16:54:55,610 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 16:54:55,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-11-09 16:54:55,619 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-11-09 16:54:56,968 WARN L194 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 16:54:57,100 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-09 16:54:57,649 WARN L194 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-11-09 16:54:57,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 16:54:57,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:54:58,147 WARN L194 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-11-09 16:54:58,381 WARN L194 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 16:54:58,501 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-11-09 16:54:58,635 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-11-09 16:55:01,513 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-09 16:55:01,722 WARN L194 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-09 16:55:03,214 WARN L194 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2020-11-09 16:55:03,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-09 16:55:03,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:03,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 16:55:03,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:04,480 WARN L194 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 148 DAG size of output: 110 [2020-11-09 16:55:06,884 WARN L194 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 315 DAG size of output: 270 [2020-11-09 16:55:06,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:55:06,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:06,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:55:06,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:06,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:55:06,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:06,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:55:06,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:06,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:55:06,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:06,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:55:06,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:06,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:55:06,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:06,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:55:06,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:06,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:55:06,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:06,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:55:06,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:06,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:55:06,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:06,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 1] term [2020-11-09 16:55:06,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:06,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:06,942 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-11-09 16:55:06,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:06,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:06,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 16:55:06,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:06,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:06,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:06,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 3, 2, 1] term [2020-11-09 16:55:06,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:06,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 2, 1] term [2020-11-09 16:55:06,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:06,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 3, 2, 1] term [2020-11-09 16:55:06,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 16:55:06,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 1] term [2020-11-09 16:55:06,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:06,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-09 16:55:06,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:07,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:55:07,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:07,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:55:07,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:07,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:55:07,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:10,405 WARN L194 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 379 DAG size of output: 232 [2020-11-09 16:55:11,778 WARN L194 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2020-11-09 16:55:11,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-09 16:55:11,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:11,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 16:55:11,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:13,195 WARN L194 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 148 DAG size of output: 109 [2020-11-09 16:55:16,013 WARN L194 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 315 DAG size of output: 271 [2020-11-09 16:55:16,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:55:16,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:16,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:55:16,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:16,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:16,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:16,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:16,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:16,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 16:55:16,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:16,057 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-11-09 16:55:16,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:16,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:55:16,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:16,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:55:16,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:16,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:55:16,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:16,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:55:16,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:16,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:55:16,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:16,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:55:16,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:16,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:55:16,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:16,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:55:16,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:16,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:55:16,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:16,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:55:16,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:16,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:55:16,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:16,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:55:16,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:16,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:55:16,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:19,754 WARN L194 SmtUtils]: Spent 3.64 s on a formula simplification. DAG size of input: 362 DAG size of output: 233 [2020-11-09 16:55:19,928 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 16:55:20,080 WARN L194 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 16:55:20,249 WARN L194 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 16:55:20,413 WARN L194 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 16:55:21,140 WARN L194 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-09 16:55:21,412 WARN L194 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-09 16:55:21,981 WARN L194 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-09 16:55:22,245 WARN L194 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-09 16:55:23,665 WARN L194 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 247 DAG size of output: 207 [2020-11-09 16:55:23,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-09 16:55:23,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:23,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 16:55:23,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:25,234 WARN L194 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 164 DAG size of output: 135 [2020-11-09 16:55:30,203 WARN L194 SmtUtils]: Spent 4.97 s on a formula simplification. DAG size of input: 331 DAG size of output: 287 [2020-11-09 16:55:30,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:55:30,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:30,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:55:30,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:30,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:55:30,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:30,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:55:30,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:30,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:55:30,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:30,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:55:30,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:30,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:55:30,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:30,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:55:30,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:30,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:55:30,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:30,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:55:30,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:30,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:55:30,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:30,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:30,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 16:55:30,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 16:55:30,258 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-11-09 16:55:30,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 16:55:30,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:30,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:30,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 2, 1] term [2020-11-09 16:55:30,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:30,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-09 16:55:30,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:30,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:30,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:30,285 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-11-09 16:55:30,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:30,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:55:30,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:30,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:55:30,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:55:30,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:55:30,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:30,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:55:30,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:55:39,482 WARN L194 SmtUtils]: Spent 9.17 s on a formula simplification. DAG size of input: 388 DAG size of output: 290 [2020-11-09 16:55:39,554 INFO L131 LiptonReduction]: Checked pairs total: 7247 [2020-11-09 16:55:39,554 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-11-09 16:55:39,561 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-11-09 16:55:39,752 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-11-09 16:55:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-11-09 16:55:39,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 16:55:39,765 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:39,766 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:39,767 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:39,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:39,775 INFO L82 PathProgramCache]: Analyzing trace with hash 477405012, now seen corresponding path program 1 times [2020-11-09 16:55:39,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:39,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879881248] [2020-11-09 16:55:39,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:55:40,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879881248] [2020-11-09 16:55:40,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:40,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:55:40,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1202077318] [2020-11-09 16:55:40,135 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:40,139 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:40,153 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 16:55:40,154 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:40,159 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:55:40,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:55:40,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:40,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:55:40,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:55:40,177 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-11-09 16:55:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:40,323 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-11-09 16:55:40,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:55:40,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 16:55:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:40,365 INFO L225 Difference]: With dead ends: 2202 [2020-11-09 16:55:40,365 INFO L226 Difference]: Without dead ends: 1802 [2020-11-09 16:55:40,367 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 16:55:40,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-11-09 16:55:40,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-11-09 16:55:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-11-09 16:55:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-11-09 16:55:40,593 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-11-09 16:55:40,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:40,594 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-11-09 16:55:40,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:55:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-11-09 16:55:40,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 16:55:40,597 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:40,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:40,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 16:55:40,598 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:40,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:40,599 INFO L82 PathProgramCache]: Analyzing trace with hash -775206985, now seen corresponding path program 1 times [2020-11-09 16:55:40,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:40,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209768500] [2020-11-09 16:55:40,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:40,801 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 16:55:40,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209768500] [2020-11-09 16:55:40,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:40,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:55:40,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [357971838] [2020-11-09 16:55:40,802 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:40,804 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:40,807 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-11-09 16:55:40,808 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:40,808 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:55:40,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:55:40,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:40,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:55:40,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:55:40,812 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-11-09 16:55:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:40,885 INFO L93 Difference]: Finished difference Result 1794 states and 6746 transitions. [2020-11-09 16:55:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:55:40,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-09 16:55:40,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:40,905 INFO L225 Difference]: With dead ends: 1794 [2020-11-09 16:55:40,905 INFO L226 Difference]: Without dead ends: 1794 [2020-11-09 16:55:40,906 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 16:55:40,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2020-11-09 16:55:40,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1794. [2020-11-09 16:55:40,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-11-09 16:55:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6746 transitions. [2020-11-09 16:55:40,992 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6746 transitions. Word has length 11 [2020-11-09 16:55:40,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:40,992 INFO L481 AbstractCegarLoop]: Abstraction has 1794 states and 6746 transitions. [2020-11-09 16:55:40,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:55:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6746 transitions. [2020-11-09 16:55:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 16:55:41,001 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:41,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:41,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 16:55:41,002 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:41,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:41,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1736968243, now seen corresponding path program 1 times [2020-11-09 16:55:41,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:41,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004212244] [2020-11-09 16:55:41,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:41,218 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 16:55:41,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004212244] [2020-11-09 16:55:41,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:41,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:55:41,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [482467206] [2020-11-09 16:55:41,220 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:41,222 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:41,225 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 14 transitions. [2020-11-09 16:55:41,225 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:41,257 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:55:41,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:55:41,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:41,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:55:41,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:55:41,259 INFO L87 Difference]: Start difference. First operand 1794 states and 6746 transitions. Second operand 4 states. [2020-11-09 16:55:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:41,386 INFO L93 Difference]: Finished difference Result 1762 states and 6602 transitions. [2020-11-09 16:55:41,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:55:41,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-09 16:55:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:41,405 INFO L225 Difference]: With dead ends: 1762 [2020-11-09 16:55:41,406 INFO L226 Difference]: Without dead ends: 1762 [2020-11-09 16:55:41,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 16:55:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2020-11-09 16:55:41,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1762. [2020-11-09 16:55:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2020-11-09 16:55:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 6602 transitions. [2020-11-09 16:55:41,492 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 6602 transitions. Word has length 12 [2020-11-09 16:55:41,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:41,492 INFO L481 AbstractCegarLoop]: Abstraction has 1762 states and 6602 transitions. [2020-11-09 16:55:41,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:55:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 6602 transitions. [2020-11-09 16:55:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 16:55:41,495 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:41,495 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:41,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 16:55:41,495 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:41,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:41,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1738386307, now seen corresponding path program 1 times [2020-11-09 16:55:41,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:41,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927629140] [2020-11-09 16:55:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:41,636 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 16:55:41,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927629140] [2020-11-09 16:55:41,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:41,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:55:41,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [679066667] [2020-11-09 16:55:41,637 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:41,639 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:41,641 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 20 transitions. [2020-11-09 16:55:41,642 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:41,748 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:55:41,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:55:41,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:41,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:55:41,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:55:41,751 INFO L87 Difference]: Start difference. First operand 1762 states and 6602 transitions. Second operand 3 states. [2020-11-09 16:55:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:41,813 INFO L93 Difference]: Finished difference Result 1754 states and 6564 transitions. [2020-11-09 16:55:41,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:55:41,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-09 16:55:41,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:41,833 INFO L225 Difference]: With dead ends: 1754 [2020-11-09 16:55:41,833 INFO L226 Difference]: Without dead ends: 1754 [2020-11-09 16:55:41,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:55:41,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2020-11-09 16:55:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1754. [2020-11-09 16:55:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2020-11-09 16:55:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 6564 transitions. [2020-11-09 16:55:41,912 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 6564 transitions. Word has length 12 [2020-11-09 16:55:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:41,913 INFO L481 AbstractCegarLoop]: Abstraction has 1754 states and 6564 transitions. [2020-11-09 16:55:41,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:55:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 6564 transitions. [2020-11-09 16:55:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 16:55:41,915 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:41,915 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:41,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 16:55:41,915 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:41,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:41,917 INFO L82 PathProgramCache]: Analyzing trace with hash -709915685, now seen corresponding path program 1 times [2020-11-09 16:55:41,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:41,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131842876] [2020-11-09 16:55:41,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:42,060 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 16:55:42,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131842876] [2020-11-09 16:55:42,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:42,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:55:42,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1037951548] [2020-11-09 16:55:42,062 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:42,063 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:42,068 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 37 transitions. [2020-11-09 16:55:42,068 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:42,246 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:55:42,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:55:42,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:42,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:55:42,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:55:42,248 INFO L87 Difference]: Start difference. First operand 1754 states and 6564 transitions. Second operand 4 states. [2020-11-09 16:55:42,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:42,344 INFO L93 Difference]: Finished difference Result 1938 states and 7170 transitions. [2020-11-09 16:55:42,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:55:42,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-09 16:55:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:42,364 INFO L225 Difference]: With dead ends: 1938 [2020-11-09 16:55:42,364 INFO L226 Difference]: Without dead ends: 1938 [2020-11-09 16:55:42,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:55:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2020-11-09 16:55:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1906. [2020-11-09 16:55:42,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1906 states. [2020-11-09 16:55:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 7074 transitions. [2020-11-09 16:55:42,447 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 7074 transitions. Word has length 13 [2020-11-09 16:55:42,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:42,448 INFO L481 AbstractCegarLoop]: Abstraction has 1906 states and 7074 transitions. [2020-11-09 16:55:42,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:55:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 7074 transitions. [2020-11-09 16:55:42,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 16:55:42,450 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:42,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:42,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 16:55:42,450 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:42,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:42,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1037055385, now seen corresponding path program 1 times [2020-11-09 16:55:42,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:42,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541990770] [2020-11-09 16:55:42,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:42,665 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 16:55:42,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541990770] [2020-11-09 16:55:42,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:42,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:55:42,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [282495308] [2020-11-09 16:55:42,666 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:42,669 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:42,675 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 47 transitions. [2020-11-09 16:55:42,675 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:42,681 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:55:42,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:42,682 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:42,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:42,852 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:55:42,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:42,854 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:42,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:42,931 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:55:42,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:42,932 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:42,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:43,073 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [32842#(and (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~z$w_buff1~0 0) (or (= ~z$w_buff1~0 0) (= (mod ~z$r_buff1_thd0~0 256) 0)))] [2020-11-09 16:55:43,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:55:43,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:43,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:55:43,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:55:43,075 INFO L87 Difference]: Start difference. First operand 1906 states and 7074 transitions. Second operand 5 states. [2020-11-09 16:55:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:43,144 INFO L93 Difference]: Finished difference Result 1892 states and 7012 transitions. [2020-11-09 16:55:43,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:55:43,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-09 16:55:43,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:43,165 INFO L225 Difference]: With dead ends: 1892 [2020-11-09 16:55:43,165 INFO L226 Difference]: Without dead ends: 1892 [2020-11-09 16:55:43,165 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:55:43,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2020-11-09 16:55:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1892. [2020-11-09 16:55:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1892 states. [2020-11-09 16:55:43,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 7012 transitions. [2020-11-09 16:55:43,248 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 7012 transitions. Word has length 13 [2020-11-09 16:55:43,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:43,249 INFO L481 AbstractCegarLoop]: Abstraction has 1892 states and 7012 transitions. [2020-11-09 16:55:43,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:55:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 7012 transitions. [2020-11-09 16:55:43,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 16:55:43,251 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:43,252 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:43,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 16:55:43,252 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:43,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:43,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1988560249, now seen corresponding path program 1 times [2020-11-09 16:55:43,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:43,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646184834] [2020-11-09 16:55:43,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:43,317 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 16:55:43,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646184834] [2020-11-09 16:55:43,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:43,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:55:43,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1843991852] [2020-11-09 16:55:43,319 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:43,322 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:43,325 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 28 transitions. [2020-11-09 16:55:43,326 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:43,437 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:55:43,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:55:43,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:43,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:55:43,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:55:43,467 INFO L87 Difference]: Start difference. First operand 1892 states and 7012 transitions. Second operand 3 states. [2020-11-09 16:55:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:43,501 INFO L93 Difference]: Finished difference Result 1860 states and 6868 transitions. [2020-11-09 16:55:43,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:55:43,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-11-09 16:55:43,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:43,543 INFO L225 Difference]: With dead ends: 1860 [2020-11-09 16:55:43,543 INFO L226 Difference]: Without dead ends: 1860 [2020-11-09 16:55:43,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 16:55:43,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2020-11-09 16:55:43,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1860. [2020-11-09 16:55:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2020-11-09 16:55:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 6868 transitions. [2020-11-09 16:55:43,632 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 6868 transitions. Word has length 13 [2020-11-09 16:55:43,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:43,633 INFO L481 AbstractCegarLoop]: Abstraction has 1860 states and 6868 transitions. [2020-11-09 16:55:43,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:55:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 6868 transitions. [2020-11-09 16:55:43,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 16:55:43,636 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:43,636 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:43,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 16:55:43,636 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:43,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:43,637 INFO L82 PathProgramCache]: Analyzing trace with hash -533968753, now seen corresponding path program 1 times [2020-11-09 16:55:43,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:43,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937770738] [2020-11-09 16:55:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:43,687 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 16:55:43,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937770738] [2020-11-09 16:55:43,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:43,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:55:43,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1966474766] [2020-11-09 16:55:43,688 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:43,691 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:43,696 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 50 transitions. [2020-11-09 16:55:43,696 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:43,719 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:55:43,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:55:43,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:43,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:55:43,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:55:43,720 INFO L87 Difference]: Start difference. First operand 1860 states and 6868 transitions. Second operand 3 states. [2020-11-09 16:55:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:43,756 INFO L93 Difference]: Finished difference Result 2364 states and 8474 transitions. [2020-11-09 16:55:43,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:55:43,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-11-09 16:55:43,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:43,768 INFO L225 Difference]: With dead ends: 2364 [2020-11-09 16:55:43,768 INFO L226 Difference]: Without dead ends: 1820 [2020-11-09 16:55:43,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 16:55:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2020-11-09 16:55:43,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1668. [2020-11-09 16:55:43,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2020-11-09 16:55:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 5924 transitions. [2020-11-09 16:55:43,842 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 5924 transitions. Word has length 14 [2020-11-09 16:55:43,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:43,842 INFO L481 AbstractCegarLoop]: Abstraction has 1668 states and 5924 transitions. [2020-11-09 16:55:43,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:55:43,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 5924 transitions. [2020-11-09 16:55:43,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 16:55:43,845 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:43,845 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:43,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 16:55:43,845 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:43,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:43,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2127906781, now seen corresponding path program 1 times [2020-11-09 16:55:43,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:43,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178169978] [2020-11-09 16:55:43,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:44,068 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 16:55:44,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178169978] [2020-11-09 16:55:44,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:44,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:55:44,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [797134456] [2020-11-09 16:55:44,070 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:44,072 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:44,078 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 67 transitions. [2020-11-09 16:55:44,078 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:44,096 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:55:44,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:44,097 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:44,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:44,150 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:55:44,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:44,151 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:44,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:44,206 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:55:44,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:44,207 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:44,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:44,466 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:55:44,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:55:44,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:44,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:55:44,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:55:44,468 INFO L87 Difference]: Start difference. First operand 1668 states and 5924 transitions. Second operand 5 states. [2020-11-09 16:55:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:44,582 INFO L93 Difference]: Finished difference Result 1640 states and 5800 transitions. [2020-11-09 16:55:44,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:55:44,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 16:55:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:44,592 INFO L225 Difference]: With dead ends: 1640 [2020-11-09 16:55:44,593 INFO L226 Difference]: Without dead ends: 1640 [2020-11-09 16:55:44,593 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:55:44,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2020-11-09 16:55:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2020-11-09 16:55:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1640 states. [2020-11-09 16:55:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 5800 transitions. [2020-11-09 16:55:44,682 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 5800 transitions. Word has length 14 [2020-11-09 16:55:44,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:44,682 INFO L481 AbstractCegarLoop]: Abstraction has 1640 states and 5800 transitions. [2020-11-09 16:55:44,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:55:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 5800 transitions. [2020-11-09 16:55:44,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 16:55:44,685 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:44,685 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:44,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 16:55:44,685 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2083948285, now seen corresponding path program 1 times [2020-11-09 16:55:44,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:44,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753978507] [2020-11-09 16:55:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:44,775 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 16:55:44,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753978507] [2020-11-09 16:55:44,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:44,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:55:44,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [836068692] [2020-11-09 16:55:44,776 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:44,778 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:44,782 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 50 transitions. [2020-11-09 16:55:44,782 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:44,987 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:55:44,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:55:44,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:44,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:55:44,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:55:44,988 INFO L87 Difference]: Start difference. First operand 1640 states and 5800 transitions. Second operand 4 states. [2020-11-09 16:55:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:45,069 INFO L93 Difference]: Finished difference Result 1656 states and 5852 transitions. [2020-11-09 16:55:45,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:55:45,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-09 16:55:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:45,080 INFO L225 Difference]: With dead ends: 1656 [2020-11-09 16:55:45,080 INFO L226 Difference]: Without dead ends: 1656 [2020-11-09 16:55:45,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:55:45,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2020-11-09 16:55:45,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2020-11-09 16:55:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2020-11-09 16:55:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 5852 transitions. [2020-11-09 16:55:45,142 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 5852 transitions. Word has length 14 [2020-11-09 16:55:45,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:45,142 INFO L481 AbstractCegarLoop]: Abstraction has 1656 states and 5852 transitions. [2020-11-09 16:55:45,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:55:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 5852 transitions. [2020-11-09 16:55:45,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 16:55:45,145 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:45,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:45,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 16:55:45,145 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:45,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:45,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2085272605, now seen corresponding path program 2 times [2020-11-09 16:55:45,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:45,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597603839] [2020-11-09 16:55:45,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:45,386 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 16:55:45,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597603839] [2020-11-09 16:55:45,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:45,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:55:45,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [753686917] [2020-11-09 16:55:45,387 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:45,389 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:45,393 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 60 transitions. [2020-11-09 16:55:45,393 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:45,419 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:55:45,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:45,420 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:45,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:45,562 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:55:45,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:55:45,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:45,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:55:45,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:55:45,563 INFO L87 Difference]: Start difference. First operand 1656 states and 5852 transitions. Second operand 5 states. [2020-11-09 16:55:45,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:45,712 INFO L93 Difference]: Finished difference Result 1614 states and 5680 transitions. [2020-11-09 16:55:45,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:55:45,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 16:55:45,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:45,723 INFO L225 Difference]: With dead ends: 1614 [2020-11-09 16:55:45,723 INFO L226 Difference]: Without dead ends: 1614 [2020-11-09 16:55:45,723 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:55:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2020-11-09 16:55:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1598. [2020-11-09 16:55:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2020-11-09 16:55:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 5628 transitions. [2020-11-09 16:55:45,783 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 5628 transitions. Word has length 14 [2020-11-09 16:55:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:45,784 INFO L481 AbstractCegarLoop]: Abstraction has 1598 states and 5628 transitions. [2020-11-09 16:55:45,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:55:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 5628 transitions. [2020-11-09 16:55:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 16:55:45,787 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:45,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:45,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 16:55:45,788 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:45,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:45,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1540603193, now seen corresponding path program 1 times [2020-11-09 16:55:45,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:45,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277208663] [2020-11-09 16:55:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:45,887 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 16:55:45,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277208663] [2020-11-09 16:55:45,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:45,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:55:45,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [206435938] [2020-11-09 16:55:45,888 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:45,890 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:45,917 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 70 transitions. [2020-11-09 16:55:45,918 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:45,932 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 16:55:45,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:45,962 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 16:55:45,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:45,998 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 16:55:45,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:46,242 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [64526#(and (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$w_buff0_used~0 0)) (or (= ~z$r_buff0_thd0~0 0) (not (= (mod ~z$w_buff0_used~0 256) 0))))] [2020-11-09 16:55:46,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:55:46,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:46,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:55:46,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:55:46,243 INFO L87 Difference]: Start difference. First operand 1598 states and 5628 transitions. Second operand 6 states. [2020-11-09 16:55:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:46,518 INFO L93 Difference]: Finished difference Result 1886 states and 6570 transitions. [2020-11-09 16:55:46,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 16:55:46,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-09 16:55:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:46,535 INFO L225 Difference]: With dead ends: 1886 [2020-11-09 16:55:46,535 INFO L226 Difference]: Without dead ends: 1886 [2020-11-09 16:55:46,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-11-09 16:55:46,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2020-11-09 16:55:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1858. [2020-11-09 16:55:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1858 states. [2020-11-09 16:55:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 6488 transitions. [2020-11-09 16:55:46,603 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 6488 transitions. Word has length 15 [2020-11-09 16:55:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:46,603 INFO L481 AbstractCegarLoop]: Abstraction has 1858 states and 6488 transitions. [2020-11-09 16:55:46,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:55:46,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 6488 transitions. [2020-11-09 16:55:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 16:55:46,608 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:46,608 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:46,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 16:55:46,608 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:46,609 INFO L82 PathProgramCache]: Analyzing trace with hash -591786302, now seen corresponding path program 1 times [2020-11-09 16:55:46,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:46,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903376886] [2020-11-09 16:55:46,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:46,722 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 16:55:46,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903376886] [2020-11-09 16:55:46,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:46,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:55:46,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2077522850] [2020-11-09 16:55:46,723 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:46,726 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:46,736 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 107 transitions. [2020-11-09 16:55:46,736 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:46,782 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:46,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:46,783 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:46,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:46,784 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:46,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:46,886 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:46,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:46,888 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:46,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:46,889 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:46,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:46,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:55:46,959 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:46,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:46,960 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:46,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:46,961 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:46,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:46,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:55:47,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:55:47,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:55:47,026 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:47,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,027 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:47,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,028 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:47,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,137 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:47,138 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,138 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:47,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,140 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:47,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:55:47,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:55:47,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:55:47,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:55:47,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:55:47,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:47,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,300 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:47,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,301 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:47,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:55:47,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:55:47,353 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:47,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,355 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:47,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,384 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:47,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:55:47,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:55:47,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:55:47,551 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [70141#(not (= 4 ~__unbuffered_cnt~0))] [2020-11-09 16:55:47,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:55:47,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:47,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:55:47,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:55:47,553 INFO L87 Difference]: Start difference. First operand 1858 states and 6488 transitions. Second operand 5 states. [2020-11-09 16:55:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:47,703 INFO L93 Difference]: Finished difference Result 1479 states and 4599 transitions. [2020-11-09 16:55:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:55:47,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-09 16:55:47,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:47,708 INFO L225 Difference]: With dead ends: 1479 [2020-11-09 16:55:47,709 INFO L226 Difference]: Without dead ends: 983 [2020-11-09 16:55:47,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:55:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2020-11-09 16:55:47,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 983. [2020-11-09 16:55:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2020-11-09 16:55:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 2791 transitions. [2020-11-09 16:55:47,737 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 2791 transitions. Word has length 16 [2020-11-09 16:55:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:47,737 INFO L481 AbstractCegarLoop]: Abstraction has 983 states and 2791 transitions. [2020-11-09 16:55:47,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:55:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 2791 transitions. [2020-11-09 16:55:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 16:55:47,740 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:47,741 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:47,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 16:55:47,741 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:47,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:47,741 INFO L82 PathProgramCache]: Analyzing trace with hash -232445824, now seen corresponding path program 1 times [2020-11-09 16:55:47,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:47,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877188118] [2020-11-09 16:55:47,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:47,794 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 16:55:47,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877188118] [2020-11-09 16:55:47,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:47,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:55:47,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1419107824] [2020-11-09 16:55:47,795 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:47,798 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:47,813 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 130 transitions. [2020-11-09 16:55:47,813 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:47,861 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:47,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,862 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:47,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,863 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:47,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,894 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:47,894 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,895 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:47,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,896 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:47,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,939 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:47,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,940 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:47,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:47,941 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:47,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:48,093 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:55:48,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:55:48,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:48,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:55:48,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:55:48,094 INFO L87 Difference]: Start difference. First operand 983 states and 2791 transitions. Second operand 3 states. [2020-11-09 16:55:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:48,115 INFO L93 Difference]: Finished difference Result 1389 states and 3798 transitions. [2020-11-09 16:55:48,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:55:48,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-11-09 16:55:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:48,121 INFO L225 Difference]: With dead ends: 1389 [2020-11-09 16:55:48,122 INFO L226 Difference]: Without dead ends: 993 [2020-11-09 16:55:48,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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 16:55:48,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2020-11-09 16:55:48,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 963. [2020-11-09 16:55:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2020-11-09 16:55:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2587 transitions. [2020-11-09 16:55:48,148 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2587 transitions. Word has length 19 [2020-11-09 16:55:48,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:48,149 INFO L481 AbstractCegarLoop]: Abstraction has 963 states and 2587 transitions. [2020-11-09 16:55:48,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:55:48,149 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2587 transitions. [2020-11-09 16:55:48,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 16:55:48,152 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:48,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:48,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 16:55:48,152 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:48,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:48,152 INFO L82 PathProgramCache]: Analyzing trace with hash 106051531, now seen corresponding path program 1 times [2020-11-09 16:55:48,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:48,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020609359] [2020-11-09 16:55:48,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:48,276 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 16:55:48,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020609359] [2020-11-09 16:55:48,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:48,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:55:48,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [711136562] [2020-11-09 16:55:48,277 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:48,280 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:48,295 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 102 transitions. [2020-11-09 16:55:48,295 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:48,312 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:48,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:48,314 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:48,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:48,315 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:48,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:48,393 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:48,393 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:48,394 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:48,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:48,395 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:48,395 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:48,498 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:48,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:48,499 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:48,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:48,500 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:48,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:48,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:55:48,650 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [76915#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 16:55:48,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 16:55:48,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:48,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 16:55:48,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:55:48,652 INFO L87 Difference]: Start difference. First operand 963 states and 2587 transitions. Second operand 7 states. [2020-11-09 16:55:48,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:48,779 INFO L93 Difference]: Finished difference Result 846 states and 2223 transitions. [2020-11-09 16:55:48,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:55:48,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-11-09 16:55:48,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:48,784 INFO L225 Difference]: With dead ends: 846 [2020-11-09 16:55:48,784 INFO L226 Difference]: Without dead ends: 678 [2020-11-09 16:55:48,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:55:48,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2020-11-09 16:55:48,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 618. [2020-11-09 16:55:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2020-11-09 16:55:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1602 transitions. [2020-11-09 16:55:48,804 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1602 transitions. Word has length 19 [2020-11-09 16:55:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:48,804 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 1602 transitions. [2020-11-09 16:55:48,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 16:55:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1602 transitions. [2020-11-09 16:55:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 16:55:48,807 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:48,807 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:48,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 16:55:48,807 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:48,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1372551299, now seen corresponding path program 1 times [2020-11-09 16:55:48,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:48,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984442218] [2020-11-09 16:55:48,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:48,888 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 16:55:48,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984442218] [2020-11-09 16:55:48,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:48,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:55:48,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [94383168] [2020-11-09 16:55:48,889 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:48,896 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:48,961 INFO L252 McrAutomatonBuilder]: Finished intersection with 179 states and 404 transitions. [2020-11-09 16:55:48,961 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:48,978 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:48,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:48,979 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:48,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:48,980 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:48,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,021 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:49,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,023 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:49,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,024 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:49,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,079 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:49,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,080 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:49,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,081 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:49,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,209 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:49,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,210 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:49,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,211 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:49,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,250 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:49,250 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,251 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:49,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,252 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:49,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,287 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:49,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,289 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:49,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,289 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:49,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,331 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:49,331 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,332 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:49,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,333 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:49,333 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,365 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:49,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,366 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:49,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,367 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:49,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:49,750 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:55:49,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:55:49,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:49,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:55:49,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:55:49,752 INFO L87 Difference]: Start difference. First operand 618 states and 1602 transitions. Second operand 4 states. [2020-11-09 16:55:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:49,786 INFO L93 Difference]: Finished difference Result 823 states and 2076 transitions. [2020-11-09 16:55:49,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:55:49,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-11-09 16:55:49,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:49,790 INFO L225 Difference]: With dead ends: 823 [2020-11-09 16:55:49,790 INFO L226 Difference]: Without dead ends: 445 [2020-11-09 16:55:49,791 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:55:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-11-09 16:55:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 442. [2020-11-09 16:55:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-11-09 16:55:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1029 transitions. [2020-11-09 16:55:49,803 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1029 transitions. Word has length 22 [2020-11-09 16:55:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:49,803 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1029 transitions. [2020-11-09 16:55:49,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:55:49,803 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1029 transitions. [2020-11-09 16:55:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 16:55:49,805 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:49,805 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:49,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 16:55:49,805 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:49,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:49,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1722088816, now seen corresponding path program 1 times [2020-11-09 16:55:49,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:49,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843885577] [2020-11-09 16:55:49,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:50,132 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 16:55:50,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843885577] [2020-11-09 16:55:50,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:50,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:55:50,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [216861648] [2020-11-09 16:55:50,135 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:50,139 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:50,196 INFO L252 McrAutomatonBuilder]: Finished intersection with 209 states and 484 transitions. [2020-11-09 16:55:50,196 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:50,204 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:55:50,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:50,206 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:50,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:50,206 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:50,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:50,209 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 16:55:50,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:50,209 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 16:55:50,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:50,432 WARN L194 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 16 [2020-11-09 16:55:50,577 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:50,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:50,579 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:50,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:50,580 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:50,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:50,582 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 16:55:50,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:50,583 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 16:55:50,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:51,337 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [80721#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$r_buff0_thd3~0 0) (not (= 2 ~z~0))), 80720#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (not (= 2 ~z~0))), 80723#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0)), 80722#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (= ~z$w_buff0~0 2)), 80719#(and (= ~z$w_buff1~0 0) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (= ~z$w_buff0~0 2))] [2020-11-09 16:55:51,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 16:55:51,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:51,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 16:55:51,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-09 16:55:51,339 INFO L87 Difference]: Start difference. First operand 442 states and 1029 transitions. Second operand 11 states. [2020-11-09 16:55:51,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:51,545 INFO L93 Difference]: Finished difference Result 563 states and 1280 transitions. [2020-11-09 16:55:51,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 16:55:51,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-11-09 16:55:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:51,549 INFO L225 Difference]: With dead ends: 563 [2020-11-09 16:55:51,549 INFO L226 Difference]: Without dead ends: 325 [2020-11-09 16:55:51,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-09 16:55:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-11-09 16:55:51,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 296. [2020-11-09 16:55:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-11-09 16:55:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 646 transitions. [2020-11-09 16:55:51,557 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 646 transitions. Word has length 22 [2020-11-09 16:55:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:51,558 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 646 transitions. [2020-11-09 16:55:51,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 16:55:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 646 transitions. [2020-11-09 16:55:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 16:55:51,559 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:51,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:51,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 16:55:51,559 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:51,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:51,560 INFO L82 PathProgramCache]: Analyzing trace with hash -2144444351, now seen corresponding path program 1 times [2020-11-09 16:55:51,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:51,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991714961] [2020-11-09 16:55:51,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:55:51,696 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 16:55:51,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991714961] [2020-11-09 16:55:51,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:55:51,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 16:55:51,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1497375893] [2020-11-09 16:55:51,697 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:55:51,701 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:55:51,723 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 126 transitions. [2020-11-09 16:55:51,723 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:55:51,728 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:51,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:51,729 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:55:51,730 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:51,730 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:55:51,730 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:55:51,907 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [81886#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 16:55:51,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 16:55:51,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:55:51,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 16:55:51,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:55:51,908 INFO L87 Difference]: Start difference. First operand 296 states and 646 transitions. Second operand 8 states. [2020-11-09 16:55:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:55:52,060 INFO L93 Difference]: Finished difference Result 276 states and 607 transitions. [2020-11-09 16:55:52,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 16:55:52,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-11-09 16:55:52,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:55:52,063 INFO L225 Difference]: With dead ends: 276 [2020-11-09 16:55:52,063 INFO L226 Difference]: Without dead ends: 63 [2020-11-09 16:55:52,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-09 16:55:52,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-09 16:55:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-11-09 16:55:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-09 16:55:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 121 transitions. [2020-11-09 16:55:52,066 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 121 transitions. Word has length 22 [2020-11-09 16:55:52,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:55:52,067 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 121 transitions. [2020-11-09 16:55:52,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 16:55:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 121 transitions. [2020-11-09 16:55:52,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-09 16:55:52,067 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:55:52,067 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:55:52,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-09 16:55:52,068 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:55:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:55:52,068 INFO L82 PathProgramCache]: Analyzing trace with hash 81887815, now seen corresponding path program 1 times [2020-11-09 16:55:52,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:55:52,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208093995] [2020-11-09 16:55:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:55:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:55:52,114 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:55:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:55:52,170 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:55:52,215 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 16:55:52,215 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 16:55:52,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-09 16:55:52,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:55:52 BasicIcfg [2020-11-09 16:55:52,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 16:55:52,349 INFO L168 Benchmark]: Toolchain (without parser) took 60698.84 ms. Allocated memory was 154.1 MB in the beginning and 323.0 MB in the end (delta: 168.8 MB). Free memory was 128.0 MB in the beginning and 174.8 MB in the end (delta: -46.7 MB). Peak memory consumption was 122.3 MB. Max. memory is 8.0 GB. [2020-11-09 16:55:52,349 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 125.8 MB. Free memory is still 85.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 16:55:52,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 921.25 ms. Allocated memory is still 154.1 MB. Free memory was 127.3 MB in the beginning and 93.0 MB in the end (delta: 34.4 MB). Peak memory consumption was 34.6 MB. Max. memory is 8.0 GB. [2020-11-09 16:55:52,350 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.85 ms. Allocated memory is still 154.1 MB. Free memory was 93.0 MB in the beginning and 90.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:55:52,351 INFO L168 Benchmark]: Boogie Preprocessor took 59.57 ms. Allocated memory is still 154.1 MB. Free memory was 90.1 MB in the beginning and 87.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:55:52,351 INFO L168 Benchmark]: RCFGBuilder took 2676.90 ms. Allocated memory is still 154.1 MB. Free memory was 87.7 MB in the beginning and 91.8 MB in the end (delta: -4.1 MB). Peak memory consumption was 47.4 MB. Max. memory is 8.0 GB. [2020-11-09 16:55:52,352 INFO L168 Benchmark]: TraceAbstraction took 56954.62 ms. Allocated memory was 154.1 MB in the beginning and 323.0 MB in the end (delta: 168.8 MB). Free memory was 91.3 MB in the beginning and 174.8 MB in the end (delta: -83.4 MB). Peak memory consumption was 85.4 MB. Max. memory is 8.0 GB. [2020-11-09 16:55:52,355 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.80 ms. Allocated memory is still 125.8 MB. Free memory is still 85.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 921.25 ms. Allocated memory is still 154.1 MB. Free memory was 127.3 MB in the beginning and 93.0 MB in the end (delta: 34.4 MB). Peak memory consumption was 34.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 69.85 ms. Allocated memory is still 154.1 MB. Free memory was 93.0 MB in the beginning and 90.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 59.57 ms. Allocated memory is still 154.1 MB. Free memory was 90.1 MB in the beginning and 87.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2676.90 ms. Allocated memory is still 154.1 MB. Free memory was 87.7 MB in the beginning and 91.8 MB in the end (delta: -4.1 MB). Peak memory consumption was 47.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 56954.62 ms. Allocated memory was 154.1 MB in the beginning and 323.0 MB in the end (delta: 168.8 MB). Free memory was 91.3 MB in the beginning and 174.8 MB in the end (delta: -83.4 MB). Peak memory consumption was 85.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1396 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 105 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 44.0s, 126 PlacesBefore, 44 PlacesAfterwards, 116 TransitionsBefore, 31 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, 7247 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1537; [L835] FCALL, FORK 0 pthread_create(&t1537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1538; [L837] FCALL, FORK 0 pthread_create(&t1538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1539; [L839] FCALL, FORK 0 pthread_create(&t1539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1540; [L841] FCALL, FORK 0 pthread_create(&t1540, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] 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) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] 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) [L847] 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) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 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 [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 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 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix057_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 56.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 44.2s, HoareTripleCheckerStatistics: 535 SDtfs, 544 SDslu, 744 SDs, 0 SdLazy, 342 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 473 GetRequests, 381 SyntacticMatches, 30 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 350 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 299 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 25764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...