/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/rfi003_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 16:56:50,551 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 16:56:50,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 16:56:50,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 16:56:50,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 16:56:50,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 16:56:50,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 16:56:50,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 16:56:50,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 16:56:50,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 16:56:50,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 16:56:50,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 16:56:50,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 16:56:50,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 16:56:50,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 16:56:50,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 16:56:50,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 16:56:50,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 16:56:50,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 16:56:50,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 16:56:50,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 16:56:50,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 16:56:50,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 16:56:50,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 16:56:50,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 16:56:50,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 16:56:50,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 16:56:50,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 16:56:50,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 16:56:50,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 16:56:50,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 16:56:50,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 16:56:50,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 16:56:50,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 16:56:50,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 16:56:50,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 16:56:50,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 16:56:50,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 16:56:50,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 16:56:50,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 16:56:50,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 16:56:50,692 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:56:50,720 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 16:56:50,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 16:56:50,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 16:56:50,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 16:56:50,722 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 16:56:50,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 16:56:50,723 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 16:56:50,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 16:56:50,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 16:56:50,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 16:56:50,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 16:56:50,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 16:56:50,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 16:56:50,724 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 16:56:50,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 16:56:50,725 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 16:56:50,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 16:56:50,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 16:56:50,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 16:56:50,726 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 16:56:50,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 16:56:50,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:56:50,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 16:56:50,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 16:56:50,727 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 16:56:50,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 16:56:50,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 16:56:50,727 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 16:56:50,727 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 16:56:50,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 16:56:50,728 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:56:51,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 16:56:51,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 16:56:51,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 16:56:51,182 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 16:56:51,182 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 16:56:51,185 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.oepc.i [2020-11-09 16:56:51,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2f4e19e/62dacff018be4c45a5b1df2873c9b33a/FLAG8b9bd4ca1 [2020-11-09 16:56:52,097 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 16:56:52,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_tso.oepc.i [2020-11-09 16:56:52,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2f4e19e/62dacff018be4c45a5b1df2873c9b33a/FLAG8b9bd4ca1 [2020-11-09 16:56:52,290 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2f4e19e/62dacff018be4c45a5b1df2873c9b33a [2020-11-09 16:56:52,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 16:56:52,303 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 16:56:52,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 16:56:52,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 16:56:52,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 16:56:52,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:56:52" (1/1) ... [2020-11-09 16:56:52,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fb269c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:52, skipping insertion in model container [2020-11-09 16:56:52,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:56:52" (1/1) ... [2020-11-09 16:56:52,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 16:56:52,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 16:56:52,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:56:52,945 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 16:56:53,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:56:53,203 INFO L208 MainTranslator]: Completed translation [2020-11-09 16:56:53,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:53 WrapperNode [2020-11-09 16:56:53,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 16:56:53,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 16:56:53,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 16:56:53,206 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 16:56:53,216 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:56:53" (1/1) ... [2020-11-09 16:56:53,240 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:56:53" (1/1) ... [2020-11-09 16:56:53,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 16:56:53,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 16:56:53,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 16:56:53,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 16:56:53,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:53" (1/1) ... [2020-11-09 16:56:53,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:53" (1/1) ... [2020-11-09 16:56:53,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:53" (1/1) ... [2020-11-09 16:56:53,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:53" (1/1) ... [2020-11-09 16:56:53,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:53" (1/1) ... [2020-11-09 16:56:53,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:53" (1/1) ... [2020-11-09 16:56:53,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:53" (1/1) ... [2020-11-09 16:56:53,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 16:56:53,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 16:56:53,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 16:56:53,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 16:56:53,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:53" (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:56:53,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 16:56:53,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 16:56:53,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 16:56:53,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 16:56:53,458 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 16:56:53,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 16:56:53,459 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 16:56:53,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 16:56:53,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 16:56:53,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 16:56:53,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 16:56:53,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 16:56:53,462 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:56:57,915 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 16:56:57,916 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 16:56:57,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:56:57 BoogieIcfgContainer [2020-11-09 16:56:57,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 16:56:57,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 16:56:57,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 16:56:57,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 16:56:57,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:56:52" (1/3) ... [2020-11-09 16:56:57,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bea6dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:56:57, skipping insertion in model container [2020-11-09 16:56:57,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:53" (2/3) ... [2020-11-09 16:56:57,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bea6dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:56:57, skipping insertion in model container [2020-11-09 16:56:57,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:56:57" (3/3) ... [2020-11-09 16:56:57,937 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi003_tso.oepc.i [2020-11-09 16:56:57,959 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 16:56:57,960 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 16:56:57,965 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 16:56:57,966 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 16:56:58,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,039 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,039 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,040 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,040 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,056 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,056 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,056 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,057 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,057 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,058 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,059 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,060 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,078 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,086 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,132 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,145 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,155 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,158 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:58,160 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 16:56:58,175 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-09 16:56:58,202 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 16:56:58,202 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 16:56:58,202 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 16:56:58,202 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 16:56:58,202 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 16:56:58,202 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 16:56:58,202 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 16:56:58,203 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 16:56:58,216 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 16:56:58,217 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 89 transitions, 188 flow [2020-11-09 16:56:58,221 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 89 transitions, 188 flow [2020-11-09 16:56:58,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 93 places, 89 transitions, 188 flow [2020-11-09 16:56:58,274 INFO L129 PetriNetUnfolder]: 3/87 cut-off events. [2020-11-09 16:56:58,274 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 16:56:58,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 3/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2020-11-09 16:56:58,282 INFO L116 LiptonReduction]: Number of co-enabled transitions 1268 [2020-11-09 16:56:59,925 WARN L194 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 16:57:00,086 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 16:57:00,660 WARN L194 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-11-09 16:57:00,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 16:57:00,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:57:01,138 WARN L194 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 16:57:02,622 WARN L194 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-11-09 16:57:02,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-09 16:57:02,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:57:02,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 16:57:02,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:57:04,219 WARN L194 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-11-09 16:57:06,986 WARN L194 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-11-09 16:57:06,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:57:06,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:57:06,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:57:06,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:57:06,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:57:06,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:57:07,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:57:07,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:57:07,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:57:07,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:57:07,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:57:07,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:57:07,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:57:07,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:57:07,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:57:07,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:57:07,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:57:07,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:57:07,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:57:07,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:57:07,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:57:07,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:57:07,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:57:07,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:57:07,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:57:07,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:57:07,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:57:07,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:57:07,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:57:07,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:57:07,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:57:07,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:57:07,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:57:07,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 16:57:07,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:57:07,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:57:11,103 WARN L194 SmtUtils]: Spent 3.98 s on a formula simplification. DAG size of input: 361 DAG size of output: 268 [2020-11-09 16:57:14,125 WARN L194 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-11-09 16:57:14,344 WARN L194 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 16:57:14,826 WARN L194 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-11-09 16:57:15,081 WARN L194 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 16:57:15,087 INFO L131 LiptonReduction]: Checked pairs total: 4222 [2020-11-09 16:57:15,087 INFO L133 LiptonReduction]: Total number of compositions: 77 [2020-11-09 16:57:15,094 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 24 transitions, 58 flow [2020-11-09 16:57:15,120 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 302 states. [2020-11-09 16:57:15,122 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2020-11-09 16:57:15,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-09 16:57:15,128 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:57:15,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-09 16:57:15,130 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:57:15,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:57:15,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1084933451, now seen corresponding path program 1 times [2020-11-09 16:57:15,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:57:15,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234472888] [2020-11-09 16:57:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:57:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:57:15,397 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:57:15,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234472888] [2020-11-09 16:57:15,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:57:15,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:57:15,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [511924938] [2020-11-09 16:57:15,403 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:57:15,406 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:57:15,424 INFO L252 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2020-11-09 16:57:15,424 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:57:15,430 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:57:15,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:57:15,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:57:15,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:57:15,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:57:15,454 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2020-11-09 16:57:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:57:15,562 INFO L93 Difference]: Finished difference Result 266 states and 660 transitions. [2020-11-09 16:57:15,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:57:15,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-11-09 16:57:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:57:15,579 INFO L225 Difference]: With dead ends: 266 [2020-11-09 16:57:15,579 INFO L226 Difference]: Without dead ends: 224 [2020-11-09 16:57:15,581 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:57:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-11-09 16:57:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2020-11-09 16:57:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-11-09 16:57:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 547 transitions. [2020-11-09 16:57:15,646 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 547 transitions. Word has length 6 [2020-11-09 16:57:15,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:57:15,647 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 547 transitions. [2020-11-09 16:57:15,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:57:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 547 transitions. [2020-11-09 16:57:15,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-09 16:57:15,648 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:57:15,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:57:15,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 16:57:15,649 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:57:15,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:57:15,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1057422896, now seen corresponding path program 1 times [2020-11-09 16:57:15,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:57:15,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656960070] [2020-11-09 16:57:15,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:57:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:57:15,908 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:57:15,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656960070] [2020-11-09 16:57:15,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:57:15,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:57:15,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [536668790] [2020-11-09 16:57:15,909 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:57:15,910 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:57:15,912 INFO L252 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-11-09 16:57:15,913 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:57:15,913 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:57:15,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:57:15,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:57:15,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:57:15,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:57:15,916 INFO L87 Difference]: Start difference. First operand 224 states and 547 transitions. Second operand 5 states. [2020-11-09 16:57:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:57:16,149 INFO L93 Difference]: Finished difference Result 262 states and 608 transitions. [2020-11-09 16:57:16,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:57:16,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-11-09 16:57:16,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:57:16,153 INFO L225 Difference]: With dead ends: 262 [2020-11-09 16:57:16,154 INFO L226 Difference]: Without dead ends: 220 [2020-11-09 16:57:16,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:57:16,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-11-09 16:57:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2020-11-09 16:57:16,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-11-09 16:57:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 535 transitions. [2020-11-09 16:57:16,184 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 535 transitions. Word has length 8 [2020-11-09 16:57:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:57:16,184 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 535 transitions. [2020-11-09 16:57:16,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:57:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 535 transitions. [2020-11-09 16:57:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 16:57:16,186 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:57:16,186 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:57:16,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 16:57:16,186 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:57:16,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:57:16,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1605458144, now seen corresponding path program 1 times [2020-11-09 16:57:16,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:57:16,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562211729] [2020-11-09 16:57:16,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:57:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:57:16,408 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:57:16,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562211729] [2020-11-09 16:57:16,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:57:16,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:57:16,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [701374327] [2020-11-09 16:57:16,409 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:57:16,411 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:57:16,413 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 15 transitions. [2020-11-09 16:57:16,414 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:57:16,465 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:57:16,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:57:16,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:57:16,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:57:16,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:57:16,467 INFO L87 Difference]: Start difference. First operand 220 states and 535 transitions. Second operand 4 states. [2020-11-09 16:57:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:57:16,597 INFO L93 Difference]: Finished difference Result 235 states and 547 transitions. [2020-11-09 16:57:16,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:57:16,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-11-09 16:57:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:57:16,601 INFO L225 Difference]: With dead ends: 235 [2020-11-09 16:57:16,601 INFO L226 Difference]: Without dead ends: 200 [2020-11-09 16:57:16,601 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:57:16,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-11-09 16:57:16,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2020-11-09 16:57:16,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-11-09 16:57:16,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 479 transitions. [2020-11-09 16:57:16,617 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 479 transitions. Word has length 9 [2020-11-09 16:57:16,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:57:16,617 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 479 transitions. [2020-11-09 16:57:16,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:57:16,617 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 479 transitions. [2020-11-09 16:57:16,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 16:57:16,619 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:57:16,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:57:16,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 16:57:16,619 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:57:16,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:57:16,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1261574053, now seen corresponding path program 1 times [2020-11-09 16:57:16,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:57:16,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569970387] [2020-11-09 16:57:16,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:57:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:57:16,717 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:57:16,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569970387] [2020-11-09 16:57:16,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:57:16,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:57:16,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [411328715] [2020-11-09 16:57:16,719 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:57:16,721 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:57:16,723 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 14 transitions. [2020-11-09 16:57:16,723 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:57:16,733 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:57:16,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:16,747 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:57:16,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:57:16,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:57:16,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:57:16,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:57:16,749 INFO L87 Difference]: Start difference. First operand 200 states and 479 transitions. Second operand 4 states. [2020-11-09 16:57:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:57:16,795 INFO L93 Difference]: Finished difference Result 218 states and 500 transitions. [2020-11-09 16:57:16,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:57:16,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-09 16:57:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:57:16,798 INFO L225 Difference]: With dead ends: 218 [2020-11-09 16:57:16,798 INFO L226 Difference]: Without dead ends: 188 [2020-11-09 16:57:16,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:57:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-11-09 16:57:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2020-11-09 16:57:16,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-11-09 16:57:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 445 transitions. [2020-11-09 16:57:16,810 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 445 transitions. Word has length 10 [2020-11-09 16:57:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:57:16,810 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 445 transitions. [2020-11-09 16:57:16,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:57:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 445 transitions. [2020-11-09 16:57:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 16:57:16,812 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:57:16,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:57:16,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 16:57:16,812 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:57:16,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:57:16,813 INFO L82 PathProgramCache]: Analyzing trace with hash 404248881, now seen corresponding path program 1 times [2020-11-09 16:57:16,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:57:16,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884355130] [2020-11-09 16:57:16,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:57:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:57:17,002 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:57:17,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884355130] [2020-11-09 16:57:17,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:57:17,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:57:17,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [72640967] [2020-11-09 16:57:17,006 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:57:17,009 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:57:17,013 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 17 transitions. [2020-11-09 16:57:17,013 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:57:17,078 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:57:17,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,079 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,080 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,081 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,083 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,085 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,087 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,089 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,090 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:57:17,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,092 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,094 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,192 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:57:17,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,200 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:57:17,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:57:17,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:57:17,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:57:17,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:57:17,202 INFO L87 Difference]: Start difference. First operand 188 states and 445 transitions. Second operand 5 states. [2020-11-09 16:57:17,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:57:17,274 INFO L93 Difference]: Finished difference Result 200 states and 455 transitions. [2020-11-09 16:57:17,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:57:17,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-11-09 16:57:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:57:17,280 INFO L225 Difference]: With dead ends: 200 [2020-11-09 16:57:17,280 INFO L226 Difference]: Without dead ends: 176 [2020-11-09 16:57:17,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:57:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-11-09 16:57:17,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-11-09 16:57:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-11-09 16:57:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 411 transitions. [2020-11-09 16:57:17,289 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 411 transitions. Word has length 11 [2020-11-09 16:57:17,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:57:17,290 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 411 transitions. [2020-11-09 16:57:17,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:57:17,290 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 411 transitions. [2020-11-09 16:57:17,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 16:57:17,299 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:57:17,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:57:17,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 16:57:17,300 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:57:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:57:17,301 INFO L82 PathProgramCache]: Analyzing trace with hash -402104154, now seen corresponding path program 1 times [2020-11-09 16:57:17,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:57:17,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639807676] [2020-11-09 16:57:17,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:57:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:57:17,583 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:57:17,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639807676] [2020-11-09 16:57:17,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:57:17,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:57:17,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [554256491] [2020-11-09 16:57:17,585 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:57:17,589 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:57:17,631 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 20 transitions. [2020-11-09 16:57:17,632 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:57:17,644 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 1] term [2020-11-09 16:57:17,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,645 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 5, 3, 3, 2, 1] term [2020-11-09 16:57:17,646 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,646 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 1] term [2020-11-09 16:57:17,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,672 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:57:17,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,673 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,675 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,676 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,677 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,679 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,681 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:57:17,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,682 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,683 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,752 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:57:17,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,754 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,755 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,756 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,757 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,758 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,760 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:57:17,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,761 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,762 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:17,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,769 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 1] term [2020-11-09 16:57:17,770 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,772 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 5, 3, 3, 2, 1] term [2020-11-09 16:57:17,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,773 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 1] term [2020-11-09 16:57:17,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,872 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:57:17,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:17,881 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:57:17,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 16:57:17,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:57:17,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 16:57:17,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:57:17,884 INFO L87 Difference]: Start difference. First operand 176 states and 411 transitions. Second operand 7 states. [2020-11-09 16:57:18,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:57:18,061 INFO L93 Difference]: Finished difference Result 192 states and 433 transitions. [2020-11-09 16:57:18,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:57:18,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-11-09 16:57:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:57:18,064 INFO L225 Difference]: With dead ends: 192 [2020-11-09 16:57:18,064 INFO L226 Difference]: Without dead ends: 174 [2020-11-09 16:57:18,065 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:57:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-11-09 16:57:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2020-11-09 16:57:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-11-09 16:57:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 405 transitions. [2020-11-09 16:57:18,071 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 405 transitions. Word has length 12 [2020-11-09 16:57:18,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:57:18,072 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 405 transitions. [2020-11-09 16:57:18,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 16:57:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 405 transitions. [2020-11-09 16:57:18,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 16:57:18,073 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:57:18,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:57:18,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 16:57:18,074 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:57:18,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:57:18,074 INFO L82 PathProgramCache]: Analyzing trace with hash -734138506, now seen corresponding path program 1 times [2020-11-09 16:57:18,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:57:18,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5563511] [2020-11-09 16:57:18,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:57:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:57:18,191 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:57:18,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5563511] [2020-11-09 16:57:18,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:57:18,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:57:18,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [534477226] [2020-11-09 16:57:18,192 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:57:18,197 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:57:18,204 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 37 transitions. [2020-11-09 16:57:18,204 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:57:18,231 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:57:18,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,233 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:18,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,233 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:57:18,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,235 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:18,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,236 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:18,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,237 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:18,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,238 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:57:18,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,239 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:18,239 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,240 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:18,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,294 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:57:18,294 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,295 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:18,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,296 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:57:18,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,297 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:18,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:18,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,299 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:18,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,300 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:57:18,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,302 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:18,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,303 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:18,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,365 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:57:18,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:57:18,401 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 16:57:18,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:18,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:57:18,430 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:57:18,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:57:18,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:57:18,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:57:18,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:57:18,431 INFO L87 Difference]: Start difference. First operand 174 states and 405 transitions. Second operand 4 states. [2020-11-09 16:57:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:57:18,465 INFO L93 Difference]: Finished difference Result 138 states and 272 transitions. [2020-11-09 16:57:18,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:57:18,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-09 16:57:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:57:18,467 INFO L225 Difference]: With dead ends: 138 [2020-11-09 16:57:18,467 INFO L226 Difference]: Without dead ends: 96 [2020-11-09 16:57:18,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 2 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:57:18,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-11-09 16:57:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2020-11-09 16:57:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-11-09 16:57:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 171 transitions. [2020-11-09 16:57:18,471 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 171 transitions. Word has length 13 [2020-11-09 16:57:18,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:57:18,471 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 171 transitions. [2020-11-09 16:57:18,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:57:18,472 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 171 transitions. [2020-11-09 16:57:18,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 16:57:18,472 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:57:18,472 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:57:18,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 16:57:18,473 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:57:18,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:57:18,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1358204449, now seen corresponding path program 1 times [2020-11-09 16:57:18,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:57:18,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419208752] [2020-11-09 16:57:18,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:57:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:57:18,867 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 30 [2020-11-09 16:57:18,968 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:57:18,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419208752] [2020-11-09 16:57:18,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:57:18,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 16:57:18,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1510743858] [2020-11-09 16:57:18,969 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:57:18,974 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:57:19,024 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-11-09 16:57:19,025 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:57:19,025 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:57:19,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 16:57:19,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:57:19,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 16:57:19,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:57:19,026 INFO L87 Difference]: Start difference. First operand 96 states and 171 transitions. Second operand 8 states. [2020-11-09 16:57:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:57:19,262 INFO L93 Difference]: Finished difference Result 100 states and 173 transitions. [2020-11-09 16:57:19,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 16:57:19,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-11-09 16:57:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:57:19,264 INFO L225 Difference]: With dead ends: 100 [2020-11-09 16:57:19,264 INFO L226 Difference]: Without dead ends: 94 [2020-11-09 16:57:19,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-09 16:57:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-11-09 16:57:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-11-09 16:57:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-09 16:57:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 167 transitions. [2020-11-09 16:57:19,269 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 167 transitions. Word has length 14 [2020-11-09 16:57:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:57:19,269 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 167 transitions. [2020-11-09 16:57:19,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 16:57:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 167 transitions. [2020-11-09 16:57:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 16:57:19,270 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:57:19,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:57:19,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 16:57:19,270 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:57:19,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:57:19,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1679330479, now seen corresponding path program 1 times [2020-11-09 16:57:19,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:57:19,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014815275] [2020-11-09 16:57:19,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:57:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:57:19,742 WARN L194 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 39 [2020-11-09 16:57:19,886 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 33 [2020-11-09 16:57:19,962 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:57:19,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014815275] [2020-11-09 16:57:19,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:57:19,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 16:57:19,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1182136506] [2020-11-09 16:57:19,964 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:57:19,968 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:57:19,977 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 23 transitions. [2020-11-09 16:57:19,977 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:57:20,024 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [5120#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (<= ~y$w_buff0_used~0 1) (= ~y$r_buff1_thd2~0 0) (= ~y$w_buff0~0 1) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 1))] [2020-11-09 16:57:20,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 16:57:20,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:57:20,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 16:57:20,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-11-09 16:57:20,026 INFO L87 Difference]: Start difference. First operand 94 states and 167 transitions. Second operand 10 states. [2020-11-09 16:57:20,597 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2020-11-09 16:57:20,825 WARN L194 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2020-11-09 16:57:21,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:57:21,156 INFO L93 Difference]: Finished difference Result 135 states and 238 transitions. [2020-11-09 16:57:21,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-09 16:57:21,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-11-09 16:57:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:57:21,159 INFO L225 Difference]: With dead ends: 135 [2020-11-09 16:57:21,159 INFO L226 Difference]: Without dead ends: 130 [2020-11-09 16:57:21,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2020-11-09 16:57:21,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-11-09 16:57:21,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 100. [2020-11-09 16:57:21,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-09 16:57:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 178 transitions. [2020-11-09 16:57:21,171 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 178 transitions. Word has length 15 [2020-11-09 16:57:21,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:57:21,171 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 178 transitions. [2020-11-09 16:57:21,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 16:57:21,171 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 178 transitions. [2020-11-09 16:57:21,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 16:57:21,172 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:57:21,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:57:21,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 16:57:21,172 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:57:21,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:57:21,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1048798191, now seen corresponding path program 2 times [2020-11-09 16:57:21,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:57:21,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989341238] [2020-11-09 16:57:21,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:57:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:57:21,639 WARN L194 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 29 [2020-11-09 16:57:21,817 WARN L194 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 32 [2020-11-09 16:57:22,035 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:57:22,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989341238] [2020-11-09 16:57:22,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:57:22,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 16:57:22,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1622577866] [2020-11-09 16:57:22,037 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:57:22,042 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:57:22,050 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2020-11-09 16:57:22,050 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:57:22,051 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:57:22,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 16:57:22,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:57:22,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 16:57:22,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-09 16:57:22,053 INFO L87 Difference]: Start difference. First operand 100 states and 178 transitions. Second operand 10 states. [2020-11-09 16:57:22,538 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2020-11-09 16:57:22,718 WARN L194 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-11-09 16:57:23,286 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2020-11-09 16:57:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:57:23,405 INFO L93 Difference]: Finished difference Result 159 states and 278 transitions. [2020-11-09 16:57:23,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 16:57:23,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-11-09 16:57:23,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:57:23,407 INFO L225 Difference]: With dead ends: 159 [2020-11-09 16:57:23,407 INFO L226 Difference]: Without dead ends: 131 [2020-11-09 16:57:23,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2020-11-09 16:57:23,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-11-09 16:57:23,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107. [2020-11-09 16:57:23,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-09 16:57:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 185 transitions. [2020-11-09 16:57:23,413 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 185 transitions. Word has length 15 [2020-11-09 16:57:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:57:23,414 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 185 transitions. [2020-11-09 16:57:23,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 16:57:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 185 transitions. [2020-11-09 16:57:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 16:57:23,414 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:57:23,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:57:23,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 16:57:23,415 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:57:23,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:57:23,416 INFO L82 PathProgramCache]: Analyzing trace with hash -956628061, now seen corresponding path program 3 times [2020-11-09 16:57:23,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:57:23,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474436545] [2020-11-09 16:57:23,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:57:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:57:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:57:23,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474436545] [2020-11-09 16:57:23,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:57:23,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:57:23,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [494819227] [2020-11-09 16:57:23,634 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:57:23,638 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:57:23,646 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2020-11-09 16:57:23,646 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:57:23,646 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:57:23,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:57:23,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:57:23,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:57:23,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:57:23,655 INFO L87 Difference]: Start difference. First operand 107 states and 185 transitions. Second operand 5 states. [2020-11-09 16:57:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:57:23,696 INFO L93 Difference]: Finished difference Result 83 states and 135 transitions. [2020-11-09 16:57:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 16:57:23,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-09 16:57:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:57:23,698 INFO L225 Difference]: With dead ends: 83 [2020-11-09 16:57:23,698 INFO L226 Difference]: Without dead ends: 64 [2020-11-09 16:57:23,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:57:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-09 16:57:23,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2020-11-09 16:57:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-09 16:57:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 100 transitions. [2020-11-09 16:57:23,701 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 100 transitions. Word has length 15 [2020-11-09 16:57:23,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:57:23,702 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 100 transitions. [2020-11-09 16:57:23,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:57:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 100 transitions. [2020-11-09 16:57:23,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 16:57:23,703 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:57:23,703 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:57:23,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 16:57:23,703 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:57:23,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:57:23,704 INFO L82 PathProgramCache]: Analyzing trace with hash 628089332, now seen corresponding path program 1 times [2020-11-09 16:57:23,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:57:23,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973860503] [2020-11-09 16:57:23,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:57:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:57:23,928 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:57:23,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973860503] [2020-11-09 16:57:23,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:57:23,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:57:23,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1093849304] [2020-11-09 16:57:23,930 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:57:23,935 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:57:23,950 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 33 transitions. [2020-11-09 16:57:23,950 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:57:23,958 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:23,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:23,959 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:23,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:23,960 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:57:23,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,006 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:57:24,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 16:57:24,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:57:24,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 16:57:24,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:57:24,007 INFO L87 Difference]: Start difference. First operand 61 states and 100 transitions. Second operand 7 states. [2020-11-09 16:57:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:57:24,092 INFO L93 Difference]: Finished difference Result 79 states and 125 transitions. [2020-11-09 16:57:24,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:57:24,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-11-09 16:57:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:57:24,094 INFO L225 Difference]: With dead ends: 79 [2020-11-09 16:57:24,094 INFO L226 Difference]: Without dead ends: 45 [2020-11-09 16:57:24,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-09 16:57:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-11-09 16:57:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-11-09 16:57:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-09 16:57:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 69 transitions. [2020-11-09 16:57:24,097 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 69 transitions. Word has length 19 [2020-11-09 16:57:24,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:57:24,097 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 69 transitions. [2020-11-09 16:57:24,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 16:57:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 69 transitions. [2020-11-09 16:57:24,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 16:57:24,098 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:57:24,098 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:57:24,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 16:57:24,099 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:57:24,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:57:24,099 INFO L82 PathProgramCache]: Analyzing trace with hash 183606026, now seen corresponding path program 2 times [2020-11-09 16:57:24,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:57:24,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786147636] [2020-11-09 16:57:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:57:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:57:24,267 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:57:24,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786147636] [2020-11-09 16:57:24,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:57:24,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:57:24,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1382703617] [2020-11-09 16:57:24,268 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:57:24,274 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:57:24,289 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 39 transitions. [2020-11-09 16:57:24,290 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:57:24,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:57:24,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,299 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:24,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,300 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:57:24,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,357 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:57:24,357 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,358 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:24,358 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,359 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:57:24,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,360 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:24,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,361 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:24,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,363 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:24,363 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,364 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:57:24,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,365 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:24,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,366 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:24,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,438 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:57:24,438 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,439 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:24,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,440 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:57:24,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,441 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:24,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,442 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:24,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,444 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:24,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,445 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:57:24,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,447 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:24,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,448 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:24,448 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,506 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:57:24,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,507 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:24,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,509 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:57:24,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,538 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:57:24,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,539 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:24,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,540 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:57:24,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,568 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:24,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,569 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:24,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,570 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:57:24,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:24,594 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:57:24,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:57:24,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:57:24,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:57:24,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:57:24,595 INFO L87 Difference]: Start difference. First operand 45 states and 69 transitions. Second operand 6 states. [2020-11-09 16:57:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:57:24,658 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2020-11-09 16:57:24,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 16:57:24,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-09 16:57:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:57:24,659 INFO L225 Difference]: With dead ends: 66 [2020-11-09 16:57:24,659 INFO L226 Difference]: Without dead ends: 42 [2020-11-09 16:57:24,659 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:57:24,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-09 16:57:24,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-09 16:57:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-09 16:57:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 63 transitions. [2020-11-09 16:57:24,664 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 63 transitions. Word has length 19 [2020-11-09 16:57:24,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:57:24,664 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 63 transitions. [2020-11-09 16:57:24,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:57:24,664 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 63 transitions. [2020-11-09 16:57:24,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 16:57:24,665 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:57:24,665 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:57:24,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 16:57:24,665 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:57:24,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:57:24,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1405166128, now seen corresponding path program 3 times [2020-11-09 16:57:24,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:57:24,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190563449] [2020-11-09 16:57:24,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:57:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:57:25,340 WARN L194 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 32 [2020-11-09 16:57:25,491 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-11-09 16:57:25,573 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:57:25,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190563449] [2020-11-09 16:57:25,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:57:25,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 16:57:25,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [988460883] [2020-11-09 16:57:25,575 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:57:25,581 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:57:25,600 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 51 transitions. [2020-11-09 16:57:25,601 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:57:25,613 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:57:25,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,615 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:25,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,616 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:57:25,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,618 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:57:25,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,619 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:57:25,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,753 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:57:25,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,754 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 3, 3, 4, 1] term [2020-11-09 16:57:25,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,755 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 3, 2, 4, 1] term [2020-11-09 16:57:25,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,758 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:57:25,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:25,759 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:57:25,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:25,761 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:57:25,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:25,764 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:57:25,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,765 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 4, 4, 3, 3, 4, 3, 4, 2, 4, 1] term [2020-11-09 16:57:25,766 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:25,766 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 3, 4, 3, 4, 2, 4, 1] term [2020-11-09 16:57:25,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:25,767 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 4, 3, 3, 4, 3, 4, 2, 4, 1] term [2020-11-09 16:57:25,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:25,769 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 3, 4, 1] term [2020-11-09 16:57:25,770 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,771 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 3, 4, 2, 4, 1] term [2020-11-09 16:57:25,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,772 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 4, 4, 3, 3, 4, 3, 4, 2, 4, 1] term [2020-11-09 16:57:25,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:25,773 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 3, 4, 3, 4, 2, 4, 1] term [2020-11-09 16:57:25,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:25,774 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 4, 3, 3, 4, 3, 4, 2, 4, 1] term [2020-11-09 16:57:25,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:25,777 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 2, 4, 1] term [2020-11-09 16:57:25,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,779 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 2, 4, 1] term [2020-11-09 16:57:25,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,780 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 2, 4, 1] term [2020-11-09 16:57:25,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,784 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 2, 4, 1] term [2020-11-09 16:57:25,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,788 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 2, 4, 1] term [2020-11-09 16:57:25,788 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,790 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 2, 4, 1] term [2020-11-09 16:57:25,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,794 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[9, 3, 5, 3, 5, 4, 3, 2, 1] term [2020-11-09 16:57:25,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,797 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 2, 4, 1] term [2020-11-09 16:57:25,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:25,803 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 2, 4, 1] term [2020-11-09 16:57:25,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,212 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:57:37,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,213 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 16:57:37,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,222 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 9, 4, 3, 3, 2, 1] term [2020-11-09 16:57:37,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,223 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 9, 3, 2, 1] term [2020-11-09 16:57:37,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,224 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 9, 1] term [2020-11-09 16:57:37,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,226 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 9, 3, 9, 2, 9, 1] term [2020-11-09 16:57:37,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,227 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 9, 3, 9, 2, 9, 1] term [2020-11-09 16:57:37,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,228 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 9, 3, 9, 2, 9, 1] term [2020-11-09 16:57:37,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,231 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 9, 4, 9, 4, 9, 3, 9, 2, 9, 1] term [2020-11-09 16:57:37,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,231 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 9, 4, 9, 4, 9, 3, 9, 2, 9, 1] term [2020-11-09 16:57:37,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,232 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 9, 4, 9, 4, 9, 3, 9, 2, 9, 1] term [2020-11-09 16:57:37,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,234 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 9, 4, 9, 4, 9, 3, 9, 2, 9, 1] term [2020-11-09 16:57:37,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,235 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 9, 4, 9, 4, 9, 3, 9, 2, 9, 1] term [2020-11-09 16:57:37,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,237 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 3, 3, 4, 4, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 2, 9, 1] term [2020-11-09 16:57:37,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:37,239 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 2, 3, 4, 4, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 2, 9, 1] term [2020-11-09 16:57:37,239 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:37,240 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 2, 3, 4, 4, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 2, 9, 1] term [2020-11-09 16:57:37,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:37,243 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 2, 9, 1] term [2020-11-09 16:57:37,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,244 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 2, 9, 1] term [2020-11-09 16:57:37,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,247 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 2, 9, 1] term [2020-11-09 16:57:37,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,252 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[9, 4, 5, 9, 5, 3, 3, 2, 1] term [2020-11-09 16:57:37,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,254 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 2, 7, 1] term [2020-11-09 16:57:37,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:37,257 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 2, 7, 1] term [2020-11-09 16:57:37,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:42,135 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 16:57:42,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:42,136 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:57:42,137 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:42,138 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:42,138 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:42,139 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:42,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:42,140 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:57:42,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:42,416 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 16:57:42,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:42,417 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:57:42,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:42,419 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:57:42,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:42,420 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:42,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:42,420 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:57:42,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:42,615 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 16:57:42,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:42,616 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 16:57:42,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:42,617 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:57:42,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:42,619 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 7, 3, 7, 1] term [2020-11-09 16:57:42,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:42,620 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 16:57:42,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:43,325 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 16:57:43,326 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:43,327 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 16:57:43,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:43,328 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:57:43,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:43,329 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 7, 3, 7, 1] term [2020-11-09 16:57:43,329 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:43,330 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 16:57:43,330 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:44,192 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 16:57:44,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:44,193 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:57:44,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:44,194 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:44,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:44,195 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:44,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:44,196 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:57:44,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:44,646 WARN L194 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 19 [2020-11-09 16:57:44,647 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6434#(and (= 2 ~y~0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff0_thd0~0 0) (or (= 2 ~y$w_buff1~0) (= (mod ~y$w_buff1_used~0 256) 0)))] [2020-11-09 16:57:44,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 16:57:44,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:57:44,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 16:57:44,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-09 16:57:44,649 INFO L87 Difference]: Start difference. First operand 42 states and 63 transitions. Second operand 12 states. [2020-11-09 16:57:45,076 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2020-11-09 16:57:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:57:45,230 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2020-11-09 16:57:45,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 16:57:45,231 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-11-09 16:57:45,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:57:45,232 INFO L225 Difference]: With dead ends: 55 [2020-11-09 16:57:45,232 INFO L226 Difference]: Without dead ends: 32 [2020-11-09 16:57:45,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-11-09 16:57:45,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-09 16:57:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-09 16:57:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-09 16:57:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-11-09 16:57:45,234 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 19 [2020-11-09 16:57:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:57:45,235 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-11-09 16:57:45,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 16:57:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2020-11-09 16:57:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 16:57:45,236 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:57:45,237 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:57:45,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 16:57:45,237 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:57:45,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:57:45,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2112090996, now seen corresponding path program 4 times [2020-11-09 16:57:45,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:57:45,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670804182] [2020-11-09 16:57:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:57:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:57:45,849 WARN L194 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 39 [2020-11-09 16:57:46,157 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:57:46,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670804182] [2020-11-09 16:57:46,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:57:46,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 16:57:46,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1304516504] [2020-11-09 16:57:46,158 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:57:46,162 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:57:46,173 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 35 transitions. [2020-11-09 16:57:46,173 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:57:46,188 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:46,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:46,189 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 3, 3, 2, 2, 1] term [2020-11-09 16:57:46,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:46,190 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 4, 3, 2, 2, 1] term [2020-11-09 16:57:46,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:46,269 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:46,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:46,270 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 3, 3, 2, 2, 1] term [2020-11-09 16:57:46,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:46,271 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 4, 3, 2, 2, 1] term [2020-11-09 16:57:46,271 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:46,344 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:57:46,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:46,345 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:46,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:46,346 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:57:46,346 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:46,348 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 16:57:46,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:46,348 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 16:57:46,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:46,420 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:57:46,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 16:57:46,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:57:46,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 16:57:46,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-09 16:57:46,422 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 10 states. [2020-11-09 16:57:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:57:46,647 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2020-11-09 16:57:46,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 16:57:46,647 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-11-09 16:57:46,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:57:46,648 INFO L225 Difference]: With dead ends: 41 [2020-11-09 16:57:46,648 INFO L226 Difference]: Without dead ends: 30 [2020-11-09 16:57:46,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-09 16:57:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-11-09 16:57:46,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-11-09 16:57:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-11-09 16:57:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2020-11-09 16:57:46,650 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 19 [2020-11-09 16:57:46,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:57:46,650 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-11-09 16:57:46,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 16:57:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2020-11-09 16:57:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 16:57:46,651 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:57:46,651 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:57:46,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 16:57:46,651 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:57:46,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:57:46,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1371779156, now seen corresponding path program 5 times [2020-11-09 16:57:46,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:57:46,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62967146] [2020-11-09 16:57:46,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:57:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:57:47,320 WARN L194 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2020-11-09 16:57:47,629 WARN L194 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2020-11-09 16:57:47,790 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2020-11-09 16:57:47,899 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:57:47,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62967146] [2020-11-09 16:57:47,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:57:47,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 16:57:47,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [73975344] [2020-11-09 16:57:47,901 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:57:47,905 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:57:47,916 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 33 transitions. [2020-11-09 16:57:47,916 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:57:47,948 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 16:57:47,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:47,949 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:57:47,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:47,950 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:47,950 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:47,951 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:47,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:47,952 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:57:47,952 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:47,953 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 3, 5, 1] term [2020-11-09 16:57:47,953 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:48,118 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 16:57:48,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:48,119 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:57:48,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:48,120 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:48,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:48,121 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:57:48,121 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:48,122 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:57:48,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:57:48,122 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 3, 5, 1] term [2020-11-09 16:57:48,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:57:48,288 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:57:48,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 16:57:48,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:57:48,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 16:57:48,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-09 16:57:48,289 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand 11 states. [2020-11-09 16:57:48,581 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-11-09 16:57:48,917 WARN L194 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2020-11-09 16:57:49,251 WARN L194 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2020-11-09 16:57:49,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:57:49,254 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2020-11-09 16:57:49,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 16:57:49,254 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2020-11-09 16:57:49,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:57:49,254 INFO L225 Difference]: With dead ends: 29 [2020-11-09 16:57:49,254 INFO L226 Difference]: Without dead ends: 0 [2020-11-09 16:57:49,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-11-09 16:57:49,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-09 16:57:49,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-09 16:57:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-09 16:57:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-09 16:57:49,256 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-11-09 16:57:49,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:57:49,256 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-09 16:57:49,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 16:57:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-09 16:57:49,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-09 16:57:49,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 16:57:49,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:57:49 BasicIcfg [2020-11-09 16:57:49,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 16:57:49,261 INFO L168 Benchmark]: Toolchain (without parser) took 56963.25 ms. Allocated memory was 161.5 MB in the beginning and 950.0 MB in the end (delta: 788.5 MB). Free memory was 136.0 MB in the beginning and 680.6 MB in the end (delta: -544.6 MB). Peak memory consumption was 244.3 MB. Max. memory is 8.0 GB. [2020-11-09 16:57:49,261 INFO L168 Benchmark]: CDTParser took 0.75 ms. Allocated memory is still 161.5 MB. Free memory was 133.5 MB in the beginning and 133.4 MB in the end (delta: 94.4 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 16:57:49,262 INFO L168 Benchmark]: CACSL2BoogieTranslator took 899.79 ms. Allocated memory is still 161.5 MB. Free memory was 135.4 MB in the beginning and 133.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 33.8 MB. Max. memory is 8.0 GB. [2020-11-09 16:57:49,263 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.85 ms. Allocated memory is still 161.5 MB. Free memory was 133.3 MB in the beginning and 129.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:57:49,263 INFO L168 Benchmark]: Boogie Preprocessor took 60.02 ms. Allocated memory is still 161.5 MB. Free memory was 129.8 MB in the beginning and 126.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:57:49,264 INFO L168 Benchmark]: RCFGBuilder took 4568.45 ms. Allocated memory was 161.5 MB in the beginning and 194.0 MB in the end (delta: 32.5 MB). Free memory was 126.6 MB in the beginning and 120.1 MB in the end (delta: 6.6 MB). Peak memory consumption was 105.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:57:49,266 INFO L168 Benchmark]: TraceAbstraction took 51334.68 ms. Allocated memory was 194.0 MB in the beginning and 950.0 MB in the end (delta: 756.0 MB). Free memory was 119.5 MB in the beginning and 680.6 MB in the end (delta: -561.0 MB). Peak memory consumption was 194.5 MB. Max. memory is 8.0 GB. [2020-11-09 16:57:49,270 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.75 ms. Allocated memory is still 161.5 MB. Free memory was 133.5 MB in the beginning and 133.4 MB in the end (delta: 94.4 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 899.79 ms. Allocated memory is still 161.5 MB. Free memory was 135.4 MB in the beginning and 133.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 33.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 85.85 ms. Allocated memory is still 161.5 MB. Free memory was 133.3 MB in the beginning and 129.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 60.02 ms. Allocated memory is still 161.5 MB. Free memory was 129.8 MB in the beginning and 126.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 4568.45 ms. Allocated memory was 161.5 MB in the beginning and 194.0 MB in the end (delta: 32.5 MB). Free memory was 126.6 MB in the beginning and 120.1 MB in the end (delta: 6.6 MB). Peak memory consumption was 105.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 51334.68 ms. Allocated memory was 194.0 MB in the beginning and 950.0 MB in the end (delta: 756.0 MB). Free memory was 119.5 MB in the beginning and 680.6 MB in the end (delta: -561.0 MB). Peak memory consumption was 194.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 672 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 69 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 16.8s, 93 PlacesBefore, 30 PlacesAfterwards, 89 TransitionsBefore, 24 TransitionsAfterwards, 1268 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 4222 MoverChecksTotal - PositiveResult [Line: 17]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 17]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 51.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 16.9s, HoareTripleCheckerStatistics: 347 SDtfs, 359 SDslu, 868 SDs, 0 SdLazy, 801 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 69 SyntacticMatches, 16 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 57 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 48202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...