/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:55:05,543 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:55:05,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:55:05,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:55:05,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:55:05,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:55:05,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:55:05,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:55:05,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:55:05,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:55:05,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:55:05,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:55:05,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:55:05,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:55:05,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:55:05,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:55:05,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:55:05,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:55:05,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:55:05,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:55:05,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:55:05,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:55:05,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:55:05,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:55:05,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:55:05,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:55:05,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:55:05,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:55:05,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:55:05,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:55:05,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:55:05,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:55:05,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:55:05,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:55:05,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:55:05,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:55:05,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:55:05,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:55:05,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:55:05,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:55:05,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:55:05,668 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-15 18:55:05,708 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:55:05,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:55:05,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:55:05,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:55:05,712 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:55:05,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:55:05,712 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:55:05,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:55:05,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:55:05,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:55:05,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:55:05,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:55:05,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:55:05,715 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:55:05,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:55:05,715 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:55:05,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:55:05,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:55:05,716 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:55:05,716 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:55:05,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:55:05,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:55:05,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:55:05,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:55:05,717 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:55:05,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:55:05,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:55:05,717 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:55:05,717 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:55:05,718 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:55:06,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:55:06,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:55:06,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:55:06,047 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:55:06,048 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:55:06,048 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-10-15 18:55:06,108 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19846d97/159afc5f10db42e1be10f3c405687145/FLAG9dc3c993a [2020-10-15 18:55:06,764 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:55:06,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_1-container_of-global.i [2020-10-15 18:55:06,791 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19846d97/159afc5f10db42e1be10f3c405687145/FLAG9dc3c993a [2020-10-15 18:55:06,948 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19846d97/159afc5f10db42e1be10f3c405687145 [2020-10-15 18:55:06,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:55:06,957 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:55:06,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:55:06,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:55:06,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:55:06,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:55:06" (1/1) ... [2020-10-15 18:55:06,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@399178ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:06, skipping insertion in model container [2020-10-15 18:55:06,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:55:06" (1/1) ... [2020-10-15 18:55:06,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:55:07,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:55:07,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:55:07,807 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:55:07,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:55:08,438 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:55:08,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:08 WrapperNode [2020-10-15 18:55:08,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:55:08,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:55:08,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:55:08,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:55:08,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:08" (1/1) ... [2020-10-15 18:55:08,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:08" (1/1) ... [2020-10-15 18:55:08,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:55:08,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:55:08,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:55:08,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:55:08,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:08" (1/1) ... [2020-10-15 18:55:08,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:08" (1/1) ... [2020-10-15 18:55:08,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:08" (1/1) ... [2020-10-15 18:55:08,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:08" (1/1) ... [2020-10-15 18:55:08,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:08" (1/1) ... [2020-10-15 18:55:08,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:08" (1/1) ... [2020-10-15 18:55:08,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:08" (1/1) ... [2020-10-15 18:55:08,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:55:08,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:55:08,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:55:08,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:55:08,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:08" (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-10-15 18:55:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:55:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-15 18:55:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-15 18:55:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-15 18:55:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:55:08,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:55:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-15 18:55:08,834 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-15 18:55:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:55:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:55:08,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-15 18:55:08,837 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 18:55:09,516 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:55:09,516 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-15 18:55:09,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:55:09 BoogieIcfgContainer [2020-10-15 18:55:09,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:55:09,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:55:09,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:55:09,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:55:09,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:55:06" (1/3) ... [2020-10-15 18:55:09,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16193ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:55:09, skipping insertion in model container [2020-10-15 18:55:09,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:55:08" (2/3) ... [2020-10-15 18:55:09,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16193ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:55:09, skipping insertion in model container [2020-10-15 18:55:09,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:55:09" (3/3) ... [2020-10-15 18:55:09,527 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2020-10-15 18:55:09,538 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:55:09,539 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:55:09,547 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-15 18:55:09,548 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:55:09,579 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,579 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,579 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,580 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,580 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,580 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,580 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,581 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,581 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,581 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,581 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,581 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,582 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,582 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,582 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,582 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,583 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,583 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,583 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,583 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,583 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,584 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,584 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,584 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,584 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,584 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,585 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,585 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,585 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,585 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,586 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,586 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,586 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,586 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,586 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,587 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,587 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,587 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,587 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,587 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,587 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,588 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,588 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,588 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,589 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,589 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,589 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,589 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,589 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,590 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,590 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,590 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,590 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,591 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,591 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,591 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,591 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,592 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,595 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,595 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,596 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,596 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,596 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,596 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,597 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,597 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,597 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,597 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,603 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,603 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,603 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,604 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,604 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,604 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,604 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,604 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,604 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,605 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:55:09,640 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-15 18:55:09,659 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:55:09,659 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:55:09,659 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:55:09,660 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:55:09,660 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:55:09,660 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:55:09,660 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:55:09,660 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:55:09,677 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:55:09,680 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 154 transitions, 330 flow [2020-10-15 18:55:09,683 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 154 transitions, 330 flow [2020-10-15 18:55:09,685 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 330 flow [2020-10-15 18:55:09,770 INFO L129 PetriNetUnfolder]: 11/192 cut-off events. [2020-10-15 18:55:09,770 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-15 18:55:09,781 INFO L80 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 192 events. 11/192 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 370 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. [2020-10-15 18:55:09,789 INFO L117 LiptonReduction]: Number of co-enabled transitions 2652 [2020-10-15 18:55:10,029 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:10,132 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-10-15 18:55:10,133 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:10,145 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:10,189 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:10,191 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:10,192 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 18:55:10,208 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:10,232 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:10,237 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:10,256 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:10,258 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:10,259 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:55:12,561 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:12,586 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:12,606 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:12,629 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:12,631 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:12,632 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 18:55:12,648 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:12,679 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:12,684 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:12,706 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:12,708 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:12,708 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:55:14,747 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:14,779 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:14,785 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:14,809 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:14,812 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:14,813 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-15 18:55:14,828 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:14,854 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:14,858 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:14,879 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:14,880 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:14,881 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-15 18:55:16,910 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:16,941 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:16,945 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:16,965 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:16,966 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:16,967 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:55:16,980 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:17,016 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:17,022 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:17,043 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:17,045 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:17,045 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:55:19,283 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:19,313 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:19,318 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:19,351 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:19,353 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:19,356 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:55:19,371 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:19,401 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:19,405 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:19,426 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:19,427 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:19,427 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 18:55:21,752 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:21,772 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:21,776 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:21,797 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:21,798 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:21,799 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:55:21,812 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:21,831 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:21,835 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:21,849 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:21,850 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:21,851 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-15 18:55:24,077 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:24,105 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:24,112 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:24,134 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:24,136 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:24,136 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:78 [2020-10-15 18:55:24,188 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:24,213 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:24,218 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:24,238 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:24,239 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:24,241 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 18:55:24,270 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:24,295 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:24,301 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:24,318 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:24,320 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:24,320 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-15 18:55:26,395 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:26,418 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:26,423 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:26,443 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:26,444 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:26,444 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-15 18:55:26,465 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:26,487 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:26,493 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:26,527 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:26,528 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:26,529 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 18:55:28,556 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:28,582 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:28,585 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:28,611 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:28,612 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:28,613 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:55:28,623 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:28,649 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:28,653 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:28,675 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:28,676 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:28,676 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:55:30,711 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:30,748 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:30,752 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:30,778 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:30,779 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:30,779 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 18:55:30,791 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:30,823 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:30,829 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:30,858 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:30,859 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:30,859 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-15 18:55:32,893 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:32,915 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:32,918 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:32,938 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:32,940 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:32,940 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:55:32,955 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:32,985 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:32,990 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:33,012 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:33,013 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:33,014 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:55:35,335 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:35,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:35,365 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:35,383 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:35,384 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:35,385 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-15 18:55:35,401 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:35,419 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:35,422 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:35,437 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:35,438 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:35,438 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-15 18:55:37,450 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:37,483 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:37,486 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:37,508 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:37,509 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:37,509 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:55:37,518 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:37,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:37,548 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:37,578 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:37,579 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:37,579 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:55:39,887 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:39,918 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:39,922 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:39,945 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:39,946 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:39,947 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:55:39,974 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:40,004 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:40,009 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:40,032 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:40,033 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:40,033 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:55:42,276 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-10-15 18:55:42,370 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:42,390 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:42,395 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:42,412 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:42,413 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:42,413 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 18:55:42,432 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:42,462 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:42,468 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:42,495 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:42,496 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:42,498 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 18:55:44,643 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:44,665 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:44,669 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:44,689 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:44,690 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:44,691 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:106 [2020-10-15 18:55:44,705 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:44,732 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:44,759 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:44,776 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:44,777 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:44,778 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-15 18:55:46,804 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:46,826 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:46,829 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:46,846 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:46,847 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:46,847 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 18:55:46,859 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:46,880 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:46,886 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:46,907 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:46,908 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:46,909 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 18:55:49,051 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:49,077 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:49,082 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:49,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:49,100 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:49,101 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:55:49,110 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:49,132 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:49,136 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:49,153 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:49,154 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:49,155 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 18:55:51,217 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:51,245 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:51,250 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:51,271 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:51,272 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:51,273 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 18:55:51,282 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:51,318 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:51,323 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:51,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:51,356 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:51,356 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:55:53,450 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:53,469 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:53,472 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:53,498 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:53,499 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:53,499 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-15 18:55:53,510 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:53,530 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:53,533 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:53,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:53,549 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:53,550 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-15 18:55:53,742 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:53,768 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:53,772 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:53,800 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:53,801 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:53,801 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-15 18:55:53,813 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:53,837 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:53,841 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:53,859 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:53,860 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:53,860 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-15 18:55:56,016 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:56,033 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:56,037 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:56,051 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:56,052 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:56,052 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:71 [2020-10-15 18:55:56,075 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:56,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:56,103 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:56,125 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:56,126 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:56,127 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:118 [2020-10-15 18:55:56,141 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:56,165 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:56,170 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:56,197 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:56,198 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:56,198 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-15 18:55:58,214 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:58,238 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:58,242 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:58,265 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:58,266 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:58,266 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:55:58,282 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:58,304 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:58,307 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:58,326 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:55:58,326 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:55:58,327 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 18:56:00,348 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:56:00,372 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:56:00,377 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:56:00,394 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:56:00,394 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:56:00,395 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-15 18:56:00,401 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:56:00,423 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:56:00,426 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:56:00,445 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:56:00,445 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:56:00,446 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:56:02,854 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:56:02,887 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:56:02,891 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:56:02,918 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:56:02,919 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:56:02,919 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:56:02,931 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:56:02,963 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:56:02,967 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:56:02,994 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:56:02,995 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-15 18:56:02,995 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-15 18:56:06,150 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2020-10-15 18:56:06,259 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-15 18:56:06,682 WARN L193 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2020-10-15 18:56:06,699 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:56:06,871 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-15 18:56:06,872 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:56:06,878 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-15 18:56:07,048 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-15 18:56:07,048 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-15 18:56:07,049 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-15 18:56:07,049 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:187, output treesize:199 [2020-10-15 18:56:07,230 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-15 18:56:07,431 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2020-10-15 18:56:08,433 WARN L193 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-15 18:56:08,841 WARN L193 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-15 18:56:09,375 WARN L193 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-10-15 18:56:09,616 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-15 18:56:09,630 INFO L132 LiptonReduction]: Checked pairs total: 6338 [2020-10-15 18:56:09,630 INFO L134 LiptonReduction]: Total number of compositions: 174 [2020-10-15 18:56:09,637 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 38 transitions, 98 flow [2020-10-15 18:56:09,665 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 388 states. [2020-10-15 18:56:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states. [2020-10-15 18:56:09,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-15 18:56:09,673 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:09,674 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-15 18:56:09,675 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:09,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:09,680 INFO L82 PathProgramCache]: Analyzing trace with hash 560, now seen corresponding path program 1 times [2020-10-15 18:56:09,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:09,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952198281] [2020-10-15 18:56:09,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:09,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:09,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952198281] [2020-10-15 18:56:09,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:09,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-15 18:56:09,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539187269] [2020-10-15 18:56:09,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-15 18:56:09,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:09,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-15 18:56:09,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-15 18:56:09,989 INFO L87 Difference]: Start difference. First operand 388 states. Second operand 2 states. [2020-10-15 18:56:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:10,021 INFO L93 Difference]: Finished difference Result 386 states and 932 transitions. [2020-10-15 18:56:10,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-15 18:56:10,022 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-15 18:56:10,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:10,039 INFO L225 Difference]: With dead ends: 386 [2020-10-15 18:56:10,039 INFO L226 Difference]: Without dead ends: 348 [2020-10-15 18:56:10,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-15 18:56:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2020-10-15 18:56:10,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2020-10-15 18:56:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2020-10-15 18:56:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 834 transitions. [2020-10-15 18:56:10,115 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 834 transitions. Word has length 1 [2020-10-15 18:56:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:10,115 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 834 transitions. [2020-10-15 18:56:10,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-15 18:56:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 834 transitions. [2020-10-15 18:56:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-15 18:56:10,116 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:10,116 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-15 18:56:10,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:56:10,117 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:10,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:10,117 INFO L82 PathProgramCache]: Analyzing trace with hash 17264254, now seen corresponding path program 1 times [2020-10-15 18:56:10,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:10,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999663565] [2020-10-15 18:56:10,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:10,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999663565] [2020-10-15 18:56:10,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:10,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:56:10,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371484966] [2020-10-15 18:56:10,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:56:10,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:10,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:56:10,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:56:10,325 INFO L87 Difference]: Start difference. First operand 348 states and 834 transitions. Second operand 3 states. [2020-10-15 18:56:10,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:10,439 INFO L93 Difference]: Finished difference Result 471 states and 1125 transitions. [2020-10-15 18:56:10,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:56:10,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-15 18:56:10,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:10,445 INFO L225 Difference]: With dead ends: 471 [2020-10-15 18:56:10,445 INFO L226 Difference]: Without dead ends: 471 [2020-10-15 18:56:10,446 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:56:10,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2020-10-15 18:56:10,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 407. [2020-10-15 18:56:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-15 18:56:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 989 transitions. [2020-10-15 18:56:10,495 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 989 transitions. Word has length 4 [2020-10-15 18:56:10,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:10,495 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 989 transitions. [2020-10-15 18:56:10,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:56:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 989 transitions. [2020-10-15 18:56:10,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-15 18:56:10,496 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:10,496 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-15 18:56:10,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:56:10,497 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:10,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:10,497 INFO L82 PathProgramCache]: Analyzing trace with hash 535191473, now seen corresponding path program 1 times [2020-10-15 18:56:10,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:10,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129069436] [2020-10-15 18:56:10,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:10,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:10,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129069436] [2020-10-15 18:56:10,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:10,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:56:10,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448793035] [2020-10-15 18:56:10,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:56:10,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:10,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:56:10,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:56:10,626 INFO L87 Difference]: Start difference. First operand 407 states and 989 transitions. Second operand 3 states. [2020-10-15 18:56:10,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:10,705 INFO L93 Difference]: Finished difference Result 498 states and 1196 transitions. [2020-10-15 18:56:10,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:56:10,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-15 18:56:10,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:10,709 INFO L225 Difference]: With dead ends: 498 [2020-10-15 18:56:10,710 INFO L226 Difference]: Without dead ends: 482 [2020-10-15 18:56:10,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:56:10,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-10-15 18:56:10,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2020-10-15 18:56:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-15 18:56:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1111 transitions. [2020-10-15 18:56:10,736 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1111 transitions. Word has length 5 [2020-10-15 18:56:10,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:10,736 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1111 transitions. [2020-10-15 18:56:10,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:56:10,736 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1111 transitions. [2020-10-15 18:56:10,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-15 18:56:10,738 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:10,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:10,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:56:10,739 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:10,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:10,739 INFO L82 PathProgramCache]: Analyzing trace with hash -40110202, now seen corresponding path program 1 times [2020-10-15 18:56:10,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:10,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813905198] [2020-10-15 18:56:10,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:10,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813905198] [2020-10-15 18:56:10,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:10,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:56:10,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45566945] [2020-10-15 18:56:10,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:56:10,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:10,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:56:10,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:56:10,810 INFO L87 Difference]: Start difference. First operand 450 states and 1111 transitions. Second operand 3 states. [2020-10-15 18:56:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:10,829 INFO L93 Difference]: Finished difference Result 162 states and 347 transitions. [2020-10-15 18:56:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:56:10,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-15 18:56:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:10,831 INFO L225 Difference]: With dead ends: 162 [2020-10-15 18:56:10,831 INFO L226 Difference]: Without dead ends: 162 [2020-10-15 18:56:10,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:56:10,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-15 18:56:10,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-15 18:56:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-15 18:56:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 347 transitions. [2020-10-15 18:56:10,837 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 347 transitions. Word has length 10 [2020-10-15 18:56:10,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:10,837 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 347 transitions. [2020-10-15 18:56:10,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:56:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 347 transitions. [2020-10-15 18:56:10,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:10,839 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:10,840 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:10,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:56:10,840 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:10,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:10,840 INFO L82 PathProgramCache]: Analyzing trace with hash 52394444, now seen corresponding path program 1 times [2020-10-15 18:56:10,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:10,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863147485] [2020-10-15 18:56:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:11,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-10-15 18:56:11,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863147485] [2020-10-15 18:56:11,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:11,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:56:11,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708976330] [2020-10-15 18:56:11,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:56:11,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:11,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:56:11,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:56:11,039 INFO L87 Difference]: Start difference. First operand 162 states and 347 transitions. Second operand 6 states. [2020-10-15 18:56:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:11,205 INFO L93 Difference]: Finished difference Result 206 states and 427 transitions. [2020-10-15 18:56:11,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:56:11,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-15 18:56:11,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:11,207 INFO L225 Difference]: With dead ends: 206 [2020-10-15 18:56:11,208 INFO L226 Difference]: Without dead ends: 206 [2020-10-15 18:56:11,208 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:56:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-10-15 18:56:11,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2020-10-15 18:56:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-15 18:56:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 405 transitions. [2020-10-15 18:56:11,216 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 405 transitions. Word has length 22 [2020-10-15 18:56:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:11,216 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 405 transitions. [2020-10-15 18:56:11,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:56:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 405 transitions. [2020-10-15 18:56:11,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:11,222 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:11,222 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:11,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:56:11,222 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:11,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:11,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120554, now seen corresponding path program 1 times [2020-10-15 18:56:11,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:11,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319319463] [2020-10-15 18:56:11,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:12,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319319463] [2020-10-15 18:56:12,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:12,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:56:12,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852740999] [2020-10-15 18:56:12,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:56:12,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:12,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:56:12,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:12,074 INFO L87 Difference]: Start difference. First operand 194 states and 405 transitions. Second operand 12 states. [2020-10-15 18:56:13,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:13,322 INFO L93 Difference]: Finished difference Result 314 states and 604 transitions. [2020-10-15 18:56:13,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-15 18:56:13,323 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 18:56:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:13,327 INFO L225 Difference]: With dead ends: 314 [2020-10-15 18:56:13,327 INFO L226 Difference]: Without dead ends: 314 [2020-10-15 18:56:13,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2020-10-15 18:56:13,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-10-15 18:56:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 248. [2020-10-15 18:56:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-10-15 18:56:13,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 493 transitions. [2020-10-15 18:56:13,336 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 493 transitions. Word has length 22 [2020-10-15 18:56:13,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:13,336 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 493 transitions. [2020-10-15 18:56:13,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:56:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 493 transitions. [2020-10-15 18:56:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:13,337 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:13,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:13,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:56:13,338 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:13,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:13,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1309120544, now seen corresponding path program 1 times [2020-10-15 18:56:13,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:13,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600703411] [2020-10-15 18:56:13,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:13,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600703411] [2020-10-15 18:56:13,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:13,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:56:13,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326252016] [2020-10-15 18:56:13,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 18:56:13,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:13,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 18:56:13,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:56:13,608 INFO L87 Difference]: Start difference. First operand 248 states and 493 transitions. Second operand 8 states. [2020-10-15 18:56:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:13,939 INFO L93 Difference]: Finished difference Result 369 states and 697 transitions. [2020-10-15 18:56:13,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:56:13,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-15 18:56:13,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:13,942 INFO L225 Difference]: With dead ends: 369 [2020-10-15 18:56:13,942 INFO L226 Difference]: Without dead ends: 319 [2020-10-15 18:56:13,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:13,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-10-15 18:56:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 247. [2020-10-15 18:56:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-10-15 18:56:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 491 transitions. [2020-10-15 18:56:13,956 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 491 transitions. Word has length 22 [2020-10-15 18:56:13,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:13,956 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 491 transitions. [2020-10-15 18:56:13,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 18:56:13,957 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 491 transitions. [2020-10-15 18:56:13,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:13,958 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:13,958 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:13,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:56:13,958 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:13,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:13,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1413732572, now seen corresponding path program 2 times [2020-10-15 18:56:13,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:13,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223034447] [2020-10-15 18:56:13,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:14,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223034447] [2020-10-15 18:56:14,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:14,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:56:14,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861501423] [2020-10-15 18:56:14,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:56:14,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:14,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:56:14,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:56:14,110 INFO L87 Difference]: Start difference. First operand 247 states and 491 transitions. Second operand 4 states. [2020-10-15 18:56:14,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:14,139 INFO L93 Difference]: Finished difference Result 162 states and 259 transitions. [2020-10-15 18:56:14,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:56:14,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-15 18:56:14,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:14,141 INFO L225 Difference]: With dead ends: 162 [2020-10-15 18:56:14,141 INFO L226 Difference]: Without dead ends: 157 [2020-10-15 18:56:14,142 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:56:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-15 18:56:14,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2020-10-15 18:56:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-10-15 18:56:14,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 253 transitions. [2020-10-15 18:56:14,146 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 253 transitions. Word has length 22 [2020-10-15 18:56:14,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:14,146 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 253 transitions. [2020-10-15 18:56:14,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:56:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 253 transitions. [2020-10-15 18:56:14,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:14,147 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:14,147 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:14,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:56:14,148 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:14,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:14,148 INFO L82 PathProgramCache]: Analyzing trace with hash 472795278, now seen corresponding path program 2 times [2020-10-15 18:56:14,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:14,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800955746] [2020-10-15 18:56:14,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:14,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800955746] [2020-10-15 18:56:14,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:14,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 18:56:14,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017113895] [2020-10-15 18:56:14,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 18:56:14,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:14,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 18:56:14,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:56:14,290 INFO L87 Difference]: Start difference. First operand 156 states and 253 transitions. Second operand 8 states. [2020-10-15 18:56:14,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:14,599 INFO L93 Difference]: Finished difference Result 151 states and 239 transitions. [2020-10-15 18:56:14,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:56:14,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-15 18:56:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:14,601 INFO L225 Difference]: With dead ends: 151 [2020-10-15 18:56:14,601 INFO L226 Difference]: Without dead ends: 151 [2020-10-15 18:56:14,601 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-10-15 18:56:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2020-10-15 18:56:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-15 18:56:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 208 transitions. [2020-10-15 18:56:14,606 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 208 transitions. Word has length 22 [2020-10-15 18:56:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:14,606 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 208 transitions. [2020-10-15 18:56:14,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 18:56:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 208 transitions. [2020-10-15 18:56:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:14,607 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:14,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:14,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:56:14,608 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:14,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1729521388, now seen corresponding path program 3 times [2020-10-15 18:56:14,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:14,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883621454] [2020-10-15 18:56:14,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:15,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883621454] [2020-10-15 18:56:15,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:15,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:56:15,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538623972] [2020-10-15 18:56:15,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:56:15,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:15,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:56:15,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:15,250 INFO L87 Difference]: Start difference. First operand 130 states and 208 transitions. Second operand 12 states. [2020-10-15 18:56:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:16,009 INFO L93 Difference]: Finished difference Result 144 states and 221 transitions. [2020-10-15 18:56:16,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-15 18:56:16,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 18:56:16,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:16,011 INFO L225 Difference]: With dead ends: 144 [2020-10-15 18:56:16,012 INFO L226 Difference]: Without dead ends: 131 [2020-10-15 18:56:16,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2020-10-15 18:56:16,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-15 18:56:16,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2020-10-15 18:56:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-15 18:56:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 207 transitions. [2020-10-15 18:56:16,016 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 207 transitions. Word has length 22 [2020-10-15 18:56:16,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:16,016 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 207 transitions. [2020-10-15 18:56:16,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:56:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 207 transitions. [2020-10-15 18:56:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:16,017 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:16,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:16,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:56:16,018 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:16,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:16,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1321376162, now seen corresponding path program 4 times [2020-10-15 18:56:16,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:16,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620922229] [2020-10-15 18:56:16,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:16,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620922229] [2020-10-15 18:56:16,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:16,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:56:16,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063982903] [2020-10-15 18:56:16,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:56:16,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:16,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:56:16,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:16,500 INFO L87 Difference]: Start difference. First operand 130 states and 207 transitions. Second operand 12 states. [2020-10-15 18:56:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:17,254 INFO L93 Difference]: Finished difference Result 142 states and 218 transitions. [2020-10-15 18:56:17,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 18:56:17,254 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 18:56:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:17,255 INFO L225 Difference]: With dead ends: 142 [2020-10-15 18:56:17,255 INFO L226 Difference]: Without dead ends: 130 [2020-10-15 18:56:17,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-10-15 18:56:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-10-15 18:56:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-10-15 18:56:17,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-10-15 18:56:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 205 transitions. [2020-10-15 18:56:17,260 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 205 transitions. Word has length 22 [2020-10-15 18:56:17,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:17,260 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 205 transitions. [2020-10-15 18:56:17,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:56:17,261 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 205 transitions. [2020-10-15 18:56:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:17,261 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:17,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:17,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:56:17,262 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:17,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:17,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1455400266, now seen corresponding path program 5 times [2020-10-15 18:56:17,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:17,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125223261] [2020-10-15 18:56:17,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:17,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125223261] [2020-10-15 18:56:17,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:17,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:56:17,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556867094] [2020-10-15 18:56:17,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:56:17,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:17,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:56:17,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:17,752 INFO L87 Difference]: Start difference. First operand 130 states and 205 transitions. Second operand 12 states. [2020-10-15 18:56:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:18,477 INFO L93 Difference]: Finished difference Result 149 states and 230 transitions. [2020-10-15 18:56:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 18:56:18,477 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 18:56:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:18,479 INFO L225 Difference]: With dead ends: 149 [2020-10-15 18:56:18,479 INFO L226 Difference]: Without dead ends: 149 [2020-10-15 18:56:18,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-15 18:56:18,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-10-15 18:56:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2020-10-15 18:56:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-10-15 18:56:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 230 transitions. [2020-10-15 18:56:18,484 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 230 transitions. Word has length 22 [2020-10-15 18:56:18,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:18,484 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 230 transitions. [2020-10-15 18:56:18,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:56:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 230 transitions. [2020-10-15 18:56:18,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:18,485 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:18,485 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:18,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:56:18,486 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:18,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:18,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1455400276, now seen corresponding path program 2 times [2020-10-15 18:56:18,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:18,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358578993] [2020-10-15 18:56:18,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:18,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358578993] [2020-10-15 18:56:18,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:18,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:56:18,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229282692] [2020-10-15 18:56:18,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 18:56:18,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:18,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 18:56:18,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:56:18,639 INFO L87 Difference]: Start difference. First operand 148 states and 230 transitions. Second operand 8 states. [2020-10-15 18:56:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:18,924 INFO L93 Difference]: Finished difference Result 191 states and 287 transitions. [2020-10-15 18:56:18,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:56:18,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-15 18:56:18,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:18,925 INFO L225 Difference]: With dead ends: 191 [2020-10-15 18:56:18,926 INFO L226 Difference]: Without dead ends: 165 [2020-10-15 18:56:18,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:18,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-10-15 18:56:18,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 128. [2020-10-15 18:56:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-15 18:56:18,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 199 transitions. [2020-10-15 18:56:18,931 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 199 transitions. Word has length 22 [2020-10-15 18:56:18,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:18,931 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 199 transitions. [2020-10-15 18:56:18,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 18:56:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 199 transitions. [2020-10-15 18:56:18,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:18,932 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:18,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:18,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:56:18,933 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:18,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:18,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2057875200, now seen corresponding path program 3 times [2020-10-15 18:56:18,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:18,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686355473] [2020-10-15 18:56:18,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:19,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686355473] [2020-10-15 18:56:19,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:19,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:56:19,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786071160] [2020-10-15 18:56:19,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 18:56:19,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:19,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 18:56:19,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-15 18:56:19,103 INFO L87 Difference]: Start difference. First operand 128 states and 199 transitions. Second operand 11 states. [2020-10-15 18:56:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:19,740 INFO L93 Difference]: Finished difference Result 245 states and 383 transitions. [2020-10-15 18:56:19,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-15 18:56:19,740 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-15 18:56:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:19,742 INFO L225 Difference]: With dead ends: 245 [2020-10-15 18:56:19,742 INFO L226 Difference]: Without dead ends: 230 [2020-10-15 18:56:19,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=325, Unknown=0, NotChecked=0, Total=506 [2020-10-15 18:56:19,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-15 18:56:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 141. [2020-10-15 18:56:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2020-10-15 18:56:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 227 transitions. [2020-10-15 18:56:19,747 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 227 transitions. Word has length 22 [2020-10-15 18:56:19,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:19,747 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 227 transitions. [2020-10-15 18:56:19,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 18:56:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 227 transitions. [2020-10-15 18:56:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:19,748 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:19,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:19,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 18:56:19,749 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:19,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:19,749 INFO L82 PathProgramCache]: Analyzing trace with hash -761551564, now seen corresponding path program 6 times [2020-10-15 18:56:19,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:19,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534766065] [2020-10-15 18:56:19,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:20,039 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2020-10-15 18:56:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:20,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534766065] [2020-10-15 18:56:20,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:20,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:56:20,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504361602] [2020-10-15 18:56:20,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:56:20,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:20,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:56:20,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:20,317 INFO L87 Difference]: Start difference. First operand 141 states and 227 transitions. Second operand 12 states. [2020-10-15 18:56:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:21,236 INFO L93 Difference]: Finished difference Result 148 states and 233 transitions. [2020-10-15 18:56:21,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 18:56:21,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 18:56:21,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:21,239 INFO L225 Difference]: With dead ends: 148 [2020-10-15 18:56:21,239 INFO L226 Difference]: Without dead ends: 137 [2020-10-15 18:56:21,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2020-10-15 18:56:21,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-15 18:56:21,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-15 18:56:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-15 18:56:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 219 transitions. [2020-10-15 18:56:21,250 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 219 transitions. Word has length 22 [2020-10-15 18:56:21,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:21,251 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 219 transitions. [2020-10-15 18:56:21,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:56:21,251 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 219 transitions. [2020-10-15 18:56:21,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:21,252 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:21,254 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:21,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 18:56:21,254 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:21,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:21,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1314893868, now seen corresponding path program 7 times [2020-10-15 18:56:21,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:21,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417682102] [2020-10-15 18:56:21,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:21,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417682102] [2020-10-15 18:56:21,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:21,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:56:21,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364545204] [2020-10-15 18:56:21,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:56:21,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:21,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:56:21,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:21,896 INFO L87 Difference]: Start difference. First operand 137 states and 219 transitions. Second operand 12 states. [2020-10-15 18:56:22,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:22,552 INFO L93 Difference]: Finished difference Result 145 states and 226 transitions. [2020-10-15 18:56:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 18:56:22,553 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 18:56:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:22,554 INFO L225 Difference]: With dead ends: 145 [2020-10-15 18:56:22,554 INFO L226 Difference]: Without dead ends: 121 [2020-10-15 18:56:22,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-15 18:56:22,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-15 18:56:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-10-15 18:56:22,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-15 18:56:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 194 transitions. [2020-10-15 18:56:22,560 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 194 transitions. Word has length 22 [2020-10-15 18:56:22,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:22,560 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 194 transitions. [2020-10-15 18:56:22,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:56:22,561 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 194 transitions. [2020-10-15 18:56:22,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:22,562 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:22,562 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:22,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 18:56:22,562 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:22,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:22,563 INFO L82 PathProgramCache]: Analyzing trace with hash -149449002, now seen corresponding path program 8 times [2020-10-15 18:56:22,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:22,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356136852] [2020-10-15 18:56:22,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:23,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356136852] [2020-10-15 18:56:23,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:23,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:56:23,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590625889] [2020-10-15 18:56:23,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:56:23,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:23,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:56:23,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:23,134 INFO L87 Difference]: Start difference. First operand 121 states and 194 transitions. Second operand 12 states. [2020-10-15 18:56:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:23,831 INFO L93 Difference]: Finished difference Result 121 states and 193 transitions. [2020-10-15 18:56:23,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 18:56:23,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 18:56:23,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:23,833 INFO L225 Difference]: With dead ends: 121 [2020-10-15 18:56:23,833 INFO L226 Difference]: Without dead ends: 106 [2020-10-15 18:56:23,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-15 18:56:23,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-15 18:56:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-15 18:56:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-15 18:56:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 178 transitions. [2020-10-15 18:56:23,838 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 178 transitions. Word has length 22 [2020-10-15 18:56:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:23,838 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 178 transitions. [2020-10-15 18:56:23,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:56:23,838 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 178 transitions. [2020-10-15 18:56:23,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:23,839 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:23,839 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:23,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 18:56:23,839 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:23,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:23,840 INFO L82 PathProgramCache]: Analyzing trace with hash -552633476, now seen corresponding path program 9 times [2020-10-15 18:56:23,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:23,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000548051] [2020-10-15 18:56:23,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:24,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:24,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000548051] [2020-10-15 18:56:24,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:24,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:56:24,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234382091] [2020-10-15 18:56:24,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:56:24,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:24,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:56:24,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:24,357 INFO L87 Difference]: Start difference. First operand 106 states and 178 transitions. Second operand 12 states. [2020-10-15 18:56:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:25,040 INFO L93 Difference]: Finished difference Result 137 states and 223 transitions. [2020-10-15 18:56:25,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 18:56:25,040 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 18:56:25,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:25,044 INFO L225 Difference]: With dead ends: 137 [2020-10-15 18:56:25,044 INFO L226 Difference]: Without dead ends: 137 [2020-10-15 18:56:25,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-15 18:56:25,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-15 18:56:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2020-10-15 18:56:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-10-15 18:56:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 223 transitions. [2020-10-15 18:56:25,048 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 223 transitions. Word has length 22 [2020-10-15 18:56:25,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:25,048 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 223 transitions. [2020-10-15 18:56:25,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:56:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 223 transitions. [2020-10-15 18:56:25,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:25,050 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:25,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:25,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 18:56:25,050 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:25,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:25,050 INFO L82 PathProgramCache]: Analyzing trace with hash -552633486, now seen corresponding path program 3 times [2020-10-15 18:56:25,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:25,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760528437] [2020-10-15 18:56:25,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:25,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760528437] [2020-10-15 18:56:25,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:25,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:56:25,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612705175] [2020-10-15 18:56:25,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 18:56:25,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:25,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 18:56:25,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:56:25,198 INFO L87 Difference]: Start difference. First operand 136 states and 223 transitions. Second operand 8 states. [2020-10-15 18:56:25,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:25,530 INFO L93 Difference]: Finished difference Result 166 states and 269 transitions. [2020-10-15 18:56:25,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:56:25,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-15 18:56:25,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:25,532 INFO L225 Difference]: With dead ends: 166 [2020-10-15 18:56:25,532 INFO L226 Difference]: Without dead ends: 135 [2020-10-15 18:56:25,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:25,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-15 18:56:25,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-10-15 18:56:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-15 18:56:25,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 223 transitions. [2020-10-15 18:56:25,538 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 223 transitions. Word has length 22 [2020-10-15 18:56:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:25,539 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 223 transitions. [2020-10-15 18:56:25,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 18:56:25,539 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 223 transitions. [2020-10-15 18:56:25,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:25,540 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:25,540 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:25,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 18:56:25,541 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:25,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:25,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1930461660, now seen corresponding path program 10 times [2020-10-15 18:56:25,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:25,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600828885] [2020-10-15 18:56:25,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:26,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600828885] [2020-10-15 18:56:26,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:26,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:56:26,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145577010] [2020-10-15 18:56:26,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:56:26,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:26,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:56:26,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:26,395 INFO L87 Difference]: Start difference. First operand 135 states and 223 transitions. Second operand 12 states. [2020-10-15 18:56:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:27,156 INFO L93 Difference]: Finished difference Result 174 states and 282 transitions. [2020-10-15 18:56:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 18:56:27,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 18:56:27,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:27,158 INFO L225 Difference]: With dead ends: 174 [2020-10-15 18:56:27,158 INFO L226 Difference]: Without dead ends: 132 [2020-10-15 18:56:27,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-15 18:56:27,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-15 18:56:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-15 18:56:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-15 18:56:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 216 transitions. [2020-10-15 18:56:27,162 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 216 transitions. Word has length 22 [2020-10-15 18:56:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:27,163 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 216 transitions. [2020-10-15 18:56:27,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:56:27,163 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 216 transitions. [2020-10-15 18:56:27,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:27,163 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:27,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:27,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-15 18:56:27,164 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:27,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:27,164 INFO L82 PathProgramCache]: Analyzing trace with hash 571806310, now seen corresponding path program 11 times [2020-10-15 18:56:27,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:27,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878982099] [2020-10-15 18:56:27,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:27,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878982099] [2020-10-15 18:56:27,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:27,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:56:27,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669486682] [2020-10-15 18:56:27,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:56:27,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:27,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:56:27,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:27,682 INFO L87 Difference]: Start difference. First operand 132 states and 216 transitions. Second operand 12 states. [2020-10-15 18:56:28,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:28,415 INFO L93 Difference]: Finished difference Result 169 states and 273 transitions. [2020-10-15 18:56:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 18:56:28,416 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 18:56:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:28,417 INFO L225 Difference]: With dead ends: 169 [2020-10-15 18:56:28,418 INFO L226 Difference]: Without dead ends: 132 [2020-10-15 18:56:28,418 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-15 18:56:28,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-15 18:56:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2020-10-15 18:56:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-10-15 18:56:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 212 transitions. [2020-10-15 18:56:28,421 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 212 transitions. Word has length 22 [2020-10-15 18:56:28,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:28,422 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 212 transitions. [2020-10-15 18:56:28,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:56:28,422 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 212 transitions. [2020-10-15 18:56:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:28,422 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:28,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:28,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-15 18:56:28,425 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:28,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:28,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1853019498, now seen corresponding path program 12 times [2020-10-15 18:56:28,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:28,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892518129] [2020-10-15 18:56:28,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:28,710 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2020-10-15 18:56:29,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:29,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892518129] [2020-10-15 18:56:29,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:29,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:56:29,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828320743] [2020-10-15 18:56:29,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:56:29,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:29,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:56:29,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:29,085 INFO L87 Difference]: Start difference. First operand 132 states and 212 transitions. Second operand 12 states. [2020-10-15 18:56:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:29,832 INFO L93 Difference]: Finished difference Result 153 states and 241 transitions. [2020-10-15 18:56:29,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 18:56:29,833 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 18:56:29,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:29,834 INFO L225 Difference]: With dead ends: 153 [2020-10-15 18:56:29,834 INFO L226 Difference]: Without dead ends: 153 [2020-10-15 18:56:29,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2020-10-15 18:56:29,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-10-15 18:56:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2020-10-15 18:56:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-15 18:56:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 241 transitions. [2020-10-15 18:56:29,838 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 241 transitions. Word has length 22 [2020-10-15 18:56:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:29,838 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 241 transitions. [2020-10-15 18:56:29,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:56:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 241 transitions. [2020-10-15 18:56:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:29,839 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:29,839 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:29,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-15 18:56:29,840 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:29,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:29,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1853019508, now seen corresponding path program 4 times [2020-10-15 18:56:29,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:29,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351592503] [2020-10-15 18:56:29,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:29,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351592503] [2020-10-15 18:56:29,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:29,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:56:29,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713558168] [2020-10-15 18:56:29,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 18:56:29,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:29,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 18:56:29,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:56:29,971 INFO L87 Difference]: Start difference. First operand 152 states and 241 transitions. Second operand 8 states. [2020-10-15 18:56:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:30,190 INFO L93 Difference]: Finished difference Result 161 states and 251 transitions. [2020-10-15 18:56:30,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:56:30,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-15 18:56:30,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:30,192 INFO L225 Difference]: With dead ends: 161 [2020-10-15 18:56:30,192 INFO L226 Difference]: Without dead ends: 131 [2020-10-15 18:56:30,192 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-15 18:56:30,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 101. [2020-10-15 18:56:30,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-15 18:56:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 160 transitions. [2020-10-15 18:56:30,195 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 160 transitions. Word has length 22 [2020-10-15 18:56:30,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:30,195 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 160 transitions. [2020-10-15 18:56:30,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 18:56:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 160 transitions. [2020-10-15 18:56:30,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:30,196 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:30,196 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:30,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-15 18:56:30,197 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:30,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:30,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1877323498, now seen corresponding path program 13 times [2020-10-15 18:56:30,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:30,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552949161] [2020-10-15 18:56:30,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:30,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552949161] [2020-10-15 18:56:30,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:30,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:56:30,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413154908] [2020-10-15 18:56:30,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:56:30,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:30,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:56:30,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:30,764 INFO L87 Difference]: Start difference. First operand 101 states and 160 transitions. Second operand 12 states. [2020-10-15 18:56:31,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:31,624 INFO L93 Difference]: Finished difference Result 130 states and 200 transitions. [2020-10-15 18:56:31,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-15 18:56:31,625 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 18:56:31,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:31,625 INFO L225 Difference]: With dead ends: 130 [2020-10-15 18:56:31,626 INFO L226 Difference]: Without dead ends: 110 [2020-10-15 18:56:31,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2020-10-15 18:56:31,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-15 18:56:31,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2020-10-15 18:56:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-15 18:56:31,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions. [2020-10-15 18:56:31,629 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 22 [2020-10-15 18:56:31,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:31,629 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 156 transitions. [2020-10-15 18:56:31,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:56:31,629 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2020-10-15 18:56:31,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:31,630 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:31,630 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:31,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-15 18:56:31,630 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:31,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:31,631 INFO L82 PathProgramCache]: Analyzing trace with hash 280732566, now seen corresponding path program 14 times [2020-10-15 18:56:31,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:31,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880561830] [2020-10-15 18:56:31,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:32,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880561830] [2020-10-15 18:56:32,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:32,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:56:32,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39208773] [2020-10-15 18:56:32,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:56:32,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:32,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:56:32,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:32,104 INFO L87 Difference]: Start difference. First operand 101 states and 156 transitions. Second operand 12 states. [2020-10-15 18:56:32,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:32,741 INFO L93 Difference]: Finished difference Result 120 states and 178 transitions. [2020-10-15 18:56:32,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 18:56:32,742 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 18:56:32,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:32,743 INFO L225 Difference]: With dead ends: 120 [2020-10-15 18:56:32,743 INFO L226 Difference]: Without dead ends: 76 [2020-10-15 18:56:32,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-10-15 18:56:32,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-15 18:56:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2020-10-15 18:56:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-15 18:56:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2020-10-15 18:56:32,746 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 22 [2020-10-15 18:56:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:32,746 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2020-10-15 18:56:32,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:56:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2020-10-15 18:56:32,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 18:56:32,746 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:56:32,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:56:32,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-15 18:56:32,747 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:56:32,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:56:32,747 INFO L82 PathProgramCache]: Analyzing trace with hash 779226054, now seen corresponding path program 15 times [2020-10-15 18:56:32,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:56:32,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300459028] [2020-10-15 18:56:32,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:56:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:56:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:56:33,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300459028] [2020-10-15 18:56:33,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:56:33,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 18:56:33,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594459593] [2020-10-15 18:56:33,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 18:56:33,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:56:33,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 18:56:33,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-15 18:56:33,285 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand 12 states. [2020-10-15 18:56:33,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:56:33,866 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2020-10-15 18:56:33,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 18:56:33,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-15 18:56:33,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:56:33,866 INFO L225 Difference]: With dead ends: 66 [2020-10-15 18:56:33,866 INFO L226 Difference]: Without dead ends: 0 [2020-10-15 18:56:33,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2020-10-15 18:56:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-15 18:56:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-15 18:56:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-15 18:56:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-15 18:56:33,868 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-10-15 18:56:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:56:33,868 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-15 18:56:33,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 18:56:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-15 18:56:33,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-15 18:56:33,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-15 18:56:33,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:56:33 BasicIcfg [2020-10-15 18:56:33,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:56:33,873 INFO L168 Benchmark]: Toolchain (without parser) took 86916.46 ms. Allocated memory was 252.2 MB in the beginning and 639.1 MB in the end (delta: 386.9 MB). Free memory was 202.2 MB in the beginning and 239.0 MB in the end (delta: -36.7 MB). Peak memory consumption was 350.2 MB. Max. memory is 14.2 GB. [2020-10-15 18:56:33,874 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 252.2 MB. Free memory is still 226.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:56:33,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1483.44 ms. Allocated memory was 252.2 MB in the beginning and 359.1 MB in the end (delta: 107.0 MB). Free memory was 202.2 MB in the beginning and 318.6 MB in the end (delta: -116.3 MB). Peak memory consumption was 106.7 MB. Max. memory is 14.2 GB. [2020-10-15 18:56:33,874 INFO L168 Benchmark]: Boogie Procedure Inliner took 172.55 ms. Allocated memory is still 359.1 MB. Free memory was 318.6 MB in the beginning and 315.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-15 18:56:33,875 INFO L168 Benchmark]: Boogie Preprocessor took 115.54 ms. Allocated memory is still 359.1 MB. Free memory was 315.2 MB in the beginning and 311.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-15 18:56:33,875 INFO L168 Benchmark]: RCFGBuilder took 786.60 ms. Allocated memory is still 359.1 MB. Free memory was 311.8 MB in the beginning and 265.4 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 14.2 GB. [2020-10-15 18:56:33,875 INFO L168 Benchmark]: TraceAbstraction took 84352.54 ms. Allocated memory was 359.1 MB in the beginning and 639.1 MB in the end (delta: 280.0 MB). Free memory was 265.4 MB in the beginning and 239.0 MB in the end (delta: 26.5 MB). Peak memory consumption was 306.4 MB. Max. memory is 14.2 GB. [2020-10-15 18:56:33,877 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 252.2 MB. Free memory is still 226.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 1483.44 ms. Allocated memory was 252.2 MB in the beginning and 359.1 MB in the end (delta: 107.0 MB). Free memory was 202.2 MB in the beginning and 318.6 MB in the end (delta: -116.3 MB). Peak memory consumption was 106.7 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 172.55 ms. Allocated memory is still 359.1 MB. Free memory was 318.6 MB in the beginning and 315.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 115.54 ms. Allocated memory is still 359.1 MB. Free memory was 315.2 MB in the beginning and 311.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * RCFGBuilder took 786.60 ms. Allocated memory is still 359.1 MB. Free memory was 311.8 MB in the beginning and 265.4 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 84352.54 ms. Allocated memory was 359.1 MB in the beginning and 639.1 MB in the end (delta: 280.0 MB). Free memory was 265.4 MB in the beginning and 239.0 MB in the end (delta: 26.5 MB). Peak memory consumption was 306.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1759 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 7 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 24 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 52.3s, 141 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 59.9s, 150 PlacesBefore, 40 PlacesAfterwards, 154 TransitionsBefore, 38 TransitionsAfterwards, 2652 CoEnabledTransitionPairs, 7 FixpointIterations, 90 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 16 ConcurrentYvCompositions, 6 ChoiceCompositions, 174 TotalNumberOfCompositions, 6338 MoverChecksTotal - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1682]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 84.2s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 60.0s, HoareTripleCheckerStatistics: 626 SDtfs, 908 SDslu, 2076 SDs, 0 SdLazy, 4679 SolverSat, 441 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 22 SyntacticMatches, 33 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 446 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 478 ConstructedInterpolants, 0 QuantifiedInterpolants, 215289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...