/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 12:11:57,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 12:11:57,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 12:11:57,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 12:11:57,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 12:11:57,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 12:11:57,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 12:11:57,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 12:11:57,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 12:11:57,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 12:11:57,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 12:11:57,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 12:11:57,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 12:11:57,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 12:11:57,541 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 12:11:57,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 12:11:57,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 12:11:57,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 12:11:57,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 12:11:57,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 12:11:57,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 12:11:57,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 12:11:57,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 12:11:57,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 12:11:57,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 12:11:57,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 12:11:57,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 12:11:57,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 12:11:57,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 12:11:57,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 12:11:57,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 12:11:57,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 12:11:57,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 12:11:57,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 12:11:57,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 12:11:57,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 12:11:57,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 12:11:57,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 12:11:57,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 12:11:57,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 12:11:57,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 12:11:57,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 12:11:57,594 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 12:11:57,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 12:11:57,594 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 12:11:57,595 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 12:11:57,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 12:11:57,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 12:11:57,596 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 12:11:57,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 12:11:57,597 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 12:11:57,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 12:11:57,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 12:11:57,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 12:11:57,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 12:11:57,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 12:11:57,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 12:11:57,598 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 12:11:57,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 12:11:57,598 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 12:11:57,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 12:11:57,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 12:11:57,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 12:11:57,598 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 12:11:57,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 12:11:57,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 12:11:57,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 12:11:57,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 12:11:57,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 12:11:57,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 12:11:57,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 12:11:57,599 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 12:11:57,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 12:11:57,599 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 12:11:57,599 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 12:11:57,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 12:11:57,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 12:11:57,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 12:11:57,842 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 12:11:57,842 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 12:11:57,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2021-06-05 12:11:57,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af9294b66/871ed31ea4844027b31450719f75adc0/FLAGa57abc699 [2021-06-05 12:11:58,342 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 12:11:58,343 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2021-06-05 12:11:58,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af9294b66/871ed31ea4844027b31450719f75adc0/FLAGa57abc699 [2021-06-05 12:11:58,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af9294b66/871ed31ea4844027b31450719f75adc0 [2021-06-05 12:11:58,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 12:11:58,376 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 12:11:58,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 12:11:58,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 12:11:58,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 12:11:58,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:11:58" (1/1) ... [2021-06-05 12:11:58,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5004b559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:58, skipping insertion in model container [2021-06-05 12:11:58,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:11:58" (1/1) ... [2021-06-05 12:11:58,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 12:11:58,424 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 12:11:58,744 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41060,41073] [2021-06-05 12:11:58,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:11:58,770 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 12:11:58,790 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41060,41073] [2021-06-05 12:11:58,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:11:58,893 INFO L208 MainTranslator]: Completed translation [2021-06-05 12:11:58,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:58 WrapperNode [2021-06-05 12:11:58,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 12:11:58,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 12:11:58,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 12:11:58,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 12:11:58,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:58" (1/1) ... [2021-06-05 12:11:58,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:58" (1/1) ... [2021-06-05 12:11:58,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 12:11:58,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 12:11:58,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 12:11:58,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 12:11:58,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:58" (1/1) ... [2021-06-05 12:11:58,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:58" (1/1) ... [2021-06-05 12:11:58,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:58" (1/1) ... [2021-06-05 12:11:58,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:58" (1/1) ... [2021-06-05 12:11:58,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:58" (1/1) ... [2021-06-05 12:11:58,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:58" (1/1) ... [2021-06-05 12:11:58,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:58" (1/1) ... [2021-06-05 12:11:58,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 12:11:58,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 12:11:58,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 12:11:58,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 12:11:58,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 12:11:59,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 12:11:59,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 12:11:59,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 12:11:59,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 12:11:59,017 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-05 12:11:59,017 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-06-05 12:11:59,017 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-06-05 12:11:59,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 12:11:59,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 12:11:59,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 12:11:59,018 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 12:11:59,474 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 12:11:59,474 INFO L299 CfgBuilder]: Removed 49 assume(true) statements. [2021-06-05 12:11:59,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:11:59 BoogieIcfgContainer [2021-06-05 12:11:59,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 12:11:59,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 12:11:59,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 12:11:59,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 12:11:59,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 12:11:58" (1/3) ... [2021-06-05 12:11:59,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc47caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:11:59, skipping insertion in model container [2021-06-05 12:11:59,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:11:58" (2/3) ... [2021-06-05 12:11:59,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc47caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:11:59, skipping insertion in model container [2021-06-05 12:11:59,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:11:59" (3/3) ... [2021-06-05 12:11:59,479 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2021-06-05 12:11:59,482 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 12:11:59,482 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 12:11:59,483 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-06-05 12:11:59,483 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 12:11:59,506 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,507 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,507 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,507 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,507 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,507 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,508 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,508 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,508 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,508 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,508 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,508 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,508 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,508 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,508 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,509 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,509 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,510 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,511 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,511 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,512 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,512 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,512 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,512 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,512 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,512 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,513 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,514 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,514 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,515 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,515 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,515 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,515 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,515 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,516 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,516 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,516 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,517 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,519 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,519 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,519 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,519 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,519 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,519 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,519 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,519 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,520 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,520 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,521 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,521 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,521 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,522 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,522 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,526 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,526 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,526 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,526 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,526 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,526 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,526 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,526 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,527 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,527 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,527 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,527 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,527 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,527 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,527 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,527 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,527 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,528 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,528 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,528 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,528 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,528 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,528 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,528 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,528 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,528 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,528 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,529 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,529 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,529 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,530 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,530 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,530 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,536 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,536 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,536 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,536 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,536 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,536 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,537 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,537 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,537 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,537 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,537 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,537 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,537 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,537 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,537 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,538 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,538 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,538 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,538 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,538 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,538 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,538 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,538 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,538 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,538 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,539 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,539 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,539 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,539 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,539 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,539 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,539 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,539 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,539 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,540 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,540 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,540 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,540 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,540 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,542 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,542 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,542 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,542 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,542 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,542 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,543 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,543 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,543 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,543 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,543 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,543 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,543 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,543 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,543 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,544 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,544 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,544 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,544 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,544 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,544 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,544 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:11:59,548 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-06-05 12:11:59,561 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 12:11:59,572 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:11:59,572 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:11:59,572 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:11:59,572 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:11:59,572 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:11:59,572 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:11:59,572 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:11:59,573 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 12:11:59,580 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 197 places, 239 transitions, 486 flow [2021-06-05 12:11:59,737 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6129 states, 6116 states have (on average 2.461576193590582) internal successors, (15055), 6128 states have internal predecessors, (15055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:11:59,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 6129 states, 6116 states have (on average 2.461576193590582) internal successors, (15055), 6128 states have internal predecessors, (15055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:11:59,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-06-05 12:11:59,755 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:11:59,755 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:11:59,755 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:11:59,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:11:59,759 INFO L82 PathProgramCache]: Analyzing trace with hash -991470691, now seen corresponding path program 1 times [2021-06-05 12:11:59,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:11:59,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168372336] [2021-06-05 12:11:59,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:11:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:11:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:11:59,860 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:11:59,860 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168372336] [2021-06-05 12:11:59,860 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168372336] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:11:59,860 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:11:59,861 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:11:59,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999186620] [2021-06-05 12:11:59,863 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:11:59,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:11:59,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:11:59,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:11:59,881 INFO L87 Difference]: Start difference. First operand has 6129 states, 6116 states have (on average 2.461576193590582) internal successors, (15055), 6128 states have internal predecessors, (15055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:11:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:11:59,921 INFO L93 Difference]: Finished difference Result 5910 states and 11907 transitions. [2021-06-05 12:11:59,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:11:59,921 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-06-05 12:11:59,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:11:59,945 INFO L225 Difference]: With dead ends: 5910 [2021-06-05 12:11:59,945 INFO L226 Difference]: Without dead ends: 5747 [2021-06-05 12:11:59,946 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:11:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5747 states. [2021-06-05 12:12:00,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5747 to 5747. [2021-06-05 12:12:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5747 states, 5738 states have (on average 2.0243987452073893) internal successors, (11616), 5746 states have internal predecessors, (11616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5747 states to 5747 states and 11616 transitions. [2021-06-05 12:12:00,122 INFO L78 Accepts]: Start accepts. Automaton has 5747 states and 11616 transitions. Word has length 38 [2021-06-05 12:12:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:00,122 INFO L482 AbstractCegarLoop]: Abstraction has 5747 states and 11616 transitions. [2021-06-05 12:12:00,123 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 5747 states and 11616 transitions. [2021-06-05 12:12:00,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-06-05 12:12:00,128 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:00,128 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:00,128 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 12:12:00,128 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:12:00,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:00,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1878579578, now seen corresponding path program 1 times [2021-06-05 12:12:00,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:00,131 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736473609] [2021-06-05 12:12:00,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:00,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:12:00,192 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:00,192 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736473609] [2021-06-05 12:12:00,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736473609] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:12:00,192 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:12:00,192 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:12:00,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766678192] [2021-06-05 12:12:00,193 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:12:00,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:00,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:12:00,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:12:00,194 INFO L87 Difference]: Start difference. First operand 5747 states and 11616 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:00,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:00,227 INFO L93 Difference]: Finished difference Result 5751 states and 11620 transitions. [2021-06-05 12:12:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:12:00,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-06-05 12:12:00,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:00,243 INFO L225 Difference]: With dead ends: 5751 [2021-06-05 12:12:00,243 INFO L226 Difference]: Without dead ends: 5751 [2021-06-05 12:12:00,243 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:12:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5751 states. [2021-06-05 12:12:00,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5751 to 5748. [2021-06-05 12:12:00,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5748 states, 5739 states have (on average 2.0242202474298656) internal successors, (11617), 5747 states have internal predecessors, (11617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5748 states to 5748 states and 11617 transitions. [2021-06-05 12:12:00,390 INFO L78 Accepts]: Start accepts. Automaton has 5748 states and 11617 transitions. Word has length 38 [2021-06-05 12:12:00,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:00,391 INFO L482 AbstractCegarLoop]: Abstraction has 5748 states and 11617 transitions. [2021-06-05 12:12:00,391 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 5748 states and 11617 transitions. [2021-06-05 12:12:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 12:12:00,393 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:00,393 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:00,394 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 12:12:00,394 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:12:00,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:00,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1104180221, now seen corresponding path program 1 times [2021-06-05 12:12:00,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:00,395 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797539266] [2021-06-05 12:12:00,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:12:00,453 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:00,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797539266] [2021-06-05 12:12:00,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797539266] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:00,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50488148] [2021-06-05 12:12:00,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:00,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:12:00,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:00,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:12:00,657 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50488148] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:12:00,657 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:12:00,658 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:12:00,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652740115] [2021-06-05 12:12:00,658 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:12:00,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:00,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:12:00,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:12:00,659 INFO L87 Difference]: Start difference. First operand 5748 states and 11617 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:00,701 INFO L93 Difference]: Finished difference Result 5686 states and 11553 transitions. [2021-06-05 12:12:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:12:00,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-06-05 12:12:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:00,729 INFO L225 Difference]: With dead ends: 5686 [2021-06-05 12:12:00,729 INFO L226 Difference]: Without dead ends: 5686 [2021-06-05 12:12:00,729 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.6ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:12:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5686 states. [2021-06-05 12:12:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5686 to 5686. [2021-06-05 12:12:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5686 states, 5679 states have (on average 2.034337031167459) internal successors, (11553), 5685 states have internal predecessors, (11553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5686 states to 5686 states and 11553 transitions. [2021-06-05 12:12:00,860 INFO L78 Accepts]: Start accepts. Automaton has 5686 states and 11553 transitions. Word has length 43 [2021-06-05 12:12:00,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:00,860 INFO L482 AbstractCegarLoop]: Abstraction has 5686 states and 11553 transitions. [2021-06-05 12:12:00,861 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5686 states and 11553 transitions. [2021-06-05 12:12:00,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-06-05 12:12:00,862 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:00,862 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:01,080 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-06-05 12:12:01,080 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:12:01,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:01,080 INFO L82 PathProgramCache]: Analyzing trace with hash -135502187, now seen corresponding path program 1 times [2021-06-05 12:12:01,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:01,081 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323796976] [2021-06-05 12:12:01,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:12:01,174 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:01,175 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323796976] [2021-06-05 12:12:01,175 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323796976] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:01,175 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450933610] [2021-06-05 12:12:01,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:01,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:12:01,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:12:01,321 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450933610] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:01,321 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:01,321 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:12:01,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063615289] [2021-06-05 12:12:01,322 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:12:01,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:01,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:12:01,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:12:01,323 INFO L87 Difference]: Start difference. First operand 5686 states and 11553 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:01,368 INFO L93 Difference]: Finished difference Result 5694 states and 11561 transitions. [2021-06-05 12:12:01,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:12:01,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-06-05 12:12:01,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:01,383 INFO L225 Difference]: With dead ends: 5694 [2021-06-05 12:12:01,383 INFO L226 Difference]: Without dead ends: 5694 [2021-06-05 12:12:01,383 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 56.8ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:12:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5694 states. [2021-06-05 12:12:01,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5694 to 5691. [2021-06-05 12:12:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5691 states, 5684 states have (on average 2.033427163969036) internal successors, (11558), 5690 states have internal predecessors, (11558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5691 states to 5691 states and 11558 transitions. [2021-06-05 12:12:01,535 INFO L78 Accepts]: Start accepts. Automaton has 5691 states and 11558 transitions. Word has length 52 [2021-06-05 12:12:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:01,535 INFO L482 AbstractCegarLoop]: Abstraction has 5691 states and 11558 transitions. [2021-06-05 12:12:01,535 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 5691 states and 11558 transitions. [2021-06-05 12:12:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:12:01,536 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:01,536 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:01,752 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:01,752 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:12:01,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:01,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1052106712, now seen corresponding path program 2 times [2021-06-05 12:12:01,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:01,753 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138972949] [2021-06-05 12:12:01,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:12:01,828 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:01,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138972949] [2021-06-05 12:12:01,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138972949] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:01,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227134795] [2021-06-05 12:12:01,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:01,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:12:01,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:12:01,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:12:01,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:01,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:12:01,939 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:01,940 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:01,941 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:01,941 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:12:01,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:12:01,957 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:01,961 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:01,962 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:01,962 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:12:02,029 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:12:02,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:12:02,031 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:02,034 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:02,035 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:02,035 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:12:02,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:12:02,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:12:02,086 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:02,090 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:02,090 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:02,095 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:02,101 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:02,101 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:12:02,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:12:02,158 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:02,160 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:02,160 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:12:02,161 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:12:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:12:02,217 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227134795] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:12:02,217 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:12:02,217 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2021-06-05 12:12:02,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718516400] [2021-06-05 12:12:02,218 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:12:02,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:02,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:12:02,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:12:02,220 INFO L87 Difference]: Start difference. First operand 5691 states and 11558 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:03,257 INFO L93 Difference]: Finished difference Result 16353 states and 33228 transitions. [2021-06-05 12:12:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 12:12:03,257 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-06-05 12:12:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:03,280 INFO L225 Difference]: With dead ends: 16353 [2021-06-05 12:12:03,280 INFO L226 Difference]: Without dead ends: 16353 [2021-06-05 12:12:03,281 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 487.6ms TimeCoverageRelationStatistics Valid=389, Invalid=1503, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 12:12:03,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16353 states. [2021-06-05 12:12:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16353 to 8258. [2021-06-05 12:12:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8258 states, 8251 states have (on average 2.0456914313416554) internal successors, (16879), 8257 states have internal predecessors, (16879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 16879 transitions. [2021-06-05 12:12:03,460 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 16879 transitions. Word has length 57 [2021-06-05 12:12:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:03,461 INFO L482 AbstractCegarLoop]: Abstraction has 8258 states and 16879 transitions. [2021-06-05 12:12:03,461 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 16879 transitions. [2021-06-05 12:12:03,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-06-05 12:12:03,462 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:03,462 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:03,681 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:03,683 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:12:03,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:03,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1264627357, now seen corresponding path program 1 times [2021-06-05 12:12:03,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:03,684 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264219771] [2021-06-05 12:12:03,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:03,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:12:03,723 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:03,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264219771] [2021-06-05 12:12:03,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264219771] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:03,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75827011] [2021-06-05 12:12:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:03,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:12:03,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:12:03,852 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75827011] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:12:03,852 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:12:03,852 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:12:03,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722564811] [2021-06-05 12:12:03,853 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:12:03,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:03,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:12:03,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:12:03,853 INFO L87 Difference]: Start difference. First operand 8258 states and 16879 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:03,883 INFO L93 Difference]: Finished difference Result 11548 states and 23646 transitions. [2021-06-05 12:12:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:12:03,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-06-05 12:12:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:03,897 INFO L225 Difference]: With dead ends: 11548 [2021-06-05 12:12:03,897 INFO L226 Difference]: Without dead ends: 11548 [2021-06-05 12:12:03,897 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:12:03,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11548 states. [2021-06-05 12:12:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11548 to 8335. [2021-06-05 12:12:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8335 states, 8328 states have (on average 2.0456292026897214) internal successors, (17036), 8334 states have internal predecessors, (17036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8335 states to 8335 states and 17036 transitions. [2021-06-05 12:12:04,055 INFO L78 Accepts]: Start accepts. Automaton has 8335 states and 17036 transitions. Word has length 58 [2021-06-05 12:12:04,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:04,056 INFO L482 AbstractCegarLoop]: Abstraction has 8335 states and 17036 transitions. [2021-06-05 12:12:04,056 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 8335 states and 17036 transitions. [2021-06-05 12:12:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:12:04,057 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:04,057 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:04,272 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:04,275 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:12:04,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:04,275 INFO L82 PathProgramCache]: Analyzing trace with hash -73283195, now seen corresponding path program 1 times [2021-06-05 12:12:04,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:04,276 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998299572] [2021-06-05 12:12:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:12:04,338 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:04,338 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998299572] [2021-06-05 12:12:04,338 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998299572] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:04,338 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408984036] [2021-06-05 12:12:04,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:04,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:12:04,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:12:04,542 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408984036] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:04,542 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:04,542 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2021-06-05 12:12:04,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129429625] [2021-06-05 12:12:04,543 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 12:12:04,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:04,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 12:12:04,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 12:12:04,543 INFO L87 Difference]: Start difference. First operand 8335 states and 17036 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:04,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:04,625 INFO L93 Difference]: Finished difference Result 905 states and 1707 transitions. [2021-06-05 12:12:04,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 12:12:04,626 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:12:04,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:04,627 INFO L225 Difference]: With dead ends: 905 [2021-06-05 12:12:04,627 INFO L226 Difference]: Without dead ends: 887 [2021-06-05 12:12:04,627 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 68.0ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:12:04,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-06-05 12:12:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 884. [2021-06-05 12:12:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 1.8856172140430352) internal successors, (1665), 883 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1665 transitions. [2021-06-05 12:12:04,637 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1665 transitions. Word has length 61 [2021-06-05 12:12:04,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:04,637 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 1665 transitions. [2021-06-05 12:12:04,637 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1665 transitions. [2021-06-05 12:12:04,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 12:12:04,638 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:04,638 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:04,855 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-06-05 12:12:04,856 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:12:04,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:04,856 INFO L82 PathProgramCache]: Analyzing trace with hash 573298185, now seen corresponding path program 1 times [2021-06-05 12:12:04,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:04,856 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227807864] [2021-06-05 12:12:04,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:12:04,916 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:04,916 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227807864] [2021-06-05 12:12:04,916 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227807864] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:04,916 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099329673] [2021-06-05 12:12:04,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:04,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:12:05,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:05,083 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:12:05,083 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099329673] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:05,083 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:05,084 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:12:05,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764393902] [2021-06-05 12:12:05,084 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:12:05,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:05,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:12:05,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:12:05,085 INFO L87 Difference]: Start difference. First operand 884 states and 1665 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:05,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:05,144 INFO L93 Difference]: Finished difference Result 892 states and 1673 transitions. [2021-06-05 12:12:05,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:12:05,145 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-06-05 12:12:05,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:05,146 INFO L225 Difference]: With dead ends: 892 [2021-06-05 12:12:05,146 INFO L226 Difference]: Without dead ends: 892 [2021-06-05 12:12:05,146 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 66.0ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:12:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2021-06-05 12:12:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 889. [2021-06-05 12:12:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 1.8806306306306306) internal successors, (1670), 888 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1670 transitions. [2021-06-05 12:12:05,155 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1670 transitions. Word has length 71 [2021-06-05 12:12:05,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:05,155 INFO L482 AbstractCegarLoop]: Abstraction has 889 states and 1670 transitions. [2021-06-05 12:12:05,155 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1670 transitions. [2021-06-05 12:12:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 12:12:05,156 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:05,156 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:05,368 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:05,371 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:12:05,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:05,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1972316186, now seen corresponding path program 2 times [2021-06-05 12:12:05,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:05,371 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472295829] [2021-06-05 12:12:05,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:12:05,452 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:05,452 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472295829] [2021-06-05 12:12:05,452 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472295829] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:05,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914198017] [2021-06-05 12:12:05,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:05,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:12:05,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:12:05,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:12:05,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:12:05,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914198017] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:05,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:05,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:12:05,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130096687] [2021-06-05 12:12:05,643 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:12:05,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:05,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:12:05,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:12:05,643 INFO L87 Difference]: Start difference. First operand 889 states and 1670 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:05,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:05,718 INFO L93 Difference]: Finished difference Result 897 states and 1678 transitions. [2021-06-05 12:12:05,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:12:05,719 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-05 12:12:05,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:05,720 INFO L225 Difference]: With dead ends: 897 [2021-06-05 12:12:05,720 INFO L226 Difference]: Without dead ends: 897 [2021-06-05 12:12:05,720 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 87.2ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:12:05,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-06-05 12:12:05,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 894. [2021-06-05 12:12:05,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.8756998880179172) internal successors, (1675), 893 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:05,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1675 transitions. [2021-06-05 12:12:05,728 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1675 transitions. Word has length 76 [2021-06-05 12:12:05,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:05,729 INFO L482 AbstractCegarLoop]: Abstraction has 894 states and 1675 transitions. [2021-06-05 12:12:05,729 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:05,729 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1675 transitions. [2021-06-05 12:12:05,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-05 12:12:05,730 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:05,730 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:05,944 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:05,945 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:12:05,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:05,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1287423959, now seen corresponding path program 3 times [2021-06-05 12:12:05,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:05,945 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103691122] [2021-06-05 12:12:05,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:12:06,024 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:06,024 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103691122] [2021-06-05 12:12:06,024 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103691122] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:06,024 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142369660] [2021-06-05 12:12:06,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:06,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:12:06,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:12:06,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 12:12:06,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:06,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:12:06,107 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:06,109 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:06,109 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:06,109 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:12:06,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:12:06,121 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:06,124 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:06,124 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:06,124 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:12:06,181 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:12:06,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:12:06,183 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:06,185 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:06,186 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:06,186 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:12:06,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:12:06,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:12:06,222 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:06,225 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:06,226 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:06,229 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:06,230 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:06,230 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:12:06,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:12:06,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:12:06,306 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:06,309 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:06,309 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:06,315 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:06,317 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:06,317 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:12:06,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:12:06,336 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:06,338 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:06,339 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:12:06,339 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:12:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-05 12:12:06,392 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142369660] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:06,392 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:06,393 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2021-06-05 12:12:06,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479000814] [2021-06-05 12:12:06,393 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 12:12:06,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:06,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 12:12:06,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2021-06-05 12:12:06,394 INFO L87 Difference]: Start difference. First operand 894 states and 1675 transitions. Second operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:06,976 INFO L93 Difference]: Finished difference Result 1674 states and 3169 transitions. [2021-06-05 12:12:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:12:06,976 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-06-05 12:12:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:06,978 INFO L225 Difference]: With dead ends: 1674 [2021-06-05 12:12:06,978 INFO L226 Difference]: Without dead ends: 1674 [2021-06-05 12:12:06,979 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 514.4ms TimeCoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 12:12:06,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2021-06-05 12:12:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 871. [2021-06-05 12:12:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 1.8781609195402298) internal successors, (1634), 870 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1634 transitions. [2021-06-05 12:12:06,991 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1634 transitions. Word has length 81 [2021-06-05 12:12:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:06,991 INFO L482 AbstractCegarLoop]: Abstraction has 871 states and 1634 transitions. [2021-06-05 12:12:06,991 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1634 transitions. [2021-06-05 12:12:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 12:12:06,993 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:06,993 INFO L521 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:07,209 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-06-05 12:12:07,209 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:12:07,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:07,209 INFO L82 PathProgramCache]: Analyzing trace with hash -701501752, now seen corresponding path program 1 times [2021-06-05 12:12:07,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:07,209 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064853669] [2021-06-05 12:12:07,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:12:07,310 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:07,310 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064853669] [2021-06-05 12:12:07,310 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064853669] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:07,310 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572991442] [2021-06-05 12:12:07,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:07,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:12:07,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:12:07,519 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572991442] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:07,519 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:07,519 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:12:07,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092342635] [2021-06-05 12:12:07,520 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:12:07,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:07,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:12:07,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:12:07,521 INFO L87 Difference]: Start difference. First operand 871 states and 1634 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:07,666 INFO L93 Difference]: Finished difference Result 879 states and 1642 transitions. [2021-06-05 12:12:07,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:12:07,666 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-06-05 12:12:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:07,667 INFO L225 Difference]: With dead ends: 879 [2021-06-05 12:12:07,667 INFO L226 Difference]: Without dead ends: 879 [2021-06-05 12:12:07,667 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 151.6ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:12:07,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2021-06-05 12:12:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 876. [2021-06-05 12:12:07,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 875 states have (on average 1.8731428571428572) internal successors, (1639), 875 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:07,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1639 transitions. [2021-06-05 12:12:07,676 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1639 transitions. Word has length 111 [2021-06-05 12:12:07,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:07,676 INFO L482 AbstractCegarLoop]: Abstraction has 876 states and 1639 transitions. [2021-06-05 12:12:07,676 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:07,676 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1639 transitions. [2021-06-05 12:12:07,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-06-05 12:12:07,677 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:07,677 INFO L521 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:07,884 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:07,885 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:12:07,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:07,885 INFO L82 PathProgramCache]: Analyzing trace with hash -605745243, now seen corresponding path program 2 times [2021-06-05 12:12:07,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:07,885 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563921710] [2021-06-05 12:12:07,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:12:08,021 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:08,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563921710] [2021-06-05 12:12:08,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563921710] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:08,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508989973] [2021-06-05 12:12:08,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:08,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:12:08,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:12:08,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:12:08,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:08,250 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:12:08,250 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508989973] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:08,256 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:08,256 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:12:08,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180064315] [2021-06-05 12:12:08,257 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:12:08,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:08,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:12:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:12:08,258 INFO L87 Difference]: Start difference. First operand 876 states and 1639 transitions. Second operand has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:08,408 INFO L93 Difference]: Finished difference Result 884 states and 1647 transitions. [2021-06-05 12:12:08,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:12:08,409 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-06-05 12:12:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:08,410 INFO L225 Difference]: With dead ends: 884 [2021-06-05 12:12:08,410 INFO L226 Difference]: Without dead ends: 884 [2021-06-05 12:12:08,410 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 193.8ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:12:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-06-05 12:12:08,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 881. [2021-06-05 12:12:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 1.8681818181818182) internal successors, (1644), 880 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:08,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1644 transitions. [2021-06-05 12:12:08,419 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1644 transitions. Word has length 116 [2021-06-05 12:12:08,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:08,419 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 1644 transitions. [2021-06-05 12:12:08,419 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:08,419 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1644 transitions. [2021-06-05 12:12:08,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-06-05 12:12:08,421 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:08,421 INFO L521 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:08,637 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:08,637 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:12:08,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:08,637 INFO L82 PathProgramCache]: Analyzing trace with hash 864219368, now seen corresponding path program 3 times [2021-06-05 12:12:08,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:08,637 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547339638] [2021-06-05 12:12:08,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:12:08,763 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:08,764 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547339638] [2021-06-05 12:12:08,764 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547339638] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:08,764 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891465850] [2021-06-05 12:12:08,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:08,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:12:08,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:12:08,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 12:12:08,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:08,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:12:08,852 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:08,853 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:08,854 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:08,854 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:12:08,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:12:08,868 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:08,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:08,871 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:08,871 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:12:08,959 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:12:08,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:12:08,962 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:08,965 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:08,965 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:08,965 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:12:08,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:12:09,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:12:09,001 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:09,004 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:09,005 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:09,009 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:09,010 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:09,010 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:12:09,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2021-06-05 12:12:09,105 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:09,108 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:09,109 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:09,109 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:18 [2021-06-05 12:12:09,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2021-06-05 12:12:09,178 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:09,179 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:09,180 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:12:09,180 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2021-06-05 12:12:09,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:12:09,244 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:09,245 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:09,246 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:12:09,246 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:12:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-06-05 12:12:09,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891465850] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:09,310 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:09,310 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2021-06-05 12:12:09,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718762467] [2021-06-05 12:12:09,311 INFO L462 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-06-05 12:12:09,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:09,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-06-05 12:12:09,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 12:12:09,312 INFO L87 Difference]: Start difference. First operand 881 states and 1644 transitions. Second operand has 35 states, 35 states have (on average 5.285714285714286) internal successors, (185), 35 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:10,914 INFO L93 Difference]: Finished difference Result 1884 states and 3499 transitions. [2021-06-05 12:12:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-06-05 12:12:10,915 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.285714285714286) internal successors, (185), 35 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-06-05 12:12:10,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:10,916 INFO L225 Difference]: With dead ends: 1884 [2021-06-05 12:12:10,916 INFO L226 Difference]: Without dead ends: 1590 [2021-06-05 12:12:10,918 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2426 ImplicationChecksByTransitivity, 1365.3ms TimeCoverageRelationStatistics Valid=1233, Invalid=7887, Unknown=0, NotChecked=0, Total=9120 [2021-06-05 12:12:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2021-06-05 12:12:10,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 885. [2021-06-05 12:12:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.8484162895927603) internal successors, (1634), 884 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1634 transitions. [2021-06-05 12:12:10,928 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1634 transitions. Word has length 121 [2021-06-05 12:12:10,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:10,929 INFO L482 AbstractCegarLoop]: Abstraction has 885 states and 1634 transitions. [2021-06-05 12:12:10,929 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 5.285714285714286) internal successors, (185), 35 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1634 transitions. [2021-06-05 12:12:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-06-05 12:12:10,930 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:10,930 INFO L521 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:11,146 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-06-05 12:12:11,146 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:12:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:11,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1436041409, now seen corresponding path program 1 times [2021-06-05 12:12:11,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:11,147 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371723088] [2021-06-05 12:12:11,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:12:11,303 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:11,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371723088] [2021-06-05 12:12:11,303 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371723088] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:11,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355571000] [2021-06-05 12:12:11,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:11,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:12:11,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:12:11,522 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355571000] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:11,522 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:11,522 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:12:11,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722599720] [2021-06-05 12:12:11,522 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:12:11,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:11,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:12:11,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:12:11,523 INFO L87 Difference]: Start difference. First operand 885 states and 1634 transitions. Second operand has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:11,728 INFO L93 Difference]: Finished difference Result 890 states and 1639 transitions. [2021-06-05 12:12:11,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:12:11,728 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2021-06-05 12:12:11,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:11,729 INFO L225 Difference]: With dead ends: 890 [2021-06-05 12:12:11,729 INFO L226 Difference]: Without dead ends: 890 [2021-06-05 12:12:11,729 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 272.8ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:12:11,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2021-06-05 12:12:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2021-06-05 12:12:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 1.843644544431946) internal successors, (1639), 889 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1639 transitions. [2021-06-05 12:12:11,737 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1639 transitions. Word has length 135 [2021-06-05 12:12:11,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:11,738 INFO L482 AbstractCegarLoop]: Abstraction has 890 states and 1639 transitions. [2021-06-05 12:12:11,738 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1639 transitions. [2021-06-05 12:12:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-06-05 12:12:11,741 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:11,741 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:11,957 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-06-05 12:12:11,957 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:12:11,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:11,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1215256860, now seen corresponding path program 2 times [2021-06-05 12:12:11,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:11,958 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340890608] [2021-06-05 12:12:11,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:12:12,352 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:12,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340890608] [2021-06-05 12:12:12,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340890608] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:12,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466204832] [2021-06-05 12:12:12,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:12,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:12:12,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:12:12,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 12:12:12,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:12,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:12:12,457 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:12,458 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:12,458 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:12,458 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:12:12,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:12:12,463 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:12,466 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:12,466 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:12,466 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:12:12,544 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:12:12,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:12:12,546 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:12,548 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:12,548 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:12,549 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:12:12,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:12:12,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:12:12,564 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:12,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:12,567 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:12,571 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:12,572 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:12,572 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:12:12,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2021-06-05 12:12:12,663 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:12,675 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:12,675 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:12,676 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:22 [2021-06-05 12:12:12,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2021-06-05 12:12:12,751 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:12,754 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:12,754 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:12:12,754 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:17 [2021-06-05 12:12:12,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:12:12,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:12:12,786 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:12,789 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:12,789 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:12,793 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:12,794 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:12,794 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:12:12,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:12:12,878 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:12,879 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:12,879 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:12:12,879 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:12:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:12:12,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466204832] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:12,932 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:12,932 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2021-06-05 12:12:12,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745883011] [2021-06-05 12:12:12,932 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 12:12:12,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:12,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 12:12:12,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2021-06-05 12:12:12,933 INFO L87 Difference]: Start difference. First operand 890 states and 1639 transitions. Second operand has 30 states, 30 states have (on average 5.066666666666666) internal successors, (152), 30 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:14,033 INFO L93 Difference]: Finished difference Result 1875 states and 3534 transitions. [2021-06-05 12:12:14,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 12:12:14,034 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.066666666666666) internal successors, (152), 30 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2021-06-05 12:12:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:14,034 INFO L225 Difference]: With dead ends: 1875 [2021-06-05 12:12:14,034 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 12:12:14,035 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 129 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 1151.8ms TimeCoverageRelationStatistics Valid=785, Invalid=3121, Unknown=0, NotChecked=0, Total=3906 [2021-06-05 12:12:14,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 12:12:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 12:12:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 12:12:14,035 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 140 [2021-06-05 12:12:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:14,035 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 12:12:14,035 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.066666666666666) internal successors, (152), 30 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 12:12:14,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 12:12:14,244 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 12:12:14,245 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 12:12:14,246 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 12:12:14,247 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:12:14,247 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:12:14,247 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:12:14,247 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:12:14,247 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:12:14,247 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:12:14,247 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:12:14,247 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 12:12:14,249 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 197 places, 239 transitions, 486 flow [2021-06-05 12:12:14,328 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6129 states, 6116 states have (on average 2.461576193590582) internal successors, (15055), 6128 states have internal predecessors, (15055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 6129 states, 6116 states have (on average 2.461576193590582) internal successors, (15055), 6128 states have internal predecessors, (15055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 12:12:14,333 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:14,333 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:14,333 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:12:14,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:14,334 INFO L82 PathProgramCache]: Analyzing trace with hash 528355733, now seen corresponding path program 1 times [2021-06-05 12:12:14,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:14,334 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094783152] [2021-06-05 12:12:14,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:14,342 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:14,342 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094783152] [2021-06-05 12:12:14,342 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094783152] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:12:14,342 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:12:14,342 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:12:14,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341153030] [2021-06-05 12:12:14,343 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:12:14,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:14,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:12:14,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:12:14,350 INFO L87 Difference]: Start difference. First operand has 6129 states, 6116 states have (on average 2.461576193590582) internal successors, (15055), 6128 states have internal predecessors, (15055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:14,365 INFO L93 Difference]: Finished difference Result 5910 states and 11907 transitions. [2021-06-05 12:12:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:12:14,365 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 12:12:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:14,366 INFO L225 Difference]: With dead ends: 5910 [2021-06-05 12:12:14,366 INFO L226 Difference]: Without dead ends: 614 [2021-06-05 12:12:14,366 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:12:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-06-05 12:12:14,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2021-06-05 12:12:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 612 states have (on average 1.8888888888888888) internal successors, (1156), 613 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1156 transitions. [2021-06-05 12:12:14,374 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1156 transitions. Word has length 37 [2021-06-05 12:12:14,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:14,374 INFO L482 AbstractCegarLoop]: Abstraction has 614 states and 1156 transitions. [2021-06-05 12:12:14,374 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,374 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1156 transitions. [2021-06-05 12:12:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 12:12:14,374 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:14,374 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:14,375 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 12:12:14,375 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:12:14,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:14,375 INFO L82 PathProgramCache]: Analyzing trace with hash -316116138, now seen corresponding path program 1 times [2021-06-05 12:12:14,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:14,375 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390858333] [2021-06-05 12:12:14,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:14,385 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:14,385 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390858333] [2021-06-05 12:12:14,385 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390858333] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:12:14,385 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:12:14,385 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:12:14,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508948629] [2021-06-05 12:12:14,385 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:12:14,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:14,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:12:14,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:12:14,386 INFO L87 Difference]: Start difference. First operand 614 states and 1156 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:14,393 INFO L93 Difference]: Finished difference Result 618 states and 1160 transitions. [2021-06-05 12:12:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:12:14,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 12:12:14,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:14,394 INFO L225 Difference]: With dead ends: 618 [2021-06-05 12:12:14,394 INFO L226 Difference]: Without dead ends: 618 [2021-06-05 12:12:14,394 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:12:14,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2021-06-05 12:12:14,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2021-06-05 12:12:14,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 613 states have (on average 1.8874388254486134) internal successors, (1157), 614 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1157 transitions. [2021-06-05 12:12:14,400 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 1157 transitions. Word has length 37 [2021-06-05 12:12:14,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:14,400 INFO L482 AbstractCegarLoop]: Abstraction has 615 states and 1157 transitions. [2021-06-05 12:12:14,400 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1157 transitions. [2021-06-05 12:12:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:12:14,400 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:14,400 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:14,400 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 12:12:14,400 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:12:14,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:14,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1182923891, now seen corresponding path program 1 times [2021-06-05 12:12:14,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:14,402 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973562235] [2021-06-05 12:12:14,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:14,419 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:14,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973562235] [2021-06-05 12:12:14,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973562235] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:14,420 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056132928] [2021-06-05 12:12:14,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:14,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:12:14,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:14,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:14,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056132928] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:14,530 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:14,530 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:12:14,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313321636] [2021-06-05 12:12:14,530 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:12:14,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:14,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:12:14,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:12:14,531 INFO L87 Difference]: Start difference. First operand 615 states and 1157 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:14,558 INFO L93 Difference]: Finished difference Result 623 states and 1165 transitions. [2021-06-05 12:12:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:12:14,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-06-05 12:12:14,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:14,559 INFO L225 Difference]: With dead ends: 623 [2021-06-05 12:12:14,559 INFO L226 Difference]: Without dead ends: 623 [2021-06-05 12:12:14,559 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 18.2ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:12:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2021-06-05 12:12:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 620. [2021-06-05 12:12:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 618 states have (on average 1.8802588996763754) internal successors, (1162), 619 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1162 transitions. [2021-06-05 12:12:14,565 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1162 transitions. Word has length 42 [2021-06-05 12:12:14,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:14,565 INFO L482 AbstractCegarLoop]: Abstraction has 620 states and 1162 transitions. [2021-06-05 12:12:14,565 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,565 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1162 transitions. [2021-06-05 12:12:14,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 12:12:14,566 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:14,566 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:14,780 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:14,781 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:12:14,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:14,781 INFO L82 PathProgramCache]: Analyzing trace with hash -701325962, now seen corresponding path program 2 times [2021-06-05 12:12:14,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:14,781 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578986949] [2021-06-05 12:12:14,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:14,809 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:14,809 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578986949] [2021-06-05 12:12:14,809 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578986949] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:14,809 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674940864] [2021-06-05 12:12:14,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:14,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:12:14,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:12:14,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:12:14,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:14,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674940864] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:14,924 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:14,924 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:12:14,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982101141] [2021-06-05 12:12:14,924 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:12:14,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:14,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:12:14,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:12:14,925 INFO L87 Difference]: Start difference. First operand 620 states and 1162 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:14,962 INFO L93 Difference]: Finished difference Result 628 states and 1170 transitions. [2021-06-05 12:12:14,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:12:14,962 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-06-05 12:12:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:14,963 INFO L225 Difference]: With dead ends: 628 [2021-06-05 12:12:14,963 INFO L226 Difference]: Without dead ends: 628 [2021-06-05 12:12:14,963 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 36.4ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:12:14,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2021-06-05 12:12:14,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 625. [2021-06-05 12:12:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 623 states have (on average 1.8731942215088282) internal successors, (1167), 624 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1167 transitions. [2021-06-05 12:12:14,969 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1167 transitions. Word has length 47 [2021-06-05 12:12:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:14,969 INFO L482 AbstractCegarLoop]: Abstraction has 625 states and 1167 transitions. [2021-06-05 12:12:14,969 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:14,969 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1167 transitions. [2021-06-05 12:12:14,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-06-05 12:12:14,969 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:14,969 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:15,176 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:15,177 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:12:15,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:15,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1440556627, now seen corresponding path program 3 times [2021-06-05 12:12:15,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:15,177 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663463010] [2021-06-05 12:12:15,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:15,212 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:15,212 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663463010] [2021-06-05 12:12:15,212 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663463010] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:15,212 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304776583] [2021-06-05 12:12:15,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:15,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 12:12:15,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:12:15,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:12:15,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:15,332 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304776583] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:15,332 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:15,332 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:12:15,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33496501] [2021-06-05 12:12:15,332 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:12:15,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:15,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:12:15,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:12:15,333 INFO L87 Difference]: Start difference. First operand 625 states and 1167 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:15,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:15,385 INFO L93 Difference]: Finished difference Result 633 states and 1175 transitions. [2021-06-05 12:12:15,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:12:15,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-06-05 12:12:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:15,386 INFO L225 Difference]: With dead ends: 633 [2021-06-05 12:12:15,386 INFO L226 Difference]: Without dead ends: 633 [2021-06-05 12:12:15,386 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 56.9ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:12:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2021-06-05 12:12:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2021-06-05 12:12:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 628 states have (on average 1.8662420382165605) internal successors, (1172), 629 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1172 transitions. [2021-06-05 12:12:15,398 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1172 transitions. Word has length 52 [2021-06-05 12:12:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:15,398 INFO L482 AbstractCegarLoop]: Abstraction has 630 states and 1172 transitions. [2021-06-05 12:12:15,398 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:15,399 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1172 transitions. [2021-06-05 12:12:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:12:15,399 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:15,399 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:15,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:15,608 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:12:15,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:15,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1666801770, now seen corresponding path program 4 times [2021-06-05 12:12:15,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:15,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880750252] [2021-06-05 12:12:15,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:15,654 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:15,654 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880750252] [2021-06-05 12:12:15,655 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880750252] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:15,655 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542025084] [2021-06-05 12:12:15,655 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:15,714 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 12:12:15,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:12:15,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:12:15,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:15,775 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542025084] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:15,775 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:15,775 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:12:15,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341282987] [2021-06-05 12:12:15,775 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:12:15,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:15,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:12:15,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:12:15,775 INFO L87 Difference]: Start difference. First operand 630 states and 1172 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:15,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:15,849 INFO L93 Difference]: Finished difference Result 638 states and 1180 transitions. [2021-06-05 12:12:15,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:12:15,850 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-06-05 12:12:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:15,850 INFO L225 Difference]: With dead ends: 638 [2021-06-05 12:12:15,850 INFO L226 Difference]: Without dead ends: 638 [2021-06-05 12:12:15,851 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 76.6ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:12:15,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-06-05 12:12:15,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 635. [2021-06-05 12:12:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 633 states have (on average 1.8593996840442337) internal successors, (1177), 634 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1177 transitions. [2021-06-05 12:12:15,858 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1177 transitions. Word has length 57 [2021-06-05 12:12:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:15,858 INFO L482 AbstractCegarLoop]: Abstraction has 635 states and 1177 transitions. [2021-06-05 12:12:15,858 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1177 transitions. [2021-06-05 12:12:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 12:12:15,859 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:15,859 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:16,075 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-06-05 12:12:16,075 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:12:16,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:16,075 INFO L82 PathProgramCache]: Analyzing trace with hash 406157363, now seen corresponding path program 5 times [2021-06-05 12:12:16,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:16,075 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038477105] [2021-06-05 12:12:16,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:16,134 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:16,134 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038477105] [2021-06-05 12:12:16,134 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038477105] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:16,134 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770512694] [2021-06-05 12:12:16,134 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:16,195 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-06-05 12:12:16,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:12:16,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 12:12:16,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:16,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770512694] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:16,269 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:16,269 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2021-06-05 12:12:16,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184839349] [2021-06-05 12:12:16,270 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 12:12:16,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:16,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 12:12:16,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 12:12:16,271 INFO L87 Difference]: Start difference. First operand 635 states and 1177 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:16,362 INFO L93 Difference]: Finished difference Result 643 states and 1185 transitions. [2021-06-05 12:12:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 12:12:16,363 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 12:12:16,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:16,363 INFO L225 Difference]: With dead ends: 643 [2021-06-05 12:12:16,363 INFO L226 Difference]: Without dead ends: 643 [2021-06-05 12:12:16,364 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 111.0ms TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2021-06-05 12:12:16,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-06-05 12:12:16,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 640. [2021-06-05 12:12:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 638 states have (on average 1.8526645768025078) internal successors, (1182), 639 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1182 transitions. [2021-06-05 12:12:16,370 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1182 transitions. Word has length 62 [2021-06-05 12:12:16,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:16,370 INFO L482 AbstractCegarLoop]: Abstraction has 640 states and 1182 transitions. [2021-06-05 12:12:16,370 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:16,370 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1182 transitions. [2021-06-05 12:12:16,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-05 12:12:16,370 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:16,370 INFO L521 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:16,586 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-06-05 12:12:16,586 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:12:16,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:16,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1209432502, now seen corresponding path program 6 times [2021-06-05 12:12:16,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:16,587 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500450779] [2021-06-05 12:12:16,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:16,660 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:16,660 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:16,660 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500450779] [2021-06-05 12:12:16,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500450779] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:16,660 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551581073] [2021-06-05 12:12:16,660 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:16,728 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-06-05 12:12:16,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:12:16,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:12:16,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:16,838 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551581073] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:16,838 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:16,838 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:12:16,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201991731] [2021-06-05 12:12:16,838 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:12:16,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:16,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:12:16,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:12:16,839 INFO L87 Difference]: Start difference. First operand 640 states and 1182 transitions. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:16,952 INFO L93 Difference]: Finished difference Result 648 states and 1190 transitions. [2021-06-05 12:12:16,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:12:16,953 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-06-05 12:12:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:16,953 INFO L225 Difference]: With dead ends: 648 [2021-06-05 12:12:16,954 INFO L226 Difference]: Without dead ends: 648 [2021-06-05 12:12:16,954 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 153.7ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:12:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2021-06-05 12:12:16,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 645. [2021-06-05 12:12:16,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 643 states have (on average 1.8460342146189737) internal successors, (1187), 644 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1187 transitions. [2021-06-05 12:12:16,960 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1187 transitions. Word has length 67 [2021-06-05 12:12:16,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:16,960 INFO L482 AbstractCegarLoop]: Abstraction has 645 states and 1187 transitions. [2021-06-05 12:12:16,960 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1187 transitions. [2021-06-05 12:12:16,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 12:12:16,960 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:16,960 INFO L521 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:17,177 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-06-05 12:12:17,177 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:12:17,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1899557395, now seen corresponding path program 7 times [2021-06-05 12:12:17,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:17,178 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889110762] [2021-06-05 12:12:17,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:17,272 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:17,272 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889110762] [2021-06-05 12:12:17,272 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889110762] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:17,272 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758501501] [2021-06-05 12:12:17,272 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:17,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:12:17,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:17,412 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758501501] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:17,412 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:17,412 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:12:17,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709334343] [2021-06-05 12:12:17,413 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:12:17,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:17,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:12:17,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:12:17,413 INFO L87 Difference]: Start difference. First operand 645 states and 1187 transitions. Second operand has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:17,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:17,554 INFO L93 Difference]: Finished difference Result 653 states and 1195 transitions. [2021-06-05 12:12:17,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:12:17,554 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 12:12:17,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:17,555 INFO L225 Difference]: With dead ends: 653 [2021-06-05 12:12:17,555 INFO L226 Difference]: Without dead ends: 653 [2021-06-05 12:12:17,556 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 176.5ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:12:17,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2021-06-05 12:12:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 650. [2021-06-05 12:12:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 648 states have (on average 1.8395061728395061) internal successors, (1192), 649 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1192 transitions. [2021-06-05 12:12:17,562 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1192 transitions. Word has length 72 [2021-06-05 12:12:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:17,562 INFO L482 AbstractCegarLoop]: Abstraction has 650 states and 1192 transitions. [2021-06-05 12:12:17,562 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1192 transitions. [2021-06-05 12:12:17,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 12:12:17,563 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:17,563 INFO L521 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:17,776 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-06-05 12:12:17,777 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:12:17,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:17,777 INFO L82 PathProgramCache]: Analyzing trace with hash 294923222, now seen corresponding path program 8 times [2021-06-05 12:12:17,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:17,777 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811342334] [2021-06-05 12:12:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:17,881 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:17,881 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811342334] [2021-06-05 12:12:17,881 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811342334] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:17,881 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185617311] [2021-06-05 12:12:17,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:17,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:12:17,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:12:17,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 12:12:17,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:18,036 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:18,036 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185617311] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:18,036 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:18,036 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2021-06-05 12:12:18,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137977576] [2021-06-05 12:12:18,036 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 12:12:18,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:18,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 12:12:18,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:12:18,037 INFO L87 Difference]: Start difference. First operand 650 states and 1192 transitions. Second operand has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:18,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:18,227 INFO L93 Difference]: Finished difference Result 658 states and 1200 transitions. [2021-06-05 12:12:18,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 12:12:18,228 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-06-05 12:12:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:18,229 INFO L225 Difference]: With dead ends: 658 [2021-06-05 12:12:18,229 INFO L226 Difference]: Without dead ends: 658 [2021-06-05 12:12:18,229 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 220.0ms TimeCoverageRelationStatistics Valid=427, Invalid=905, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 12:12:18,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2021-06-05 12:12:18,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 655. [2021-06-05 12:12:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 653 states have (on average 1.8330781010719754) internal successors, (1197), 654 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1197 transitions. [2021-06-05 12:12:18,235 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1197 transitions. Word has length 77 [2021-06-05 12:12:18,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:18,235 INFO L482 AbstractCegarLoop]: Abstraction has 655 states and 1197 transitions. [2021-06-05 12:12:18,235 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1197 transitions. [2021-06-05 12:12:18,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 12:12:18,235 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:18,235 INFO L521 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:18,448 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-06-05 12:12:18,449 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:12:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:18,449 INFO L82 PathProgramCache]: Analyzing trace with hash 51745779, now seen corresponding path program 9 times [2021-06-05 12:12:18,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:18,449 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575942215] [2021-06-05 12:12:18,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:18,572 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:18,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575942215] [2021-06-05 12:12:18,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575942215] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:18,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138630085] [2021-06-05 12:12:18,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:18,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-06-05 12:12:18,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:12:18,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:12:18,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:12:18,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138630085] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:18,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:18,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:12:18,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330210390] [2021-06-05 12:12:18,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:12:18,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:18,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:12:18,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:12:18,779 INFO L87 Difference]: Start difference. First operand 655 states and 1197 transitions. Second operand has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:19,020 INFO L93 Difference]: Finished difference Result 660 states and 1202 transitions. [2021-06-05 12:12:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:12:19,020 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 12:12:19,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:19,021 INFO L225 Difference]: With dead ends: 660 [2021-06-05 12:12:19,021 INFO L226 Difference]: Without dead ends: 660 [2021-06-05 12:12:19,022 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 294.5ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:12:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-06-05 12:12:19,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2021-06-05 12:12:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 658 states have (on average 1.8267477203647415) internal successors, (1202), 659 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:19,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1202 transitions. [2021-06-05 12:12:19,032 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1202 transitions. Word has length 82 [2021-06-05 12:12:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:19,032 INFO L482 AbstractCegarLoop]: Abstraction has 660 states and 1202 transitions. [2021-06-05 12:12:19,032 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:19,033 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1202 transitions. [2021-06-05 12:12:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 12:12:19,033 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:19,033 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:19,248 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:12:19,249 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:12:19,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:19,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2085505546, now seen corresponding path program 10 times [2021-06-05 12:12:19,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:19,249 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311671493] [2021-06-05 12:12:19,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 12:12:19,261 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 12:12:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 12:12:19,272 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 12:12:19,288 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 12:12:19,288 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 12:12:19,288 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 12:12:19,288 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 12:12:19,289 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 12:12:19,289 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 12:12:19,305 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,305 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,306 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,307 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,308 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,309 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,309 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,309 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,309 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,309 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,309 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,309 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,309 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,309 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,309 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,309 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,309 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,310 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,311 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,312 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,313 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,314 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,314 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,314 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,314 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,314 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,314 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,314 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,314 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,314 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,314 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,314 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,314 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,314 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,314 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,314 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,315 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,316 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,317 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,318 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,318 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,318 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,318 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,318 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,318 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,318 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,318 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,318 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,319 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,320 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,321 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,322 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,323 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,323 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,323 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,323 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,323 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,323 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,323 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,323 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,323 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,323 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,323 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,323 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,323 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,323 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,324 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,325 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,326 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,327 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,327 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,327 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:12:19,329 INFO L149 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-06-05 12:12:19,329 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-05 12:12:19,330 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:12:19,330 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:12:19,330 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:12:19,330 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:12:19,330 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:12:19,330 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:12:19,330 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:12:19,330 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 12:12:19,332 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 253 places, 308 transitions, 634 flow [2021-06-05 12:13:51,684 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 330669 states, 330638 states have (on average 3.6981774629655395) internal successors, (1222758), 330668 states have internal predecessors, (1222758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:13:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 330669 states, 330638 states have (on average 3.6981774629655395) internal successors, (1222758), 330668 states have internal predecessors, (1222758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:13:52,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-06-05 12:13:52,008 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:13:52,009 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:13:52,009 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:13:52,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:13:52,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1275221789, now seen corresponding path program 1 times [2021-06-05 12:13:52,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:13:52,010 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729345899] [2021-06-05 12:13:52,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:13:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:13:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:13:52,038 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:13:52,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729345899] [2021-06-05 12:13:52,038 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729345899] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:13:52,038 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:13:52,038 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:13:52,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695262307] [2021-06-05 12:13:52,038 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:13:52,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:13:52,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:13:52,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:13:52,392 INFO L87 Difference]: Start difference. First operand has 330669 states, 330638 states have (on average 3.6981774629655395) internal successors, (1222758), 330668 states have internal predecessors, (1222758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:13:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:13:54,862 INFO L93 Difference]: Finished difference Result 312939 states and 949441 transitions. [2021-06-05 12:13:54,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:13:54,863 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-06-05 12:13:54,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:13:55,607 INFO L225 Difference]: With dead ends: 312939 [2021-06-05 12:13:55,607 INFO L226 Difference]: Without dead ends: 312371 [2021-06-05 12:13:55,607 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:14:11,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312371 states. [2021-06-05 12:14:15,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312371 to 312371. [2021-06-05 12:14:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312371 states, 312346 states have (on average 3.0349612288935988) internal successors, (947958), 312370 states have internal predecessors, (947958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312371 states to 312371 states and 947958 transitions. [2021-06-05 12:14:17,712 INFO L78 Accepts]: Start accepts. Automaton has 312371 states and 947958 transitions. Word has length 38 [2021-06-05 12:14:17,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:14:17,713 INFO L482 AbstractCegarLoop]: Abstraction has 312371 states and 947958 transitions. [2021-06-05 12:14:17,713 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:17,713 INFO L276 IsEmpty]: Start isEmpty. Operand 312371 states and 947958 transitions. [2021-06-05 12:14:17,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-06-05 12:14:17,713 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:14:17,713 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:14:17,713 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 12:14:17,713 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:14:17,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:14:17,714 INFO L82 PathProgramCache]: Analyzing trace with hash -149695238, now seen corresponding path program 1 times [2021-06-05 12:14:17,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:14:17,714 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459984145] [2021-06-05 12:14:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:14:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:14:17,731 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:14:17,731 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459984145] [2021-06-05 12:14:17,731 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459984145] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:14:17,731 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:14:17,731 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:14:17,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254960514] [2021-06-05 12:14:17,732 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:14:17,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:14:17,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:14:17,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:14:17,732 INFO L87 Difference]: Start difference. First operand 312371 states and 947958 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:14:18,983 INFO L93 Difference]: Finished difference Result 312375 states and 947962 transitions. [2021-06-05 12:14:18,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:14:18,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-06-05 12:14:18,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:14:19,514 INFO L225 Difference]: With dead ends: 312375 [2021-06-05 12:14:19,514 INFO L226 Difference]: Without dead ends: 312375 [2021-06-05 12:14:19,514 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:14:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312375 states. [2021-06-05 12:14:39,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312375 to 312372. [2021-06-05 12:14:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312372 states, 312347 states have (on average 3.03495471382789) internal successors, (947959), 312371 states have internal predecessors, (947959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312372 states to 312372 states and 947959 transitions. [2021-06-05 12:14:41,303 INFO L78 Accepts]: Start accepts. Automaton has 312372 states and 947959 transitions. Word has length 38 [2021-06-05 12:14:41,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:14:41,303 INFO L482 AbstractCegarLoop]: Abstraction has 312372 states and 947959 transitions. [2021-06-05 12:14:41,303 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 312372 states and 947959 transitions. [2021-06-05 12:14:41,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 12:14:41,304 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:14:41,304 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:14:41,304 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 12:14:41,304 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:14:41,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:14:41,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1464573105, now seen corresponding path program 1 times [2021-06-05 12:14:41,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:14:41,304 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244844328] [2021-06-05 12:14:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:14:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:14:41,343 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:14:41,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244844328] [2021-06-05 12:14:41,343 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244844328] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:41,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902205857] [2021-06-05 12:14:41,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:14:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:41,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:14:41,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:14:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:14:41,451 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902205857] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:14:41,451 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:14:41,451 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:14:41,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840212085] [2021-06-05 12:14:41,452 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:14:41,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:14:41,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:14:41,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:14:41,452 INFO L87 Difference]: Start difference. First operand 312372 states and 947959 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:42,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:14:42,871 INFO L93 Difference]: Finished difference Result 312310 states and 947895 transitions. [2021-06-05 12:14:42,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:14:42,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-06-05 12:14:42,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:14:43,455 INFO L225 Difference]: With dead ends: 312310 [2021-06-05 12:14:43,455 INFO L226 Difference]: Without dead ends: 312310 [2021-06-05 12:14:43,456 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:14:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312310 states. [2021-06-05 12:15:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312310 to 312310. [2021-06-05 12:15:04,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312310 states, 312287 states have (on average 3.03533288289298) internal successors, (947895), 312309 states have internal predecessors, (947895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:04,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312310 states to 312310 states and 947895 transitions. [2021-06-05 12:15:04,960 INFO L78 Accepts]: Start accepts. Automaton has 312310 states and 947895 transitions. Word has length 43 [2021-06-05 12:15:04,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:04,960 INFO L482 AbstractCegarLoop]: Abstraction has 312310 states and 947895 transitions. [2021-06-05 12:15:04,961 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 312310 states and 947895 transitions. [2021-06-05 12:15:04,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-06-05 12:15:04,963 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:04,963 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:05,175 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:05,176 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:05,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:05,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2021494696, now seen corresponding path program 1 times [2021-06-05 12:15:05,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:05,176 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958343492] [2021-06-05 12:15:05,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:15:05,206 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:05,206 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958343492] [2021-06-05 12:15:05,206 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958343492] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:05,206 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164624729] [2021-06-05 12:15:05,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:05,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:15:05,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:15:05,323 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164624729] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:05,323 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:05,324 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:15:05,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197715558] [2021-06-05 12:15:05,324 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:15:05,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:05,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:15:05,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:15:05,324 INFO L87 Difference]: Start difference. First operand 312310 states and 947895 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:07,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:07,172 INFO L93 Difference]: Finished difference Result 312318 states and 947903 transitions. [2021-06-05 12:15:07,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:15:07,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-06-05 12:15:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:08,172 INFO L225 Difference]: With dead ends: 312318 [2021-06-05 12:15:08,173 INFO L226 Difference]: Without dead ends: 312318 [2021-06-05 12:15:08,173 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 19.8ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:15:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312318 states. [2021-06-05 12:15:28,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312318 to 312315. [2021-06-05 12:15:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312315 states, 312292 states have (on average 3.0353002958769357) internal successors, (947900), 312314 states have internal predecessors, (947900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312315 states to 312315 states and 947900 transitions. [2021-06-05 12:15:30,577 INFO L78 Accepts]: Start accepts. Automaton has 312315 states and 947900 transitions. Word has length 52 [2021-06-05 12:15:30,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:30,577 INFO L482 AbstractCegarLoop]: Abstraction has 312315 states and 947900 transitions. [2021-06-05 12:15:30,577 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:30,577 INFO L276 IsEmpty]: Start isEmpty. Operand 312315 states and 947900 transitions. [2021-06-05 12:15:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:15:30,582 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:30,582 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:15:30,784 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:30,784 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:30,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:30,785 INFO L82 PathProgramCache]: Analyzing trace with hash -2031424561, now seen corresponding path program 2 times [2021-06-05 12:15:30,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:30,785 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354827535] [2021-06-05 12:15:30,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:30,812 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:15:30,812 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:30,812 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354827535] [2021-06-05 12:15:30,812 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354827535] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:30,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901805809] [2021-06-05 12:15:30,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:15:30,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:15:30,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:15:30,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:15:30,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:30,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:15:30,910 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:30,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:30,912 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:30,912 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:15:30,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:15:30,924 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:30,927 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:30,927 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:30,927 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:15:31,016 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:15:31,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:15:31,019 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:31,021 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:31,022 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:31,022 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:15:31,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:15:31,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:15:31,074 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:31,077 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:31,078 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:31,082 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:31,083 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:15:31,083 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:15:31,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:15:31,145 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:15:31,146 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:15:31,147 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:15:31,147 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:15:31,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:15:31,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901805809] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:15:31,183 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:15:31,183 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2021-06-05 12:15:31,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276149286] [2021-06-05 12:15:31,184 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:15:31,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:31,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:15:31,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:15:31,184 INFO L87 Difference]: Start difference. First operand 312315 states and 947900 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:38,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:38,177 INFO L93 Difference]: Finished difference Result 1061321 states and 3226995 transitions. [2021-06-05 12:15:38,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-05 12:15:38,177 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-06-05 12:15:38,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:41,049 INFO L225 Difference]: With dead ends: 1061321 [2021-06-05 12:15:41,050 INFO L226 Difference]: Without dead ends: 1061321 [2021-06-05 12:15:41,050 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 506.3ms TimeCoverageRelationStatistics Valid=480, Invalid=1872, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 12:16:08,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061321 states. [2021-06-05 12:16:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061321 to 467525. [2021-06-05 12:16:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467525 states, 467502 states have (on average 3.0607697934982094) internal successors, (1430916), 467524 states have internal predecessors, (1430916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:16:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467525 states to 467525 states and 1430916 transitions. [2021-06-05 12:16:20,327 INFO L78 Accepts]: Start accepts. Automaton has 467525 states and 1430916 transitions. Word has length 57 [2021-06-05 12:16:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:16:20,327 INFO L482 AbstractCegarLoop]: Abstraction has 467525 states and 1430916 transitions. [2021-06-05 12:16:20,327 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:16:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 467525 states and 1430916 transitions. [2021-06-05 12:16:20,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-06-05 12:16:20,330 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:16:20,330 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:16:20,548 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-06-05 12:16:20,549 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:16:20,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:16:20,549 INFO L82 PathProgramCache]: Analyzing trace with hash 164438714, now seen corresponding path program 1 times [2021-06-05 12:16:20,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:16:20,550 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699822119] [2021-06-05 12:16:20,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:16:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:16:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:16:20,568 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:16:20,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699822119] [2021-06-05 12:16:20,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699822119] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:16:20,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162432606] [2021-06-05 12:16:20,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:16:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:16:20,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:16:20,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:16:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:16:20,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162432606] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:16:20,702 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:16:20,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:16:20,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200039409] [2021-06-05 12:16:20,702 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:16:20,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:16:20,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:16:20,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:16:20,702 INFO L87 Difference]: Start difference. First operand 467525 states and 1430916 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:16:24,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:16:24,026 INFO L93 Difference]: Finished difference Result 660361 states and 2022284 transitions. [2021-06-05 12:16:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:16:24,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-06-05 12:16:24,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:16:26,038 INFO L225 Difference]: With dead ends: 660361 [2021-06-05 12:16:26,038 INFO L226 Difference]: Without dead ends: 660361 [2021-06-05 12:16:26,038 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:16:48,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660361 states. [2021-06-05 12:16:56,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660361 to 472201. [2021-06-05 12:16:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472201 states, 472178 states have (on average 3.0606614454718346) internal successors, (1445177), 472200 states have internal predecessors, (1445177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:16:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472201 states to 472201 states and 1445177 transitions. [2021-06-05 12:16:58,898 INFO L78 Accepts]: Start accepts. Automaton has 472201 states and 1445177 transitions. Word has length 58 [2021-06-05 12:16:58,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:16:58,898 INFO L482 AbstractCegarLoop]: Abstraction has 472201 states and 1445177 transitions. [2021-06-05 12:16:58,898 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:16:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 472201 states and 1445177 transitions. [2021-06-05 12:16:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:16:58,902 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:16:58,902 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:16:59,118 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:16:59,118 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:16:59,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:16:59,118 INFO L82 PathProgramCache]: Analyzing trace with hash -897405188, now seen corresponding path program 1 times [2021-06-05 12:16:59,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:16:59,119 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405306916] [2021-06-05 12:16:59,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:16:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:16:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:16:59,137 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:16:59,137 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405306916] [2021-06-05 12:16:59,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405306916] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:16:59,137 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724449845] [2021-06-05 12:16:59,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:16:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:16:59,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:16:59,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:16:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:16:59,274 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724449845] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:16:59,275 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:16:59,275 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2021-06-05 12:16:59,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686029249] [2021-06-05 12:16:59,275 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 12:16:59,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:16:59,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 12:16:59,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 12:16:59,275 INFO L87 Difference]: Start difference. First operand 472201 states and 1445177 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:01,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:17:01,271 INFO L93 Difference]: Finished difference Result 465500 states and 1431243 transitions. [2021-06-05 12:17:01,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 12:17:01,272 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:17:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:17:02,162 INFO L225 Difference]: With dead ends: 465500 [2021-06-05 12:17:02,163 INFO L226 Difference]: Without dead ends: 465500 [2021-06-05 12:17:02,163 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 56.2ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:17:20,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465500 states. [2021-06-05 12:17:26,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465500 to 465497. [2021-06-05 12:17:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465497 states, 465478 states have (on average 3.07477474767873) internal successors, (1431240), 465496 states have internal predecessors, (1431240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465497 states to 465497 states and 1431240 transitions. [2021-06-05 12:17:29,239 INFO L78 Accepts]: Start accepts. Automaton has 465497 states and 1431240 transitions. Word has length 61 [2021-06-05 12:17:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:17:29,240 INFO L482 AbstractCegarLoop]: Abstraction has 465497 states and 1431240 transitions. [2021-06-05 12:17:29,240 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 465497 states and 1431240 transitions. [2021-06-05 12:17:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 12:17:29,247 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:17:29,247 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:17:29,460 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-06-05 12:17:29,461 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:17:29,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:17:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2120878544, now seen corresponding path program 1 times [2021-06-05 12:17:29,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:17:29,461 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547207956] [2021-06-05 12:17:29,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:17:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:17:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:17:29,493 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:17:29,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547207956] [2021-06-05 12:17:29,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547207956] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:17:29,494 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043953420] [2021-06-05 12:17:29,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:17:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:17:29,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:17:29,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:17:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:17:29,643 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043953420] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:17:29,643 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:17:29,643 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:17:29,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583244261] [2021-06-05 12:17:29,643 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:17:29,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:17:29,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:17:29,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:17:29,643 INFO L87 Difference]: Start difference. First operand 465497 states and 1431240 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:32,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:17:32,202 INFO L93 Difference]: Finished difference Result 465505 states and 1431248 transitions. [2021-06-05 12:17:32,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:17:32,202 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-06-05 12:17:32,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:17:33,719 INFO L225 Difference]: With dead ends: 465505 [2021-06-05 12:17:33,719 INFO L226 Difference]: Without dead ends: 465505 [2021-06-05 12:17:33,719 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 56.2ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:17:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465505 states. [2021-06-05 12:17:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465505 to 465502. [2021-06-05 12:17:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465502 states, 465483 states have (on average 3.074752461421792) internal successors, (1431245), 465501 states have internal predecessors, (1431245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465502 states to 465502 states and 1431245 transitions. [2021-06-05 12:18:00,777 INFO L78 Accepts]: Start accepts. Automaton has 465502 states and 1431245 transitions. Word has length 71 [2021-06-05 12:18:00,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:18:00,777 INFO L482 AbstractCegarLoop]: Abstraction has 465502 states and 1431245 transitions. [2021-06-05 12:18:00,777 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 465502 states and 1431245 transitions. [2021-06-05 12:18:00,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 12:18:00,784 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:18:00,784 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:18:00,988 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:18:00,989 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:18:00,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:18:00,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1486339751, now seen corresponding path program 2 times [2021-06-05 12:18:00,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:18:00,989 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514335936] [2021-06-05 12:18:00,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:18:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:18:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:18:01,037 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:18:01,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514335936] [2021-06-05 12:18:01,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514335936] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:18:01,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615397716] [2021-06-05 12:18:01,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:18:01,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:18:01,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:18:01,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:18:01,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:18:01,888 WARN L205 SmtUtils]: Spent 715.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2021-06-05 12:18:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:18:01,928 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615397716] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:18:01,928 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:18:01,928 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:18:01,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528678375] [2021-06-05 12:18:01,928 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:18:01,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:18:01,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:18:01,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:18:01,928 INFO L87 Difference]: Start difference. First operand 465502 states and 1431245 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:18:03,987 INFO L93 Difference]: Finished difference Result 465510 states and 1431253 transitions. [2021-06-05 12:18:03,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:18:03,987 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-05 12:18:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:18:04,935 INFO L225 Difference]: With dead ends: 465510 [2021-06-05 12:18:04,935 INFO L226 Difference]: Without dead ends: 465510 [2021-06-05 12:18:04,935 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 82.9ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:18:23,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465510 states. [2021-06-05 12:18:29,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465510 to 465507. [2021-06-05 12:18:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465507 states, 465488 states have (on average 3.0747301756436256) internal successors, (1431250), 465506 states have internal predecessors, (1431250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465507 states to 465507 states and 1431250 transitions. [2021-06-05 12:18:31,552 INFO L78 Accepts]: Start accepts. Automaton has 465507 states and 1431250 transitions. Word has length 76 [2021-06-05 12:18:31,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:18:31,552 INFO L482 AbstractCegarLoop]: Abstraction has 465507 states and 1431250 transitions. [2021-06-05 12:18:31,552 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 465507 states and 1431250 transitions. [2021-06-05 12:18:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-05 12:18:31,559 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:18:31,559 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:18:31,759 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-06-05 12:18:31,759 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:18:31,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:18:31,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1773959216, now seen corresponding path program 3 times [2021-06-05 12:18:31,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:18:31,760 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043733222] [2021-06-05 12:18:31,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:18:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:18:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:18:31,816 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:18:31,816 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043733222] [2021-06-05 12:18:31,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043733222] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:18:31,817 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001125897] [2021-06-05 12:18:31,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:18:31,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:18:31,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:18:31,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 12:18:31,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:18:31,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:18:31,914 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:18:31,916 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:18:31,916 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:18:31,916 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:18:31,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:18:31,927 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:18:31,929 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:18:31,930 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:18:31,930 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:18:31,993 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:18:31,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:18:31,994 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:18:31,997 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:18:31,997 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:18:31,998 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:18:32,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:18:32,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:18:32,022 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:18:32,025 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:18:32,025 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:18:32,029 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:18:32,030 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:18:32,030 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:18:32,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:18:32,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:18:32,070 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:18:32,073 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:18:32,073 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:18:32,077 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:18:32,078 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:18:32,078 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:18:32,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:18:32,108 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:18:32,109 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:18:32,110 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:18:32,110 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:18:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-05 12:18:32,148 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001125897] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:18:32,148 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:18:32,148 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2021-06-05 12:18:32,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288265241] [2021-06-05 12:18:32,148 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 12:18:32,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:18:32,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 12:18:32,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2021-06-05 12:18:32,148 INFO L87 Difference]: Start difference. First operand 465507 states and 1431250 transitions. Second operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:40,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:18:40,350 INFO L93 Difference]: Finished difference Result 1182570 states and 3613741 transitions. [2021-06-05 12:18:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-06-05 12:18:40,350 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-06-05 12:18:40,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:18:43,711 INFO L225 Difference]: With dead ends: 1182570 [2021-06-05 12:18:43,711 INFO L226 Difference]: Without dead ends: 1182570 [2021-06-05 12:18:43,712 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 1412.5ms TimeCoverageRelationStatistics Valid=730, Invalid=3962, Unknown=0, NotChecked=0, Total=4692 [2021-06-05 12:19:15,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182570 states. [2021-06-05 12:19:25,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182570 to 459088. [2021-06-05 12:19:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459088 states, 459069 states have (on average 3.075117248169665) internal successors, (1411691), 459087 states have internal predecessors, (1411691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:27,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459088 states to 459088 states and 1411691 transitions. [2021-06-05 12:19:27,906 INFO L78 Accepts]: Start accepts. Automaton has 459088 states and 1411691 transitions. Word has length 81 [2021-06-05 12:19:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:27,907 INFO L482 AbstractCegarLoop]: Abstraction has 459088 states and 1411691 transitions. [2021-06-05 12:19:27,907 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 459088 states and 1411691 transitions. [2021-06-05 12:19:27,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 12:19:27,913 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:27,913 INFO L521 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:28,113 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:28,114 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:28,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:28,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1062688543, now seen corresponding path program 4 times [2021-06-05 12:19:28,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:28,114 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138750025] [2021-06-05 12:19:28,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:19:28,190 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:28,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138750025] [2021-06-05 12:19:28,190 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138750025] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:28,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690512568] [2021-06-05 12:19:28,190 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:28,253 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 12:19:28,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:28,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:19:28,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:19:28,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690512568] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:28,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:28,346 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:19:28,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515928122] [2021-06-05 12:19:28,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:19:28,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:28,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:19:28,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:19:28,347 INFO L87 Difference]: Start difference. First operand 459088 states and 1411691 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:30,412 INFO L93 Difference]: Finished difference Result 459096 states and 1411699 transitions. [2021-06-05 12:19:30,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:19:30,412 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 12:19:30,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:31,278 INFO L225 Difference]: With dead ends: 459096 [2021-06-05 12:19:31,278 INFO L226 Difference]: Without dead ends: 459096 [2021-06-05 12:19:31,278 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 149.2ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:19:49,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459096 states. [2021-06-05 12:19:55,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459096 to 459093. [2021-06-05 12:19:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459093 states, 459074 states have (on average 3.0750946470503666) internal successors, (1411696), 459092 states have internal predecessors, (1411696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:58,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459093 states to 459093 states and 1411696 transitions. [2021-06-05 12:19:58,847 INFO L78 Accepts]: Start accepts. Automaton has 459093 states and 1411696 transitions. Word has length 86 [2021-06-05 12:19:58,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:58,847 INFO L482 AbstractCegarLoop]: Abstraction has 459093 states and 1411696 transitions. [2021-06-05 12:19:58,847 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:58,847 INFO L276 IsEmpty]: Start isEmpty. Operand 459093 states and 1411696 transitions. [2021-06-05 12:19:58,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-05 12:19:58,857 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:58,857 INFO L521 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:59,073 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-06-05 12:19:59,073 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:59,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:59,073 INFO L82 PathProgramCache]: Analyzing trace with hash -655128936, now seen corresponding path program 5 times [2021-06-05 12:19:59,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:59,074 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915643387] [2021-06-05 12:19:59,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:19:59,200 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:59,200 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915643387] [2021-06-05 12:19:59,200 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915643387] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:59,201 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150789916] [2021-06-05 12:19:59,201 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:59,318 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-06-05 12:19:59,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:59,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:19:59,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:19:59,436 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150789916] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:59,436 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:59,436 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:19:59,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347006404] [2021-06-05 12:19:59,436 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:19:59,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:59,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:19:59,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:19:59,437 INFO L87 Difference]: Start difference. First operand 459093 states and 1411696 transitions. Second operand has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:02,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:02,111 INFO L93 Difference]: Finished difference Result 459101 states and 1411704 transitions. [2021-06-05 12:20:02,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:20:02,111 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-06-05 12:20:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:03,857 INFO L225 Difference]: With dead ends: 459101 [2021-06-05 12:20:03,857 INFO L226 Difference]: Without dead ends: 459101 [2021-06-05 12:20:03,858 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 225.4ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:20:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459101 states. [2021-06-05 12:20:28,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459101 to 459098. [2021-06-05 12:20:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459098 states, 459079 states have (on average 3.0750720464233825) internal successors, (1411701), 459097 states have internal predecessors, (1411701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:30,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459098 states to 459098 states and 1411701 transitions. [2021-06-05 12:20:30,899 INFO L78 Accepts]: Start accepts. Automaton has 459098 states and 1411701 transitions. Word has length 91 [2021-06-05 12:20:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:30,900 INFO L482 AbstractCegarLoop]: Abstraction has 459098 states and 1411701 transitions. [2021-06-05 12:20:30,900 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 459098 states and 1411701 transitions. [2021-06-05 12:20:30,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-06-05 12:20:30,906 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:30,906 INFO L521 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:20:31,112 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-06-05 12:20:31,113 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:31,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:31,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1238260927, now seen corresponding path program 6 times [2021-06-05 12:20:31,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:31,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387307849] [2021-06-05 12:20:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:20:31,230 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:31,230 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387307849] [2021-06-05 12:20:31,230 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387307849] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:31,230 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424403274] [2021-06-05 12:20:31,230 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:31,297 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 12:20:31,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:31,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 12:20:31,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:31,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:20:31,316 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:31,317 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:31,317 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:31,317 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:20:31,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:20:31,330 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:31,333 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:31,333 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:31,333 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:20:31,433 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:20:31,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:20:31,435 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:31,437 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:31,438 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:31,438 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:20:31,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:20:31,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:20:31,467 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:31,470 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:31,470 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:31,474 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:31,474 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:31,475 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:20:31,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:20:31,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:20:31,547 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:31,550 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:31,550 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:31,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:31,555 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:31,555 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:20:31,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:20:31,571 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:31,573 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:31,574 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:20:31,574 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:20:31,617 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-06-05 12:20:31,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424403274] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:31,617 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:20:31,617 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2021-06-05 12:20:31,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63480386] [2021-06-05 12:20:31,618 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 12:20:31,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:31,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 12:20:31,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2021-06-05 12:20:31,619 INFO L87 Difference]: Start difference. First operand 459098 states and 1411701 transitions. Second operand has 28 states, 28 states have (on average 4.964285714285714) internal successors, (139), 28 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:38,677 INFO L93 Difference]: Finished difference Result 947025 states and 2888972 transitions. [2021-06-05 12:20:38,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-06-05 12:20:38,678 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.964285714285714) internal successors, (139), 28 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-06-05 12:20:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:41,849 INFO L225 Difference]: With dead ends: 947025 [2021-06-05 12:20:41,849 INFO L226 Difference]: Without dead ends: 947025 [2021-06-05 12:20:41,850 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1337 ImplicationChecksByTransitivity, 966.5ms TimeCoverageRelationStatistics Valid=905, Invalid=4795, Unknown=0, NotChecked=0, Total=5700 [2021-06-05 12:21:09,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947025 states. [2021-06-05 12:21:17,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947025 to 420559. [2021-06-05 12:21:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420559 states, 420540 states have (on average 3.0624863271032483) internal successors, (1287898), 420558 states have internal predecessors, (1287898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420559 states to 420559 states and 1287898 transitions. [2021-06-05 12:21:20,082 INFO L78 Accepts]: Start accepts. Automaton has 420559 states and 1287898 transitions. Word has length 96 [2021-06-05 12:21:20,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:20,082 INFO L482 AbstractCegarLoop]: Abstraction has 420559 states and 1287898 transitions. [2021-06-05 12:21:20,082 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 4.964285714285714) internal successors, (139), 28 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 420559 states and 1287898 transitions. [2021-06-05 12:21:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-06-05 12:21:20,089 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:20,089 INFO L521 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:20,289 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-06-05 12:21:20,289 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:20,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:20,290 INFO L82 PathProgramCache]: Analyzing trace with hash 629210233, now seen corresponding path program 1 times [2021-06-05 12:21:20,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:20,290 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845448513] [2021-06-05 12:21:20,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:21:20,419 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:20,419 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845448513] [2021-06-05 12:21:20,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845448513] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:20,420 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268552743] [2021-06-05 12:21:20,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:20,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:21:20,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:21:20,612 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268552743] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:20,612 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:20,612 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:21:20,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475180102] [2021-06-05 12:21:20,612 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:21:20,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:20,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:21:20,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:21:20,613 INFO L87 Difference]: Start difference. First operand 420559 states and 1287898 transitions. Second operand has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:22,646 INFO L93 Difference]: Finished difference Result 420564 states and 1287903 transitions. [2021-06-05 12:21:22,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:21:22,647 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-06-05 12:21:22,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:23,433 INFO L225 Difference]: With dead ends: 420564 [2021-06-05 12:21:23,433 INFO L226 Difference]: Without dead ends: 420564 [2021-06-05 12:21:23,433 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 279.6ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:21:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420564 states. [2021-06-05 12:21:46,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420564 to 420564. [2021-06-05 12:21:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420564 states, 420545 states have (on average 3.062461805514273) internal successors, (1287903), 420563 states have internal predecessors, (1287903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420564 states to 420564 states and 1287903 transitions. [2021-06-05 12:21:49,186 INFO L78 Accepts]: Start accepts. Automaton has 420564 states and 1287903 transitions. Word has length 102 [2021-06-05 12:21:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:49,186 INFO L482 AbstractCegarLoop]: Abstraction has 420564 states and 1287903 transitions. [2021-06-05 12:21:49,187 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 420564 states and 1287903 transitions. [2021-06-05 12:21:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-06-05 12:21:49,194 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:49,194 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:21:49,394 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-06-05 12:21:49,394 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:49,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:49,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1210086352, now seen corresponding path program 2 times [2021-06-05 12:21:49,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:49,395 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370301521] [2021-06-05 12:21:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:21:49,472 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:49,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370301521] [2021-06-05 12:21:49,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370301521] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:49,472 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690240132] [2021-06-05 12:21:49,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:49,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:21:49,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:21:49,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 12:21:49,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:49,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:21:49,562 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:49,563 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:49,563 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:49,563 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:21:49,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:21:49,568 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:49,570 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:49,571 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:49,571 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:21:49,642 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:21:49,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:21:49,643 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:49,646 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:49,646 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:49,646 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:21:49,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:21:49,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:21:49,661 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:49,664 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:49,664 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:49,668 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:49,668 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:49,669 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:21:49,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:21:49,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:21:49,691 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:49,696 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:49,697 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:49,700 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:49,701 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:49,701 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:21:49,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:21:49,728 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:49,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:49,730 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:21:49,730 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:21:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:21:49,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690240132] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:49,755 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:21:49,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-06-05 12:21:49,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840248969] [2021-06-05 12:21:49,755 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 12:21:49,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:49,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 12:21:49,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-06-05 12:21:49,756 INFO L87 Difference]: Start difference. First operand 420564 states and 1287903 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:56,083 INFO L93 Difference]: Finished difference Result 1158112 states and 3524172 transitions. [2021-06-05 12:21:56,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-06-05 12:21:56,084 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-06-05 12:21:56,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:00,458 INFO L225 Difference]: With dead ends: 1158112 [2021-06-05 12:22:00,458 INFO L226 Difference]: Without dead ends: 1158112 [2021-06-05 12:22:00,459 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 407.6ms TimeCoverageRelationStatistics Valid=580, Invalid=1870, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 12:22:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158112 states. [2021-06-05 12:22:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158112 to 464639. [2021-06-05 12:22:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464639 states, 464620 states have (on average 3.055251603460893) internal successors, (1419531), 464638 states have internal predecessors, (1419531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464639 states to 464639 states and 1419531 transitions. [2021-06-05 12:22:43,023 INFO L78 Accepts]: Start accepts. Automaton has 464639 states and 1419531 transitions. Word has length 107 [2021-06-05 12:22:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:43,024 INFO L482 AbstractCegarLoop]: Abstraction has 464639 states and 1419531 transitions. [2021-06-05 12:22:43,024 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:43,024 INFO L276 IsEmpty]: Start isEmpty. Operand 464639 states and 1419531 transitions. [2021-06-05 12:22:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 12:22:43,036 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:43,037 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:22:43,238 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:43,238 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:43,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:43,238 INFO L82 PathProgramCache]: Analyzing trace with hash 98335517, now seen corresponding path program 1 times [2021-06-05 12:22:43,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:43,238 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325815512] [2021-06-05 12:22:43,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:22:43,266 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:43,267 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325815512] [2021-06-05 12:22:43,267 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325815512] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:43,267 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755581218] [2021-06-05 12:22:43,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:43,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:22:43,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:22:43,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755581218] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:43,482 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:22:43,482 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:22:43,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951149708] [2021-06-05 12:22:43,483 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:22:43,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:43,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:22:43,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:22:43,483 INFO L87 Difference]: Start difference. First operand 464639 states and 1419531 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:43,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:43,668 INFO L93 Difference]: Finished difference Result 51205 states and 149959 transitions. [2021-06-05 12:22:43,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:22:43,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-06-05 12:22:43,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:43,738 INFO L225 Difference]: With dead ends: 51205 [2021-06-05 12:22:43,738 INFO L226 Difference]: Without dead ends: 51151 [2021-06-05 12:22:43,738 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 42.4ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:22:44,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51151 states. [2021-06-05 12:22:45,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51151 to 51151. [2021-06-05 12:22:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51151 states, 51148 states have (on average 2.928169234378666) internal successors, (149770), 51150 states have internal predecessors, (149770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:45,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51151 states to 51151 states and 149770 transitions. [2021-06-05 12:22:45,346 INFO L78 Accepts]: Start accepts. Automaton has 51151 states and 149770 transitions. Word has length 111 [2021-06-05 12:22:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:45,347 INFO L482 AbstractCegarLoop]: Abstraction has 51151 states and 149770 transitions. [2021-06-05 12:22:45,347 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:45,347 INFO L276 IsEmpty]: Start isEmpty. Operand 51151 states and 149770 transitions. [2021-06-05 12:22:45,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-06-05 12:22:45,357 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:45,357 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:22:45,558 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-06-05 12:22:45,558 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:45,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:45,558 INFO L82 PathProgramCache]: Analyzing trace with hash 560466442, now seen corresponding path program 3 times [2021-06-05 12:22:45,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:45,558 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825978154] [2021-06-05 12:22:45,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2021-06-05 12:22:45,638 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:45,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825978154] [2021-06-05 12:22:45,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825978154] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:45,638 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470299516] [2021-06-05 12:22:45,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:45,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 12:22:45,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:22:45,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:22:45,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:45,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:22:45,964 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,965 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:45,965 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,966 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:22:45,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:22:45,970 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,973 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:45,973 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:45,973 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:22:46,046 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:22:46,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:22:46,047 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:46,050 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:46,050 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:46,050 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:22:46,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:22:46,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:22:46,065 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:46,068 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:46,068 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:46,072 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:46,073 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:46,073 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:22:46,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:22:46,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:22:46,093 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:46,096 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:46,096 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:46,100 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:46,101 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:46,101 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:22:46,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:22:46,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:22:46,160 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:46,163 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:46,163 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:46,167 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:46,168 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:46,168 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:22:46,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 12:22:46,183 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:46,184 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:46,185 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:22:46,185 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:22:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2021-06-05 12:22:46,220 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470299516] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:46,220 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:22:46,220 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-06-05 12:22:46,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678443865] [2021-06-05 12:22:46,220 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 12:22:46,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:46,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 12:22:46,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:22:46,221 INFO L87 Difference]: Start difference. First operand 51151 states and 149770 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:47,007 INFO L93 Difference]: Finished difference Result 119675 states and 351402 transitions. [2021-06-05 12:22:47,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 12:22:47,007 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-06-05 12:22:47,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:47,175 INFO L225 Difference]: With dead ends: 119675 [2021-06-05 12:22:47,175 INFO L226 Difference]: Without dead ends: 119675 [2021-06-05 12:22:47,176 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 243.5ms TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2021-06-05 12:22:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119675 states. [2021-06-05 12:22:49,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119675 to 50007. [2021-06-05 12:22:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50007 states, 50004 states have (on average 2.935365170786337) internal successors, (146780), 50006 states have internal predecessors, (146780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50007 states to 50007 states and 146780 transitions. [2021-06-05 12:22:49,299 INFO L78 Accepts]: Start accepts. Automaton has 50007 states and 146780 transitions. Word has length 116 [2021-06-05 12:22:49,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:49,299 INFO L482 AbstractCegarLoop]: Abstraction has 50007 states and 146780 transitions. [2021-06-05 12:22:49,299 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 50007 states and 146780 transitions. [2021-06-05 12:22:49,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-06-05 12:22:49,318 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:49,318 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:22:49,518 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-06-05 12:22:49,518 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:49,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:49,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1742007877, now seen corresponding path program 1 times [2021-06-05 12:22:49,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:49,519 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82500027] [2021-06-05 12:22:49,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:22:49,571 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:49,571 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82500027] [2021-06-05 12:22:49,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82500027] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:49,571 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:22:49,571 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 12:22:49,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582305263] [2021-06-05 12:22:49,571 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 12:22:49,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:49,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 12:22:49,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 12:22:49,572 INFO L87 Difference]: Start difference. First operand 50007 states and 146780 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:49,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:49,885 INFO L93 Difference]: Finished difference Result 76853 states and 223523 transitions. [2021-06-05 12:22:49,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 12:22:49,886 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2021-06-05 12:22:49,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:49,987 INFO L225 Difference]: With dead ends: 76853 [2021-06-05 12:22:49,987 INFO L226 Difference]: Without dead ends: 76853 [2021-06-05 12:22:49,987 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 61.0ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 12:22:50,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76853 states. [2021-06-05 12:22:51,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76853 to 63913. [2021-06-05 12:22:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63913 states, 63904 states have (on average 2.9374217576364545) internal successors, (187713), 63912 states have internal predecessors, (187713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63913 states to 63913 states and 187713 transitions. [2021-06-05 12:22:51,699 INFO L78 Accepts]: Start accepts. Automaton has 63913 states and 187713 transitions. Word has length 125 [2021-06-05 12:22:51,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:51,700 INFO L482 AbstractCegarLoop]: Abstraction has 63913 states and 187713 transitions. [2021-06-05 12:22:51,700 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 63913 states and 187713 transitions. [2021-06-05 12:22:51,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-06-05 12:22:51,720 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:51,720 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:22:51,720 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-05 12:22:51,720 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:51,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:51,720 INFO L82 PathProgramCache]: Analyzing trace with hash 162306879, now seen corresponding path program 2 times [2021-06-05 12:22:51,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:51,721 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233935955] [2021-06-05 12:22:51,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-06-05 12:22:51,767 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:51,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233935955] [2021-06-05 12:22:51,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233935955] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:51,767 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:22:51,767 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 12:22:51,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941086817] [2021-06-05 12:22:51,767 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:22:51,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:51,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:22:51,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:22:51,768 INFO L87 Difference]: Start difference. First operand 63913 states and 187713 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:52,361 INFO L93 Difference]: Finished difference Result 77597 states and 226113 transitions. [2021-06-05 12:22:52,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 12:22:52,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2021-06-05 12:22:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:52,466 INFO L225 Difference]: With dead ends: 77597 [2021-06-05 12:22:52,466 INFO L226 Difference]: Without dead ends: 77597 [2021-06-05 12:22:52,467 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 50.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:22:53,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77597 states. [2021-06-05 12:22:53,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77597 to 62023. [2021-06-05 12:22:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62023 states, 62014 states have (on average 2.922630373786564) internal successors, (181244), 62022 states have internal predecessors, (181244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62023 states to 62023 states and 181244 transitions. [2021-06-05 12:22:54,145 INFO L78 Accepts]: Start accepts. Automaton has 62023 states and 181244 transitions. Word has length 125 [2021-06-05 12:22:54,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:54,146 INFO L482 AbstractCegarLoop]: Abstraction has 62023 states and 181244 transitions. [2021-06-05 12:22:54,146 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:54,146 INFO L276 IsEmpty]: Start isEmpty. Operand 62023 states and 181244 transitions. [2021-06-05 12:22:54,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:22:54,166 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:54,166 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:22:54,166 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-05 12:22:54,166 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:54,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:54,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1627707313, now seen corresponding path program 1 times [2021-06-05 12:22:54,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:54,166 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896983575] [2021-06-05 12:22:54,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:22:54,394 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:54,394 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896983575] [2021-06-05 12:22:54,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896983575] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:54,395 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:22:54,395 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 12:22:54,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34979446] [2021-06-05 12:22:54,395 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 12:22:54,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:54,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 12:22:54,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 12:22:54,395 INFO L87 Difference]: Start difference. First operand 62023 states and 181244 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:55,321 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2021-06-05 12:22:56,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:56,069 INFO L93 Difference]: Finished difference Result 154594 states and 451678 transitions. [2021-06-05 12:22:56,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 12:22:56,070 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:22:56,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:56,291 INFO L225 Difference]: With dead ends: 154594 [2021-06-05 12:22:56,291 INFO L226 Difference]: Without dead ends: 154594 [2021-06-05 12:22:56,292 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 941.1ms TimeCoverageRelationStatistics Valid=249, Invalid=563, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:22:57,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154594 states. [2021-06-05 12:22:58,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154594 to 67106. [2021-06-05 12:22:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67106 states, 67097 states have (on average 2.9114565479827714) internal successors, (195350), 67105 states have internal predecessors, (195350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67106 states to 67106 states and 195350 transitions. [2021-06-05 12:22:58,859 INFO L78 Accepts]: Start accepts. Automaton has 67106 states and 195350 transitions. Word has length 128 [2021-06-05 12:22:58,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:58,859 INFO L482 AbstractCegarLoop]: Abstraction has 67106 states and 195350 transitions. [2021-06-05 12:22:58,859 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:58,859 INFO L276 IsEmpty]: Start isEmpty. Operand 67106 states and 195350 transitions. [2021-06-05 12:22:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:22:58,878 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:58,878 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:22:58,878 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-05 12:22:58,878 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:58,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:58,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1083291188, now seen corresponding path program 1 times [2021-06-05 12:22:58,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:58,879 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226733308] [2021-06-05 12:22:58,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:22:59,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:59,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226733308] [2021-06-05 12:22:59,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226733308] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:59,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779702341] [2021-06-05 12:22:59,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:59,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 12:22:59,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:59,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:22:59,553 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:59,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:59,555 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:59,555 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-06-05 12:22:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:22:59,590 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779702341] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:59,590 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:22:59,590 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2021-06-05 12:22:59,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548812309] [2021-06-05 12:22:59,590 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:22:59,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:59,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:22:59,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2021-06-05 12:22:59,591 INFO L87 Difference]: Start difference. First operand 67106 states and 195350 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:01,163 INFO L93 Difference]: Finished difference Result 220638 states and 644455 transitions. [2021-06-05 12:23:01,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 12:23:01,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:23:01,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:01,502 INFO L225 Difference]: With dead ends: 220638 [2021-06-05 12:23:01,503 INFO L226 Difference]: Without dead ends: 220638 [2021-06-05 12:23:01,503 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 753.8ms TimeCoverageRelationStatistics Valid=370, Invalid=2282, Unknown=0, NotChecked=0, Total=2652 [2021-06-05 12:23:03,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220638 states. [2021-06-05 12:23:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220638 to 67623. [2021-06-05 12:23:04,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67623 states, 67614 states have (on average 2.904280178661224) internal successors, (196370), 67622 states have internal predecessors, (196370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67623 states to 67623 states and 196370 transitions. [2021-06-05 12:23:04,654 INFO L78 Accepts]: Start accepts. Automaton has 67623 states and 196370 transitions. Word has length 128 [2021-06-05 12:23:04,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:04,654 INFO L482 AbstractCegarLoop]: Abstraction has 67623 states and 196370 transitions. [2021-06-05 12:23:04,654 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:04,655 INFO L276 IsEmpty]: Start isEmpty. Operand 67623 states and 196370 transitions. [2021-06-05 12:23:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:23:04,673 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:04,674 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:04,874 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-06-05 12:23:04,874 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:04,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:04,874 INFO L82 PathProgramCache]: Analyzing trace with hash -240814974, now seen corresponding path program 2 times [2021-06-05 12:23:04,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:04,874 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955054017] [2021-06-05 12:23:04,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:23:05,559 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:05,559 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955054017] [2021-06-05 12:23:05,559 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955054017] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:23:05,559 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321599479] [2021-06-05 12:23:05,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:23:05,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:23:05,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:23:05,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 12:23:05,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:23:05,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:23:05,677 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:05,678 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:05,678 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:05,678 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:23:05,701 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:23:05,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:23:05,703 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:05,704 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:05,704 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:05,704 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 12:23:05,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:23:05,916 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:05,919 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:05,919 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:05,919 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-05 12:23:05,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 12:23:05,950 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:05,954 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:05,954 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:23:05,954 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 12:23:05,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 12:23:06,000 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:23:06,004 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:23:06,006 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:23:06,006 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2021-06-05 12:23:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:23:06,060 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321599479] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:23:06,060 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:23:06,060 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19] total 30 [2021-06-05 12:23:06,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48319240] [2021-06-05 12:23:06,060 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:23:06,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:06,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:23:06,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=790, Unknown=0, NotChecked=0, Total=870 [2021-06-05 12:23:06,061 INFO L87 Difference]: Start difference. First operand 67623 states and 196370 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:09,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:09,080 INFO L93 Difference]: Finished difference Result 188870 states and 550488 transitions. [2021-06-05 12:23:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-06-05 12:23:09,080 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:23:09,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:09,350 INFO L225 Difference]: With dead ends: 188870 [2021-06-05 12:23:09,350 INFO L226 Difference]: Without dead ends: 188870 [2021-06-05 12:23:09,350 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 119 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1416 ImplicationChecksByTransitivity, 2585.6ms TimeCoverageRelationStatistics Valid=919, Invalid=4631, Unknown=0, NotChecked=0, Total=5550 [2021-06-05 12:23:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188870 states. [2021-06-05 12:23:11,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188870 to 67546. [2021-06-05 12:23:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67546 states, 67537 states have (on average 2.9052519359758353) internal successors, (196212), 67545 states have internal predecessors, (196212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67546 states to 67546 states and 196212 transitions. [2021-06-05 12:23:12,085 INFO L78 Accepts]: Start accepts. Automaton has 67546 states and 196212 transitions. Word has length 128 [2021-06-05 12:23:12,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:12,085 INFO L482 AbstractCegarLoop]: Abstraction has 67546 states and 196212 transitions. [2021-06-05 12:23:12,085 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:12,086 INFO L276 IsEmpty]: Start isEmpty. Operand 67546 states and 196212 transitions. [2021-06-05 12:23:12,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:23:12,105 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:12,105 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:12,305 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-06-05 12:23:12,305 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:12,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:12,306 INFO L82 PathProgramCache]: Analyzing trace with hash 664020872, now seen corresponding path program 3 times [2021-06-05 12:23:12,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:12,306 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071086514] [2021-06-05 12:23:12,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:23:12,501 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:12,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071086514] [2021-06-05 12:23:12,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071086514] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:23:12,501 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:23:12,501 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:23:12,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917832690] [2021-06-05 12:23:12,502 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:23:12,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:12,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:23:12,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:23:12,502 INFO L87 Difference]: Start difference. First operand 67546 states and 196212 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:14,152 INFO L93 Difference]: Finished difference Result 184063 states and 537186 transitions. [2021-06-05 12:23:14,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:23:14,153 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:23:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:14,443 INFO L225 Difference]: With dead ends: 184063 [2021-06-05 12:23:14,443 INFO L226 Difference]: Without dead ends: 184063 [2021-06-05 12:23:14,443 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 545.4ms TimeCoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2021-06-05 12:23:16,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184063 states. [2021-06-05 12:23:17,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184063 to 68426. [2021-06-05 12:23:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68426 states, 68417 states have (on average 2.9056228715085433) internal successors, (198794), 68425 states have internal predecessors, (198794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68426 states to 68426 states and 198794 transitions. [2021-06-05 12:23:17,659 INFO L78 Accepts]: Start accepts. Automaton has 68426 states and 198794 transitions. Word has length 128 [2021-06-05 12:23:17,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:17,659 INFO L482 AbstractCegarLoop]: Abstraction has 68426 states and 198794 transitions. [2021-06-05 12:23:17,659 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 68426 states and 198794 transitions. [2021-06-05 12:23:17,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:23:17,679 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:17,680 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:17,680 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-05 12:23:17,680 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:17,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:17,680 INFO L82 PathProgramCache]: Analyzing trace with hash -163943962, now seen corresponding path program 4 times [2021-06-05 12:23:17,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:17,680 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270114072] [2021-06-05 12:23:17,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:23:17,879 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:17,879 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270114072] [2021-06-05 12:23:17,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270114072] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:23:17,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:23:17,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:23:17,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208792565] [2021-06-05 12:23:17,879 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:23:17,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:17,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:23:17,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:23:17,880 INFO L87 Difference]: Start difference. First operand 68426 states and 198794 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:19,845 INFO L93 Difference]: Finished difference Result 177001 states and 515883 transitions. [2021-06-05 12:23:19,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 12:23:19,846 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:23:19,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:20,109 INFO L225 Difference]: With dead ends: 177001 [2021-06-05 12:23:20,109 INFO L226 Difference]: Without dead ends: 177001 [2021-06-05 12:23:20,109 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 864.6ms TimeCoverageRelationStatistics Valid=351, Invalid=839, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 12:23:21,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177001 states. [2021-06-05 12:23:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177001 to 68426. [2021-06-05 12:23:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68426 states, 68417 states have (on average 2.9056228715085433) internal successors, (198794), 68425 states have internal predecessors, (198794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68426 states to 68426 states and 198794 transitions. [2021-06-05 12:23:22,896 INFO L78 Accepts]: Start accepts. Automaton has 68426 states and 198794 transitions. Word has length 128 [2021-06-05 12:23:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:22,897 INFO L482 AbstractCegarLoop]: Abstraction has 68426 states and 198794 transitions. [2021-06-05 12:23:22,897 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 68426 states and 198794 transitions. [2021-06-05 12:23:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:23:22,916 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:22,917 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:22,917 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-05 12:23:22,917 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:22,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1142886158, now seen corresponding path program 5 times [2021-06-05 12:23:22,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:22,917 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234826975] [2021-06-05 12:23:22,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:23:23,127 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:23,127 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234826975] [2021-06-05 12:23:23,127 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234826975] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:23:23,127 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:23:23,127 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:23:23,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568815926] [2021-06-05 12:23:23,128 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:23:23,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:23,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:23:23,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:23:23,128 INFO L87 Difference]: Start difference. First operand 68426 states and 198794 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:24,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:24,463 INFO L93 Difference]: Finished difference Result 171138 states and 498365 transitions. [2021-06-05 12:23:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:23:24,463 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:23:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:24,699 INFO L225 Difference]: With dead ends: 171138 [2021-06-05 12:23:24,699 INFO L226 Difference]: Without dead ends: 171138 [2021-06-05 12:23:24,699 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 355.5ms TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2021-06-05 12:23:26,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171138 states. [2021-06-05 12:23:27,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171138 to 69438. [2021-06-05 12:23:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69438 states, 69429 states have (on average 2.9063071627129875) internal successors, (201782), 69437 states have internal predecessors, (201782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69438 states to 69438 states and 201782 transitions. [2021-06-05 12:23:27,514 INFO L78 Accepts]: Start accepts. Automaton has 69438 states and 201782 transitions. Word has length 128 [2021-06-05 12:23:27,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:27,514 INFO L482 AbstractCegarLoop]: Abstraction has 69438 states and 201782 transitions. [2021-06-05 12:23:27,514 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 69438 states and 201782 transitions. [2021-06-05 12:23:27,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:23:27,536 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:27,536 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:27,536 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-05 12:23:27,536 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:27,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:27,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1517149226, now seen corresponding path program 6 times [2021-06-05 12:23:27,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:27,537 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431694905] [2021-06-05 12:23:27,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:23:27,748 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:27,748 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431694905] [2021-06-05 12:23:27,748 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431694905] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:23:27,748 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:23:27,748 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:23:27,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976228690] [2021-06-05 12:23:27,748 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:23:27,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:27,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:23:27,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:23:27,749 INFO L87 Difference]: Start difference. First operand 69438 states and 201782 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:29,354 INFO L93 Difference]: Finished difference Result 189288 states and 551748 transitions. [2021-06-05 12:23:29,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:23:29,354 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:23:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:29,613 INFO L225 Difference]: With dead ends: 189288 [2021-06-05 12:23:29,613 INFO L226 Difference]: Without dead ends: 189288 [2021-06-05 12:23:29,613 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 493.7ms TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2021-06-05 12:23:31,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189288 states. [2021-06-05 12:23:32,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189288 to 69460. [2021-06-05 12:23:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69460 states, 69451 states have (on average 2.906308044520597) internal successors, (201846), 69459 states have internal predecessors, (201846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69460 states to 69460 states and 201846 transitions. [2021-06-05 12:23:32,366 INFO L78 Accepts]: Start accepts. Automaton has 69460 states and 201846 transitions. Word has length 128 [2021-06-05 12:23:32,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:23:32,366 INFO L482 AbstractCegarLoop]: Abstraction has 69460 states and 201846 transitions. [2021-06-05 12:23:32,366 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 69460 states and 201846 transitions. [2021-06-05 12:23:32,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:23:32,386 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:23:32,387 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:23:32,387 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-06-05 12:23:32,387 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:23:32,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:23:32,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1632103338, now seen corresponding path program 7 times [2021-06-05 12:23:32,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:23:32,387 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971002675] [2021-06-05 12:23:32,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:23:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:23:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:23:32,597 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:23:32,597 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971002675] [2021-06-05 12:23:32,597 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971002675] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:23:32,597 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:23:32,597 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:23:32,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035949577] [2021-06-05 12:23:32,597 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:23:32,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:23:32,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:23:32,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:23:32,598 INFO L87 Difference]: Start difference. First operand 69460 states and 201846 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:23:34,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:23:34,270 INFO L93 Difference]: Finished difference Result 168531 states and 490561 transitions. [2021-06-05 12:23:34,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 12:23:34,270 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:23:34,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:23:34,498 INFO L225 Difference]: With dead ends: 168531 [2021-06-05 12:23:34,498 INFO L226 Difference]: Without dead ends: 168531 [2021-06-05 12:23:34,499 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 721.4ms TimeCoverageRelationStatistics Valid=293, Invalid=699, Unknown=0, NotChecked=0, Total=992 Received shutdown request... [2021-06-05 12:23:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168531 states. [2021-06-05 12:23:35,881 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-06-05 12:23:35,881 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 12:23:35,881 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (1/2) [2021-06-05 12:23:35,881 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 12:23:35,882 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:23:35,882 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:23:35,882 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:23:35,882 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:23:35,882 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:23:35,882 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:23:35,882 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:23:35,882 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 12:23:35,883 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 253 places, 308 transitions, 634 flow [2021-06-05 12:23:35,884 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 12:23:35,884 INFO L315 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2021-06-05 12:23:35,884 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2021-06-05 12:23:35,885 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 12:23:35,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 12:23:35 BasicIcfg [2021-06-05 12:23:35,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 12:23:35,886 INFO L168 Benchmark]: Toolchain (without parser) took 697509.75 ms. Allocated memory was 331.4 MB in the beginning and 16.0 GB in the end (delta: 15.7 GB). Free memory was 293.4 MB in the beginning and 12.3 GB in the end (delta: -12.0 GB). Peak memory consumption was 3.7 GB. Max. memory is 16.0 GB. [2021-06-05 12:23:35,886 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 331.4 MB. Free memory was 311.8 MB in the beginning and 311.7 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 12:23:35,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 515.48 ms. Allocated memory is still 331.4 MB. Free memory was 293.2 MB in the beginning and 268.5 MB in the end (delta: 24.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 16.0 GB. [2021-06-05 12:23:35,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.94 ms. Allocated memory is still 331.4 MB. Free memory was 268.5 MB in the beginning and 265.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:23:35,886 INFO L168 Benchmark]: Boogie Preprocessor took 21.11 ms. Allocated memory is still 331.4 MB. Free memory was 265.4 MB in the beginning and 263.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:23:35,886 INFO L168 Benchmark]: RCFGBuilder took 498.35 ms. Allocated memory is still 331.4 MB. Free memory was 263.3 MB in the beginning and 219.1 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.0 GB. [2021-06-05 12:23:35,886 INFO L168 Benchmark]: TraceAbstraction took 696409.61 ms. Allocated memory was 331.4 MB in the beginning and 16.0 GB in the end (delta: 15.7 GB). Free memory was 218.1 MB in the beginning and 12.3 GB in the end (delta: -12.1 GB). Peak memory consumption was 3.6 GB. Max. memory is 16.0 GB. [2021-06-05 12:23:35,886 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 331.4 MB. Free memory was 311.8 MB in the beginning and 311.7 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 515.48 ms. Allocated memory is still 331.4 MB. Free memory was 293.2 MB in the beginning and 268.5 MB in the end (delta: 24.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 59.94 ms. Allocated memory is still 331.4 MB. Free memory was 268.5 MB in the beginning and 265.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 21.11 ms. Allocated memory is still 331.4 MB. Free memory was 265.4 MB in the beginning and 263.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 498.35 ms. Allocated memory is still 331.4 MB. Free memory was 263.3 MB in the beginning and 219.1 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 696409.61 ms. Allocated memory was 331.4 MB in the beginning and 16.0 GB in the end (delta: 15.7 GB). Free memory was 218.1 MB in the beginning and 12.3 GB in the end (delta: -12.1 GB). Peak memory consumption was 3.6 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 946]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 253 places, 308 transitions, 634 flow. Already constructed 2 states. Currently 1 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 249 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14674.3ms, OverallIterations: 15, TraceHistogramMax: 10, EmptinessCheckTime: 38.2ms, AutomataDifference: 5394.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 164.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2819 SDtfs, 6052 SDslu, 16344 SDs, 0 SdLazy, 3350 SolverSat, 319 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1494.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1482 GetRequests, 1073 SyntacticMatches, 5 SemanticMatches, 404 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5111 ImplicationChecksByTransitivity, 4442.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=8335occurred in iteration=6, InterpolantAutomatonStates: 298, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1006.7ms AutomataMinimizationTime, 15 MinimizatonAttempts, 12837 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 195.7ms SsaConstructionTime, 452.9ms SatisfiabilityAnalysisTime, 3889.8ms InterpolantComputationTime, 2320 NumberOfCodeBlocks, 2255 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2292 ConstructedInterpolants, 3 QuantifiedInterpolants, 8785 SizeOfPredicates, 126 NumberOfNonLiveVariables, 2312 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 28 InterpolantComputations, 5 PerfectInterpolantSequences, 794/1914 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 303 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 676551.4ms, OverallIterations: 27, TraceHistogramMax: 10, EmptinessCheckTime: 614.8ms, AutomataDifference: 96980.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 92354.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 11995 SDtfs, 36087 SDslu, 72802 SDs, 0 SdLazy, 14124 SolverSat, 1268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6787.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2213 GetRequests, 1456 SyntacticMatches, 28 SemanticMatches, 729 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7863 ImplicationChecksByTransitivity, 11840.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=472201occurred in iteration=6, InterpolantAutomatonStates: 580, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 474567.4ms AutomataMinimizationTime, 27 MinimizatonAttempts, 3631147 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 460.5ms SsaConstructionTime, 445.1ms SatisfiabilityAnalysisTime, 6680.8ms InterpolantComputationTime, 4022 NumberOfCodeBlocks, 3905 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 3978 ConstructedInterpolants, 4 QuantifiedInterpolants, 22944 SizeOfPredicates, 155 NumberOfNonLiveVariables, 2931 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 44 InterpolantComputations, 15 PerfectInterpolantSequences, 4612/5742 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 249 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5041.7ms, OverallIterations: 12, TraceHistogramMax: 10, EmptinessCheckTime: 8.8ms, AutomataDifference: 1014.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 80.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1079 SDtfs, 192 SDslu, 5411 SDs, 0 SdLazy, 556 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 233.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 761 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 1145.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=6129occurred in iteration=0, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 76.8ms AutomataMinimizationTime, 11 MinimizatonAttempts, 27 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 93.8ms SsaConstructionTime, 223.7ms SatisfiabilityAnalysisTime, 1195.8ms InterpolantComputationTime, 1277 NumberOfCodeBlocks, 1264 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1170 ConstructedInterpolants, 0 QuantifiedInterpolants, 2108 SizeOfPredicates, 90 NumberOfNonLiveVariables, 1144 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 100/1390 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 303 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 1.9ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown