/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/s5lif.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 01:40:04,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 01:40:04,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 01:40:04,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 01:40:04,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 01:40:04,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 01:40:04,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 01:40:04,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 01:40:04,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 01:40:04,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 01:40:04,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 01:40:04,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 01:40:04,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 01:40:04,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 01:40:04,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 01:40:04,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 01:40:04,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 01:40:04,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 01:40:04,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 01:40:04,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 01:40:04,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 01:40:04,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 01:40:04,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 01:40:04,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 01:40:04,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 01:40:04,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 01:40:04,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 01:40:04,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 01:40:04,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 01:40:04,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 01:40:04,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 01:40:04,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 01:40:04,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 01:40:04,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 01:40:04,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 01:40:04,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 01:40:04,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 01:40:04,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 01:40:04,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 01:40:04,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 01:40:04,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 01:40:04,514 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-01-31 01:40:04,535 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 01:40:04,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 01:40:04,535 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 01:40:04,535 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 01:40:04,536 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 01:40:04,536 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 01:40:04,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 01:40:04,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 01:40:04,537 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 01:40:04,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 01:40:04,537 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 01:40:04,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 01:40:04,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 01:40:04,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 01:40:04,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 01:40:04,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 01:40:04,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 01:40:04,537 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 01:40:04,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 01:40:04,538 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 01:40:04,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 01:40:04,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 01:40:04,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 01:40:04,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 01:40:04,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 01:40:04,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 01:40:04,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 01:40:04,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 01:40:04,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 01:40:04,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 01:40:04,539 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 01:40:04,539 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 01:40:04,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 01:40:04,539 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 01:40:04,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 01:40:04,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 01:40:04,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 01:40:04,732 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 01:40:04,733 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 01:40:04,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s5lif.c [2022-01-31 01:40:04,785 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bce2aa20d/76824a63b9cf4eaba95f7f8471971f17/FLAG9b827f70c [2022-01-31 01:40:05,106 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 01:40:05,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s5lif.c [2022-01-31 01:40:05,121 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bce2aa20d/76824a63b9cf4eaba95f7f8471971f17/FLAG9b827f70c [2022-01-31 01:40:05,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bce2aa20d/76824a63b9cf4eaba95f7f8471971f17 [2022-01-31 01:40:05,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 01:40:05,534 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 01:40:05,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 01:40:05,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 01:40:05,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 01:40:05,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:40:05" (1/1) ... [2022-01-31 01:40:05,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2481bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:40:05, skipping insertion in model container [2022-01-31 01:40:05,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:40:05" (1/1) ... [2022-01-31 01:40:05,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 01:40:05,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 01:40:05,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s5lif.c[588,601] [2022-01-31 01:40:05,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 01:40:05,708 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 01:40:05,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s5lif.c[588,601] [2022-01-31 01:40:05,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 01:40:05,756 INFO L208 MainTranslator]: Completed translation [2022-01-31 01:40:05,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:40:05 WrapperNode [2022-01-31 01:40:05,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 01:40:05,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 01:40:05,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 01:40:05,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 01:40:05,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:40:05" (1/1) ... [2022-01-31 01:40:05,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:40:05" (1/1) ... [2022-01-31 01:40:05,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:40:05" (1/1) ... [2022-01-31 01:40:05,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:40:05" (1/1) ... [2022-01-31 01:40:05,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:40:05" (1/1) ... [2022-01-31 01:40:05,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:40:05" (1/1) ... [2022-01-31 01:40:05,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:40:05" (1/1) ... [2022-01-31 01:40:05,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 01:40:05,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 01:40:05,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 01:40:05,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 01:40:05,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:40:05" (1/1) ... [2022-01-31 01:40:05,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 01:40:05,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:05,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 01:40:05,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 01:40:05,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 01:40:05,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 01:40:05,858 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 01:40:05,858 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 01:40:05,858 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 01:40:05,859 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 01:40:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 01:40:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 01:40:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 01:40:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 01:40:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 01:40:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 01:40:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 01:40:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 01:40:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 01:40:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 01:40:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 01:40:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 01:40:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 01:40:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 01:40:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 01:40:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 01:40:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 01:40:05,926 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 01:40:05,928 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 01:40:06,072 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 01:40:06,076 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 01:40:06,076 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 01:40:06,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:40:06 BoogieIcfgContainer [2022-01-31 01:40:06,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 01:40:06,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 01:40:06,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 01:40:06,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 01:40:06,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 01:40:05" (1/3) ... [2022-01-31 01:40:06,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2615c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:40:06, skipping insertion in model container [2022-01-31 01:40:06,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:40:05" (2/3) ... [2022-01-31 01:40:06,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2615c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:40:06, skipping insertion in model container [2022-01-31 01:40:06,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:40:06" (3/3) ... [2022-01-31 01:40:06,097 INFO L111 eAbstractionObserver]: Analyzing ICFG s5lif.c [2022-01-31 01:40:06,101 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 01:40:06,101 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 01:40:06,146 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 01:40:06,152 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 01:40:06,152 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 01:40:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 01:40:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 01:40:06,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:06,171 INFO L514 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] [2022-01-31 01:40:06,171 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:06,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:06,176 INFO L85 PathProgramCache]: Analyzing trace with hash -378919619, now seen corresponding path program 1 times [2022-01-31 01:40:06,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:06,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050350176] [2022-01-31 01:40:06,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:06,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:06,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:06,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:06,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:06,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050350176] [2022-01-31 01:40:06,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050350176] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 01:40:06,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 01:40:06,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 01:40:06,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828366006] [2022-01-31 01:40:06,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 01:40:06,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 01:40:06,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:06,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 01:40:06,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 01:40:06,375 INFO L87 Difference]: Start difference. First operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:06,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:06,422 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-01-31 01:40:06,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 01:40:06,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-01-31 01:40:06,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:06,433 INFO L225 Difference]: With dead ends: 60 [2022-01-31 01:40:06,433 INFO L226 Difference]: Without dead ends: 28 [2022-01-31 01:40:06,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 01:40:06,440 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:06,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 43 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 01:40:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-31 01:40:06,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-31 01:40:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:06,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-01-31 01:40:06,464 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2022-01-31 01:40:06,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:06,464 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-01-31 01:40:06,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:06,465 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-01-31 01:40:06,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 01:40:06,465 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:06,465 INFO L514 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] [2022-01-31 01:40:06,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 01:40:06,466 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:06,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:06,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1390036869, now seen corresponding path program 1 times [2022-01-31 01:40:06,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:06,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527836463] [2022-01-31 01:40:06,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:06,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:06,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:06,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:06,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:06,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527836463] [2022-01-31 01:40:06,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527836463] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 01:40:06,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 01:40:06,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 01:40:06,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952177744] [2022-01-31 01:40:06,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 01:40:06,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 01:40:06,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:06,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 01:40:06,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 01:40:06,571 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:06,644 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-01-31 01:40:06,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 01:40:06,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-01-31 01:40:06,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:06,645 INFO L225 Difference]: With dead ends: 48 [2022-01-31 01:40:06,646 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 01:40:06,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 01:40:06,647 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:06,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 25 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:40:06,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 01:40:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-01-31 01:40:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-01-31 01:40:06,653 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2022-01-31 01:40:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:06,653 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-01-31 01:40:06,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-01-31 01:40:06,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 01:40:06,654 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:06,654 INFO L514 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] [2022-01-31 01:40:06,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 01:40:06,654 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:06,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:06,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1506162525, now seen corresponding path program 1 times [2022-01-31 01:40:06,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:06,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348135990] [2022-01-31 01:40:06,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:06,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:07,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:07,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:07,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:07,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348135990] [2022-01-31 01:40:07,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348135990] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:07,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225509750] [2022-01-31 01:40:07,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:07,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:07,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:07,220 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:07,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 01:40:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:07,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-31 01:40:07,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:07,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-01-31 01:40:07,402 INFO L387 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 11 treesize of output 7 [2022-01-31 01:40:07,448 INFO L387 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 14 treesize of output 16 [2022-01-31 01:40:07,581 INFO L387 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 32 treesize of output 23 [2022-01-31 01:40:07,697 INFO L387 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 36 treesize of output 23 [2022-01-31 01:40:07,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 26 treesize of output 10 [2022-01-31 01:40:07,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:07,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:08,085 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:40:08,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2022-01-31 01:40:08,153 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:40:08,154 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-01-31 01:40:08,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:08,164 INFO L387 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 20 treesize of output 12 [2022-01-31 01:40:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:08,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225509750] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:08,207 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:08,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 32 [2022-01-31 01:40:08,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2254367] [2022-01-31 01:40:08,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:08,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 01:40:08,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:08,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 01:40:08,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2022-01-31 01:40:08,210 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 32 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:40:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:08,846 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2022-01-31 01:40:08,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 01:40:08,846 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-01-31 01:40:08,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:08,847 INFO L225 Difference]: With dead ends: 67 [2022-01-31 01:40:08,847 INFO L226 Difference]: Without dead ends: 61 [2022-01-31 01:40:08,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=381, Invalid=1781, Unknown=0, NotChecked=0, Total=2162 [2022-01-31 01:40:08,849 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 45 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:08,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 117 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 451 Invalid, 0 Unknown, 48 Unchecked, 0.3s Time] [2022-01-31 01:40:08,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-31 01:40:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 41. [2022-01-31 01:40:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-01-31 01:40:08,856 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2022-01-31 01:40:08,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:08,856 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-01-31 01:40:08,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.8) internal successors, (54), 29 states have internal predecessors, (54), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:40:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-01-31 01:40:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 01:40:08,860 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:08,860 INFO L514 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] [2022-01-31 01:40:08,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-31 01:40:09,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:09,076 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:09,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:09,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1247997087, now seen corresponding path program 1 times [2022-01-31 01:40:09,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:09,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850746877] [2022-01-31 01:40:09,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:09,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:09,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:09,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:40:09,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:09,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850746877] [2022-01-31 01:40:09,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850746877] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:09,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479074968] [2022-01-31 01:40:09,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:09,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:09,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:09,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:09,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 01:40:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:09,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 01:40:09,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:09,270 INFO L387 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 11 treesize of output 7 [2022-01-31 01:40:09,292 INFO L387 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 15 treesize of output 7 [2022-01-31 01:40:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:40:09,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:09,340 INFO L387 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 12 [2022-01-31 01:40:09,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 20 [2022-01-31 01:40:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:40:09,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479074968] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:09,369 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:09,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-01-31 01:40:09,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256800185] [2022-01-31 01:40:09,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:09,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 01:40:09,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:09,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 01:40:09,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 01:40:09,371 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:09,449 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-01-31 01:40:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 01:40:09,463 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-01-31 01:40:09,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:09,466 INFO L225 Difference]: With dead ends: 60 [2022-01-31 01:40:09,466 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 01:40:09,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-01-31 01:40:09,470 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:09,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 86 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:40:09,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 01:40:09,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2022-01-31 01:40:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-01-31 01:40:09,476 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 30 [2022-01-31 01:40:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:09,476 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-01-31 01:40:09,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-01-31 01:40:09,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 01:40:09,477 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:09,477 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:40:09,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 01:40:09,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-31 01:40:09,678 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:09,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:09,678 INFO L85 PathProgramCache]: Analyzing trace with hash -949492539, now seen corresponding path program 2 times [2022-01-31 01:40:09,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:09,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177024803] [2022-01-31 01:40:09,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:09,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:09,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:09,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:40:09,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:09,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177024803] [2022-01-31 01:40:09,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177024803] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:09,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005789013] [2022-01-31 01:40:09,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:40:09,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:09,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:09,758 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:09,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 01:40:09,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:40:09,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:40:09,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 01:40:09,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:40:09,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:40:09,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005789013] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:09,908 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:09,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 01:40:09,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43265272] [2022-01-31 01:40:09,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:09,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 01:40:09,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:09,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 01:40:09,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:40:09,909 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:10,025 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2022-01-31 01:40:10,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 01:40:10,026 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-01-31 01:40:10,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:10,028 INFO L225 Difference]: With dead ends: 82 [2022-01-31 01:40:10,029 INFO L226 Difference]: Without dead ends: 54 [2022-01-31 01:40:10,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:40:10,032 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 62 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:10,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 44 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:40:10,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-31 01:40:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2022-01-31 01:40:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-01-31 01:40:10,049 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2022-01-31 01:40:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:10,050 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-01-31 01:40:10,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-01-31 01:40:10,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 01:40:10,051 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:10,051 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:40:10,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 01:40:10,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:10,256 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:10,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:10,264 INFO L85 PathProgramCache]: Analyzing trace with hash 148078625, now seen corresponding path program 3 times [2022-01-31 01:40:10,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:10,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207296416] [2022-01-31 01:40:10,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:10,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:10,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:10,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:40:10,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:10,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207296416] [2022-01-31 01:40:10,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207296416] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:10,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871310085] [2022-01-31 01:40:10,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:40:10,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:10,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:10,343 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:10,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-31 01:40:10,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 01:40:10,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:40:10,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 01:40:10,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:40:10,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:40:10,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871310085] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:10,516 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:10,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 01:40:10,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094882590] [2022-01-31 01:40:10,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:10,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 01:40:10,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:10,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 01:40:10,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:40:10,519 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:10,643 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-01-31 01:40:10,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 01:40:10,646 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-01-31 01:40:10,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:10,649 INFO L225 Difference]: With dead ends: 51 [2022-01-31 01:40:10,649 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 01:40:10,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-01-31 01:40:10,651 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 50 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:10,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 65 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:40:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 01:40:10,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-01-31 01:40:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-01-31 01:40:10,663 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 32 [2022-01-31 01:40:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:10,663 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-01-31 01:40:10,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-01-31 01:40:10,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 01:40:10,663 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:10,664 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:40:10,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-31 01:40:10,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:10,882 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:10,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:10,883 INFO L85 PathProgramCache]: Analyzing trace with hash 550649411, now seen corresponding path program 4 times [2022-01-31 01:40:10,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:10,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401121778] [2022-01-31 01:40:10,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:10,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:11,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:11,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:11,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:11,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401121778] [2022-01-31 01:40:11,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401121778] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:11,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424681906] [2022-01-31 01:40:11,780 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:40:11,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:11,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:11,782 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:11,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-31 01:40:11,829 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:40:11,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:40:11,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-31 01:40:11,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:11,860 INFO L387 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 11 treesize of output 7 [2022-01-31 01:40:11,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:11,889 INFO L387 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 14 treesize of output 16 [2022-01-31 01:40:11,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:11,931 INFO L387 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 14 treesize of output 16 [2022-01-31 01:40:12,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:12,116 INFO L387 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 44 treesize of output 27 [2022-01-31 01:40:12,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:12,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:12,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-01-31 01:40:12,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:12,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:12,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:12,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-01-31 01:40:12,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:12,519 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-01-31 01:40:12,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:12,606 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-01-31 01:40:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:12,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:13,529 INFO L353 Elim1Store]: treesize reduction 52, result has 41.6 percent of original size [2022-01-31 01:40:13,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 554 treesize of output 290 [2022-01-31 01:40:13,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:13,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 90 treesize of output 68 [2022-01-31 01:40:13,648 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (+ c_main_~a~0.offset 4))) (or (not (= (+ (select v_arrayElimArr_3 .cse0) (- 5)) 1)) (not (= (select v_arrayElimArr_3 c_main_~a~0.offset) 6)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_3))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse1 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 6 .cse2))) c_main_~a~0.base) .cse0))) (and (<= (div (+ 5 .cse1 .cse2) 6) c_main_~i~0) (<= (+ c_main_~i~0 1) (div (+ .cse1 6 .cse2) 6)))))))))) is different from false [2022-01-31 01:40:13,687 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse4 (+ c_main_~a~0.offset 4))) (or (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_3))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse3 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 6 .cse1))) c_main_~a~0.base) .cse4))) (and (<= (div (+ 5 .cse0 .cse1) 6) (+ c_main_~i~0 1)) (<= (+ c_main_~i~0 2) (div (+ .cse0 6 .cse1) 6))))))) (not (= (+ (select v_arrayElimArr_3 .cse4) (- 5)) 1)) (not (= (select v_arrayElimArr_3 c_main_~a~0.offset) 6))))) is different from false [2022-01-31 01:40:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-31 01:40:13,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424681906] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:13,750 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:13,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 20] total 56 [2022-01-31 01:40:13,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794900910] [2022-01-31 01:40:13,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:13,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-01-31 01:40:13,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:13,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-01-31 01:40:13,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2521, Unknown=2, NotChecked=210, Total=3080 [2022-01-31 01:40:13,753 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 56 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 53 states have internal predecessors, (76), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:26,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:26,324 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-01-31 01:40:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 01:40:26,325 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 53 states have internal predecessors, (76), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-01-31 01:40:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:26,326 INFO L225 Difference]: With dead ends: 76 [2022-01-31 01:40:26,326 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 01:40:26,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1474 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=569, Invalid=3857, Unknown=4, NotChecked=262, Total=4692 [2022-01-31 01:40:26,327 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:26,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 210 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 987 Invalid, 0 Unknown, 119 Unchecked, 1.3s Time] [2022-01-31 01:40:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 01:40:26,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 51. [2022-01-31 01:40:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-01-31 01:40:26,333 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 37 [2022-01-31 01:40:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:26,333 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-01-31 01:40:26,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 53 states have internal predecessors, (76), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-01-31 01:40:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 01:40:26,334 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:26,334 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:40:26,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-31 01:40:26,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:26,542 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:26,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:26,542 INFO L85 PathProgramCache]: Analyzing trace with hash -460467839, now seen corresponding path program 1 times [2022-01-31 01:40:26,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:26,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623719073] [2022-01-31 01:40:26,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:26,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:26,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:26,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 01:40:26,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:26,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623719073] [2022-01-31 01:40:26,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623719073] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:26,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578286611] [2022-01-31 01:40:26,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:26,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:26,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:26,927 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:26,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-31 01:40:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:26,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-31 01:40:26,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:27,039 INFO L387 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 [2022-01-31 01:40:27,156 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 01:40:27,157 INFO L387 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 01:40:27,199 INFO L387 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 19 treesize of output 7 [2022-01-31 01:40:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 01:40:27,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:27,401 INFO L387 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 16 treesize of output 14 [2022-01-31 01:40:27,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 24 [2022-01-31 01:40:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 01:40:27,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578286611] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:27,446 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:27,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 19 [2022-01-31 01:40:27,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963443426] [2022-01-31 01:40:27,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:27,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 01:40:27,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:27,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 01:40:27,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2022-01-31 01:40:27,448 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:28,091 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2022-01-31 01:40:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 01:40:28,091 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-01-31 01:40:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:28,092 INFO L225 Difference]: With dead ends: 74 [2022-01-31 01:40:28,092 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 01:40:28,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2022-01-31 01:40:28,093 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:28,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 01:40:28,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 01:40:28,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2022-01-31 01:40:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:28,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-01-31 01:40:28,098 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 37 [2022-01-31 01:40:28,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:28,098 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-01-31 01:40:28,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:28,099 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-01-31 01:40:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 01:40:28,099 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:28,099 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:40:28,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-31 01:40:28,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:28,317 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:28,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:28,317 INFO L85 PathProgramCache]: Analyzing trace with hash -38178203, now seen corresponding path program 5 times [2022-01-31 01:40:28,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:28,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543070941] [2022-01-31 01:40:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:28,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:28,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:28,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 01:40:28,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:28,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543070941] [2022-01-31 01:40:28,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543070941] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:28,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171626301] [2022-01-31 01:40:28,471 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:40:28,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:28,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:28,472 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:28,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-31 01:40:28,530 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 01:40:28,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:40:28,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 01:40:28,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 01:40:28,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 01:40:28,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171626301] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:28,913 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:28,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 01:40:28,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719312087] [2022-01-31 01:40:28,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:28,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:40:28,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:28,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:40:28,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:40:28,914 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:29,326 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2022-01-31 01:40:29,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 01:40:29,326 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-01-31 01:40:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:29,327 INFO L225 Difference]: With dead ends: 98 [2022-01-31 01:40:29,327 INFO L226 Difference]: Without dead ends: 63 [2022-01-31 01:40:29,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-01-31 01:40:29,328 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:29,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 58 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 01:40:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-31 01:40:29,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2022-01-31 01:40:29,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:29,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-01-31 01:40:29,335 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 39 [2022-01-31 01:40:29,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:29,335 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-01-31 01:40:29,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:29,335 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-01-31 01:40:29,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 01:40:29,336 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:29,336 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:40:29,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 01:40:29,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:29,544 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:29,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:29,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1744878853, now seen corresponding path program 6 times [2022-01-31 01:40:29,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:29,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514717074] [2022-01-31 01:40:29,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:29,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:29,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:29,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 01:40:29,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:29,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514717074] [2022-01-31 01:40:29,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514717074] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:29,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485363206] [2022-01-31 01:40:29,722 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:40:29,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:29,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:29,723 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:29,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 01:40:29,783 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 01:40:29,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:40:29,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 01:40:29,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 01:40:30,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 01:40:30,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485363206] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:30,168 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:30,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 01:40:30,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798985053] [2022-01-31 01:40:30,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:30,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:40:30,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:30,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:40:30,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:40:30,170 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:30,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:40:30,457 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-01-31 01:40:30,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 01:40:30,457 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-01-31 01:40:30,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:40:30,458 INFO L225 Difference]: With dead ends: 60 [2022-01-31 01:40:30,458 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 01:40:30,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-01-31 01:40:30,459 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 73 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:40:30,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 50 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:40:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 01:40:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2022-01-31 01:40:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:40:30,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-01-31 01:40:30,466 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 39 [2022-01-31 01:40:30,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:40:30,466 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-01-31 01:40:30,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:40:30,467 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-01-31 01:40:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 01:40:30,467 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:40:30,467 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:40:30,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 01:40:30,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 01:40:30,680 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:40:30,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:40:30,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1192279197, now seen corresponding path program 7 times [2022-01-31 01:40:30,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:40:30,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948280982] [2022-01-31 01:40:30,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:40:30,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:40:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:32,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:40:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:32,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:40:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:32,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:40:32,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948280982] [2022-01-31 01:40:32,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948280982] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:40:32,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805458668] [2022-01-31 01:40:32,477 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:40:32,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:40:32,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:40:32,478 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:40:32,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 01:40:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:40:32,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 75 conjunts are in the unsatisfiable core [2022-01-31 01:40:32,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:40:32,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-01-31 01:40:32,579 INFO L387 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 11 treesize of output 7 [2022-01-31 01:40:32,601 INFO L387 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 14 treesize of output 16 [2022-01-31 01:40:32,648 INFO L387 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 14 treesize of output 16 [2022-01-31 01:40:32,764 INFO L387 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 14 treesize of output 16 [2022-01-31 01:40:33,231 INFO L387 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 44 treesize of output 27 [2022-01-31 01:40:33,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:33,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2022-01-31 01:40:33,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:33,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:33,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:33,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-01-31 01:40:34,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:34,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:34,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:34,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:34,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2022-01-31 01:40:34,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:34,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:34,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:34,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:34,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:40:34,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:34,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2022-01-31 01:40:34,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-01-31 01:40:35,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2022-01-31 01:40:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:40:35,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:40:39,901 INFO L353 Elim1Store]: treesize reduction 476, result has 26.2 percent of original size [2022-01-31 01:40:39,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 6 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 39 case distinctions, treesize of input 51972 treesize of output 16128 [2022-01-31 01:40:40,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:40,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:40,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:40,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 27 [2022-01-31 01:40:40,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:40,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:40,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:40,176 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2022-01-31 01:40:40,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:40,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:40,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:40,218 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2022-01-31 01:40:40,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:40,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:40,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:40,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2022-01-31 01:40:40,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:40,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:40,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:40:40,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 155 [2022-01-31 01:40:40,362 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ c_main_~a~0.offset 8)) (.cse1 (+ c_main_~a~0.offset 4))) (or (not (= 6 (select v_arrayElimArr_5 .cse0))) (not (= 6 (select v_arrayElimArr_5 c_main_~a~0.offset))) (not (= (select v_arrayElimArr_5 .cse1) 6)) (= (* 6 ~N~0) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_5))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.offset|))) (let ((.cse5 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 6))) c_main_~a~0.base) .cse1))) (+ (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 6 .cse5))) c_main_~a~0.base) .cse0) .cse4 6 .cse5)))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0))))) is different from false [2022-01-31 01:40:40,457 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ c_main_~a~0.offset 8)) (.cse1 (+ c_main_~a~0.offset 4))) (or (not (= 6 (select v_arrayElimArr_5 .cse0))) (not (= 6 (select v_arrayElimArr_5 c_main_~a~0.offset))) (not (= (select v_arrayElimArr_5 .cse1) 6)) (= (* 6 ~N~0) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_5))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.offset|))) (let ((.cse5 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 6))) c_main_~a~0.base) .cse1))) (+ (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 6 .cse5))) c_main_~a~0.base) .cse0) .cse4 6 .cse5)))))) (not (< (+ c_main_~i~0 1) ~N~0)) (< (+ c_main_~i~0 2) ~N~0)))) is different from false [2022-01-31 01:40:40,619 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ c_main_~a~0.offset 8)) (.cse1 (+ c_main_~a~0.offset 4))) (or (not (= 6 (select v_arrayElimArr_5 .cse0))) (< (+ c_main_~i~0 3) ~N~0) (not (= 6 (select v_arrayElimArr_5 c_main_~a~0.offset))) (not (= (select v_arrayElimArr_5 .cse1) 6)) (not (< (+ c_main_~i~0 2) ~N~0)) (= (* 6 ~N~0) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_5))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.offset|))) (let ((.cse5 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 6))) c_main_~a~0.base) .cse1))) (+ (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 6 .cse5))) c_main_~a~0.base) .cse0) .cse4 6 .cse5))))))))) is different from false [2022-01-31 01:40:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-01-31 01:40:40,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805458668] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:40:40,734 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:40:40,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 26] total 71 [2022-01-31 01:40:40,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051443472] [2022-01-31 01:40:40,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:40:40,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-01-31 01:40:40,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:40:40,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-01-31 01:40:40,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=4072, Unknown=3, NotChecked=402, Total=4970 [2022-01-31 01:40:40,736 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 71 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 68 states have internal predecessors, (90), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:41:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:41:09,603 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2022-01-31 01:41:09,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-01-31 01:41:09,604 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 68 states have internal predecessors, (90), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-01-31 01:41:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:41:09,605 INFO L225 Difference]: With dead ends: 113 [2022-01-31 01:41:09,605 INFO L226 Difference]: Without dead ends: 90 [2022-01-31 01:41:09,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 110 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3649 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=1364, Invalid=10417, Unknown=3, NotChecked=648, Total=12432 [2022-01-31 01:41:09,608 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 78 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:41:09,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 279 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 1517 Invalid, 0 Unknown, 289 Unchecked, 3.0s Time] [2022-01-31 01:41:09,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-01-31 01:41:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 65. [2022-01-31 01:41:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:41:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-01-31 01:41:09,619 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 44 [2022-01-31 01:41:09,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:41:09,619 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-01-31 01:41:09,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 68 states have internal predecessors, (90), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:41:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-01-31 01:41:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 01:41:09,621 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:41:09,621 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-01-31 01:41:09,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-31 01:41:09,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:41:09,835 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:41:09,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:41:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2081619745, now seen corresponding path program 2 times [2022-01-31 01:41:09,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:41:09,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992536640] [2022-01-31 01:41:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:41:09,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:41:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:41:10,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:41:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:41:10,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:41:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:41:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 01:41:10,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:41:10,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992536640] [2022-01-31 01:41:10,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992536640] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:41:10,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424900549] [2022-01-31 01:41:10,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:41:10,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:41:10,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:41:10,149 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:41:10,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 01:41:10,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:41:10,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:41:10,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 01:41:10,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:41:10,305 INFO L387 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 [2022-01-31 01:41:10,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:10,402 INFO L387 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 25 treesize of output 24 [2022-01-31 01:41:10,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:10,479 INFO L387 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 25 treesize of output 24 [2022-01-31 01:41:10,537 INFO L387 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 15 treesize of output 7 [2022-01-31 01:41:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 01:41:10,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:41:10,853 INFO L387 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 16 treesize of output 14 [2022-01-31 01:41:10,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 24 [2022-01-31 01:41:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 01:41:10,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424900549] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:41:10,951 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:41:10,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 28 [2022-01-31 01:41:10,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312798184] [2022-01-31 01:41:10,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:41:10,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 01:41:10,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:41:10,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 01:41:10,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2022-01-31 01:41:10,952 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:41:11,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:41:11,807 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-01-31 01:41:11,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 01:41:11,808 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-01-31 01:41:11,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:41:11,808 INFO L225 Difference]: With dead ends: 88 [2022-01-31 01:41:11,808 INFO L226 Difference]: Without dead ends: 71 [2022-01-31 01:41:11,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=247, Invalid=1393, Unknown=0, NotChecked=0, Total=1640 [2022-01-31 01:41:11,811 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 01:41:11,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 131 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 01:41:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-31 01:41:11,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2022-01-31 01:41:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:41:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-01-31 01:41:11,818 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 44 [2022-01-31 01:41:11,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:41:11,819 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-01-31 01:41:11,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:41:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-01-31 01:41:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 01:41:11,819 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:41:11,819 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:41:11,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 01:41:12,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 01:41:12,044 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:41:12,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:41:12,045 INFO L85 PathProgramCache]: Analyzing trace with hash 44674949, now seen corresponding path program 8 times [2022-01-31 01:41:12,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:41:12,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237261448] [2022-01-31 01:41:12,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:41:12,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:41:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:41:12,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:41:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:41:12,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:41:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:41:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 01:41:12,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:41:12,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237261448] [2022-01-31 01:41:12,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237261448] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:41:12,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752416561] [2022-01-31 01:41:12,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:41:12,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:41:12,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:41:12,224 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:41:12,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 01:41:12,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:41:12,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:41:12,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 01:41:12,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:41:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 01:41:12,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:41:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 01:41:12,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752416561] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:41:12,599 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:41:12,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 01:41:12,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597644545] [2022-01-31 01:41:12,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:41:12,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 01:41:12,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:41:12,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 01:41:12,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 01:41:12,600 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:41:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:41:12,983 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-01-31 01:41:12,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 01:41:12,983 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-01-31 01:41:12,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:41:12,984 INFO L225 Difference]: With dead ends: 100 [2022-01-31 01:41:12,984 INFO L226 Difference]: Without dead ends: 62 [2022-01-31 01:41:12,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-31 01:41:12,985 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 80 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:41:12,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 64 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 01:41:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-31 01:41:12,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-01-31 01:41:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:41:12,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-01-31 01:41:12,990 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 46 [2022-01-31 01:41:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:41:12,991 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-01-31 01:41:12,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:41:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-01-31 01:41:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 01:41:12,991 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:41:12,991 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:41:13,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-31 01:41:13,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 01:41:13,202 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:41:13,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:41:13,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1280766825, now seen corresponding path program 9 times [2022-01-31 01:41:13,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:41:13,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624003776] [2022-01-31 01:41:13,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:41:13,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:41:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:41:13,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:41:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:41:13,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:41:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:41:13,358 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 01:41:13,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:41:13,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624003776] [2022-01-31 01:41:13,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624003776] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:41:13,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175599483] [2022-01-31 01:41:13,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:41:13,358 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:41:13,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:41:13,359 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:41:13,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-31 01:41:13,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 01:41:13,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:41:13,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 01:41:13,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:41:13,654 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 01:41:13,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:41:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 01:41:13,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175599483] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:41:13,802 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:41:13,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 01:41:13,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873741499] [2022-01-31 01:41:13,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:41:13,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 01:41:13,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:41:13,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 01:41:13,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 01:41:13,803 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:41:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:41:14,214 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-01-31 01:41:14,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:41:14,214 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-01-31 01:41:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:41:14,214 INFO L225 Difference]: With dead ends: 61 [2022-01-31 01:41:14,215 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 01:41:14,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-01-31 01:41:14,215 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 74 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:41:14,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 64 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 01:41:14,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 01:41:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2022-01-31 01:41:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:41:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-01-31 01:41:14,221 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 49 [2022-01-31 01:41:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:41:14,221 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-01-31 01:41:14,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:41:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-01-31 01:41:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 01:41:14,221 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:41:14,221 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:41:14,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-01-31 01:41:14,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-31 01:41:14,431 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:41:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:41:14,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1524987403, now seen corresponding path program 10 times [2022-01-31 01:41:14,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:41:14,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758424966] [2022-01-31 01:41:14,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:41:14,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:41:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:41:16,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:41:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:41:16,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:41:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:41:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:41:16,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:41:16,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758424966] [2022-01-31 01:41:16,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758424966] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:41:16,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169262344] [2022-01-31 01:41:16,783 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:41:16,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:41:16,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:41:16,784 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:41:16,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-31 01:41:16,844 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:41:16,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:41:16,845 WARN L261 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 92 conjunts are in the unsatisfiable core [2022-01-31 01:41:16,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:41:16,884 INFO L387 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 11 treesize of output 7 [2022-01-31 01:41:16,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:16,961 INFO L387 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 14 treesize of output 16 [2022-01-31 01:41:17,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:17,040 INFO L387 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 14 treesize of output 16 [2022-01-31 01:41:17,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:17,132 INFO L387 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 14 treesize of output 16 [2022-01-31 01:41:17,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:17,217 INFO L387 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 14 treesize of output 16 [2022-01-31 01:41:17,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:17,614 INFO L387 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 44 treesize of output 27 [2022-01-31 01:41:17,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:17,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:17,889 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-01-31 01:41:18,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:18,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:18,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:18,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:18,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2022-01-31 01:41:18,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:18,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:18,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:18,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:18,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:18,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:18,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:18,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2022-01-31 01:41:19,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:19,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2022-01-31 01:41:19,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:19,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2022-01-31 01:41:19,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:19,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2022-01-31 01:41:19,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:19,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2022-01-31 01:41:20,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:41:20,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2022-01-31 01:41:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:41:20,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:41:33,415 INFO L353 Elim1Store]: treesize reduction 3907, result has 18.3 percent of original size [2022-01-31 01:41:33,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 23 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 27 new quantified variables, introduced 190 case distinctions, treesize of input 4443094 treesize of output 1015410 [2022-01-31 01:41:37,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-01-31 01:41:37,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2022-01-31 01:41:37,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-01-31 01:41:37,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 2417 treesize of output 2221 [2022-01-31 01:41:37,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2022-01-31 01:41:37,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2022-01-31 01:41:37,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,434 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2022-01-31 01:41:37,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,477 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2022-01-31 01:41:37,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:37,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2022-01-31 01:41:38,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,020 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-01-31 01:41:38,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-01-31 01:41:38,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-01-31 01:41:38,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 53 [2022-01-31 01:41:38,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-01-31 01:41:38,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 445 treesize of output 379 [2022-01-31 01:41:38,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2022-01-31 01:41:38,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2022-01-31 01:41:38,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 31 [2022-01-31 01:41:38,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-01-31 01:41:38,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,591 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,591 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,591 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 349 treesize of output 307 [2022-01-31 01:41:38,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 37 [2022-01-31 01:41:38,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:41:38,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 257 [2022-01-31 01:41:38,766 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_23 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ c_main_~a~0.offset 12)) (.cse1 (+ c_main_~a~0.offset 8)) (.cse0 (+ c_main_~a~0.offset 4))) (or (not (= (+ (select v_arrayElimArr_23 .cse0) (- 5)) 1)) (not (= (select v_arrayElimArr_23 .cse1) 6)) (not (= (+ (select v_arrayElimArr_23 .cse2) (- 5)) 1)) (not (= 6 (select v_arrayElimArr_23 c_main_~a~0.offset))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)) (= (* 6 ~N~0) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_23))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse7 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 6))) c_main_~a~0.base) .cse0))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 6 .cse7))) c_main_~a~0.base) .cse1))) (+ .cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse3 .cse6 6 .cse7))) c_main_~a~0.base) .cse2) .cse6 6 .cse7)))))))))) is different from false [2022-01-31 01:41:38,882 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_23 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ c_main_~a~0.offset 12)) (.cse1 (+ c_main_~a~0.offset 8)) (.cse0 (+ c_main_~a~0.offset 4))) (or (not (= (+ (select v_arrayElimArr_23 .cse0) (- 5)) 1)) (not (= (select v_arrayElimArr_23 .cse1) 6)) (not (= (+ (select v_arrayElimArr_23 .cse2) (- 5)) 1)) (not (= 6 (select v_arrayElimArr_23 c_main_~a~0.offset))) (not (< (+ c_main_~i~0 1) ~N~0)) (< (+ c_main_~i~0 2) ~N~0) (= (* 6 ~N~0) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_23))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse7 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 6))) c_main_~a~0.base) .cse0))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 6 .cse7))) c_main_~a~0.base) .cse1))) (+ .cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse3 .cse6 6 .cse7))) c_main_~a~0.base) .cse2) .cse6 6 .cse7)))))))))) is different from false [2022-01-31 01:41:39,084 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_23 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ c_main_~a~0.offset 12)) (.cse1 (+ c_main_~a~0.offset 8)) (.cse0 (+ c_main_~a~0.offset 4))) (or (not (= (+ (select v_arrayElimArr_23 .cse0) (- 5)) 1)) (< (+ c_main_~i~0 3) ~N~0) (not (= (select v_arrayElimArr_23 .cse1) 6)) (not (= (+ (select v_arrayElimArr_23 .cse2) (- 5)) 1)) (not (= 6 (select v_arrayElimArr_23 c_main_~a~0.offset))) (not (< (+ c_main_~i~0 2) ~N~0)) (= (* 6 ~N~0) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_23))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse7 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 6))) c_main_~a~0.base) .cse0))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 6 .cse7))) c_main_~a~0.base) .cse1))) (+ .cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse3 .cse6 6 .cse7))) c_main_~a~0.base) .cse2) .cse6 6 .cse7)))))))))) is different from false [2022-01-31 01:41:39,295 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_23 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ c_main_~a~0.offset 12)) (.cse1 (+ c_main_~a~0.offset 8)) (.cse0 (+ c_main_~a~0.offset 4))) (or (< (+ c_main_~i~0 4) ~N~0) (not (= (+ (select v_arrayElimArr_23 .cse0) (- 5)) 1)) (not (= (select v_arrayElimArr_23 .cse1) 6)) (not (= (+ (select v_arrayElimArr_23 .cse2) (- 5)) 1)) (not (= 6 (select v_arrayElimArr_23 c_main_~a~0.offset))) (not (< (+ c_main_~i~0 3) ~N~0)) (= (* 6 ~N~0) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_23))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse7 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 6))) c_main_~a~0.base) .cse0))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 6 .cse7))) c_main_~a~0.base) .cse1))) (+ .cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse3 .cse6 6 .cse7))) c_main_~a~0.base) .cse2) .cse6 6 .cse7)))))))))) is different from false [2022-01-31 01:41:39,436 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-01-31 01:41:39,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169262344] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:41:39,436 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:41:39,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32, 32] total 91 [2022-01-31 01:41:39,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072824366] [2022-01-31 01:41:39,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:41:39,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-01-31 01:41:39,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:41:39,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-01-31 01:41:39,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=691, Invalid=6803, Unknown=4, NotChecked=692, Total=8190 [2022-01-31 01:41:39,439 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 91 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 88 states have internal predecessors, (115), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:42:35,581 WARN L228 SmtUtils]: Spent 30.66s on a formula simplification. DAG size of input: 204 DAG size of output: 198 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:43:27,689 WARN L228 SmtUtils]: Spent 38.94s on a formula simplification. DAG size of input: 210 DAG size of output: 207 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:44:16,904 WARN L228 SmtUtils]: Spent 35.35s on a formula simplification. DAG size of input: 210 DAG size of output: 207 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:44:52,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:44:52,711 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2022-01-31 01:44:52,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-01-31 01:44:52,712 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 88 states have internal predecessors, (115), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2022-01-31 01:44:52,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:44:52,713 INFO L225 Difference]: With dead ends: 130 [2022-01-31 01:44:52,713 INFO L226 Difference]: Without dead ends: 105 [2022-01-31 01:44:52,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 138 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5992 ImplicationChecksByTransitivity, 200.2s TimeCoverageRelationStatistics Valid=1754, Invalid=16617, Unknown=5, NotChecked=1084, Total=19460 [2022-01-31 01:44:52,717 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 98 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 2858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-01-31 01:44:52,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 313 Invalid, 2858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 2068 Invalid, 0 Unknown, 383 Unchecked, 5.5s Time] [2022-01-31 01:44:52,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-01-31 01:44:52,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2022-01-31 01:44:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:44:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-01-31 01:44:52,732 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 51 [2022-01-31 01:44:52,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:44:52,732 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-01-31 01:44:52,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 88 states have internal predecessors, (115), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:44:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-01-31 01:44:52,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 01:44:52,732 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:44:52,733 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:44:52,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-31 01:44:52,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-31 01:44:52,937 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:44:52,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:44:52,937 INFO L85 PathProgramCache]: Analyzing trace with hash -469157303, now seen corresponding path program 3 times [2022-01-31 01:44:52,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:44:52,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373421747] [2022-01-31 01:44:52,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:44:52,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:44:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:44:53,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:44:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:44:53,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:44:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:44:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 01:44:53,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:44:53,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373421747] [2022-01-31 01:44:53,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373421747] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:44:53,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95833703] [2022-01-31 01:44:53,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:44:53,382 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:44:53,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:44:53,383 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:44:53,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-31 01:44:53,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 01:44:53,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:44:53,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-31 01:44:53,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:44:53,675 INFO L387 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 15 treesize of output 11 [2022-01-31 01:44:53,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:44:53,966 INFO L387 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 27 treesize of output 26 [2022-01-31 01:44:54,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:44:54,081 INFO L387 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 27 treesize of output 26 [2022-01-31 01:44:54,169 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-01-31 01:44:54,170 INFO L387 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 1 case distinctions, treesize of input 27 treesize of output 34 [2022-01-31 01:44:54,487 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-31 01:44:54,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 16 [2022-01-31 01:44:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 01:44:54,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:46:07,729 INFO L387 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 32 treesize of output 30 [2022-01-31 01:46:07,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 208 treesize of output 202 [2022-01-31 01:46:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 16 proven. 30 refuted. 2 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-31 01:46:07,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95833703] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:46:07,985 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:46:07,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 20] total 47 [2022-01-31 01:46:07,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620725604] [2022-01-31 01:46:07,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:46:07,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-31 01:46:07,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:46:07,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-31 01:46:07,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=1776, Unknown=31, NotChecked=0, Total=2162 [2022-01-31 01:46:07,986 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 47 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:46:30,433 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~i~0 3))) (and (<= .cse0 c_~N~0) (or (< .cse0 c_~N~0) (= 1 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_~N~0 4) (- 4))))) (= c_main_~a~0.offset 0) (or (forall ((v_main_~i~0_213 Int) (v_main_~i~0_216 Int) (v_ArrVal_701 Int) (v_main_~i~0_215 Int) (v_ArrVal_699 Int)) (or (not (<= v_main_~i~0_216 (+ c_main_~i~0 1))) (< (+ v_main_~i~0_213 1) c_~N~0) (not (< v_main_~i~0_213 c_~N~0)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_216)) v_ArrVal_699) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215)) v_ArrVal_701) (+ c_main_~a~0.offset (* 4 v_main_~i~0_213))) 1) (not (<= (+ v_main_~i~0_215 1) v_main_~i~0_213)))) (<= c_~N~0 1)) (exists ((v_main_~i~0_203 Int)) (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_203) c_main_~a~0.offset)) 1) (<= 3 v_main_~i~0_203) (<= c_~N~0 (+ v_main_~i~0_203 1)) (< v_main_~i~0_203 c_~N~0))))) is different from false [2022-01-31 01:46:31,600 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~i~0 2))) (and (<= .cse0 c_~N~0) (= c_main_~a~0.offset 0) (or (< .cse0 c_~N~0) (= 1 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_~N~0 4) (- 4))))) (exists ((v_main_~i~0_203 Int)) (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_203) c_main_~a~0.offset)) 1) (<= 3 v_main_~i~0_203) (<= c_~N~0 (+ v_main_~i~0_203 1)) (< v_main_~i~0_203 c_~N~0))) (or (<= c_~N~0 1) (forall ((v_main_~i~0_213 Int) (v_ArrVal_701 Int) (v_ArrVal_699 Int) (v_main_~i~0_215 Int)) (or (< (+ v_main_~i~0_213 1) c_~N~0) (not (< v_main_~i~0_213 c_~N~0)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_699) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215)) v_ArrVal_701) (+ c_main_~a~0.offset (* 4 v_main_~i~0_213))) 1) (not (<= (+ v_main_~i~0_215 1) v_main_~i~0_213))))))) is different from false [2022-01-31 01:46:32,708 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~i~0 2)) (.cse1 (select |c_#memory_int| c_main_~a~0.base))) (and (<= .cse0 c_~N~0) (< c_main_~i~0 c_~N~0) (= c_main_~a~0.offset 0) (= |c_main_#t~mem8| (select .cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (or (< .cse0 c_~N~0) (= 1 (select .cse1 (+ c_main_~a~0.offset (* c_~N~0 4) (- 4))))) (exists ((v_main_~i~0_203 Int)) (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_203) c_main_~a~0.offset)) 1) (<= 3 v_main_~i~0_203) (<= c_~N~0 (+ v_main_~i~0_203 1)) (< v_main_~i~0_203 c_~N~0))) (or (<= c_~N~0 1) (forall ((v_main_~i~0_213 Int) (v_ArrVal_701 Int) (v_ArrVal_699 Int) (v_main_~i~0_215 Int)) (or (< (+ v_main_~i~0_213 1) c_~N~0) (not (< v_main_~i~0_213 c_~N~0)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_699) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215)) v_ArrVal_701) (+ c_main_~a~0.offset (* 4 v_main_~i~0_213))) 1) (not (<= (+ v_main_~i~0_215 1) v_main_~i~0_213))))))) is different from false [2022-01-31 01:46:34,022 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~i~0 2))) (and (<= .cse0 c_~N~0) (or (<= c_~N~0 1) (forall ((v_main_~i~0_213 Int) (main_~i~0 Int) (v_ArrVal_701 Int)) (or (< (+ v_main_~i~0_213 1) c_~N~0) (not (<= (+ main_~i~0 1) v_main_~i~0_213)) (not (< v_main_~i~0_213 c_~N~0)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_701) (+ c_main_~a~0.offset (* 4 v_main_~i~0_213))) 1)))) (= c_main_~a~0.offset 0) (or (< .cse0 c_~N~0) (= 1 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_~N~0 4) (- 4))))) (exists ((v_main_~i~0_203 Int)) (and (<= 3 v_main_~i~0_203) (<= c_~N~0 (+ v_main_~i~0_203 1)) (let ((.cse1 (* 4 v_main_~i~0_203))) (or (= (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse1 c_main_~a~0.offset)) 1) (= (* c_main_~i~0 4) .cse1))) (< v_main_~i~0_203 c_~N~0))))) is different from false [2022-01-31 01:46:35,316 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= c_~N~0 1) (forall ((v_main_~i~0_213 Int) (main_~i~0 Int) (v_ArrVal_701 Int)) (or (< (+ v_main_~i~0_213 1) c_~N~0) (not (<= (+ main_~i~0 1) v_main_~i~0_213)) (not (< v_main_~i~0_213 c_~N~0)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_701) (+ c_main_~a~0.offset (* 4 v_main_~i~0_213))) 1)))) (= c_main_~a~0.offset 0) (exists ((v_main_~i~0_203 Int)) (let ((.cse0 (+ v_main_~i~0_203 1))) (and (<= 3 v_main_~i~0_203) (or (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_203) c_main_~a~0.offset)) 1) (<= .cse0 c_main_~i~0)) (<= c_~N~0 .cse0) (< v_main_~i~0_203 c_~N~0)))) (or (<= (+ c_main_~i~0 2) c_~N~0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 1))) is different from false [2022-01-31 01:46:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:46:36,785 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-01-31 01:46:36,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-31 01:46:36,786 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2022-01-31 01:46:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:46:36,787 INFO L225 Difference]: With dead ends: 102 [2022-01-31 01:46:36,787 INFO L226 Difference]: Without dead ends: 86 [2022-01-31 01:46:36,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 101.5s TimeCoverageRelationStatistics Valid=672, Invalid=3334, Unknown=46, NotChecked=640, Total=4692 [2022-01-31 01:46:36,788 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 01:46:36,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 130 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 370 Invalid, 0 Unknown, 124 Unchecked, 0.4s Time] [2022-01-31 01:46:36,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-31 01:46:36,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2022-01-31 01:46:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 73 states have internal predecessors, (84), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:46:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2022-01-31 01:46:36,799 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 51 [2022-01-31 01:46:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:46:36,799 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2022-01-31 01:46:36,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 46 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:46:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2022-01-31 01:46:36,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 01:46:36,800 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:46:36,800 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:46:36,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-01-31 01:46:37,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:46:37,011 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:46:37,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:46:37,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2238419, now seen corresponding path program 11 times [2022-01-31 01:46:37,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:46:37,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485226592] [2022-01-31 01:46:37,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:46:37,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:46:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:37,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:46:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:37,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:46:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 01:46:37,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:46:37,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485226592] [2022-01-31 01:46:37,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485226592] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:46:37,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045312963] [2022-01-31 01:46:37,172 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:46:37,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:46:37,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:46:37,173 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:46:37,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-31 01:46:37,294 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 01:46:37,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:46:37,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 01:46:37,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:46:37,520 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 01:46:37,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:46:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 01:46:37,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045312963] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:46:37,633 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:46:37,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 01:46:37,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925092013] [2022-01-31 01:46:37,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:46:37,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 01:46:37,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:46:37,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 01:46:37,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 01:46:37,634 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 20 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:46:38,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:46:38,021 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2022-01-31 01:46:38,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:46:38,021 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 20 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2022-01-31 01:46:38,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:46:38,022 INFO L225 Difference]: With dead ends: 128 [2022-01-31 01:46:38,022 INFO L226 Difference]: Without dead ends: 79 [2022-01-31 01:46:38,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-01-31 01:46:38,022 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 111 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:46:38,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 56 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 01:46:38,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-01-31 01:46:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2022-01-31 01:46:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:46:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-01-31 01:46:38,031 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 53 [2022-01-31 01:46:38,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:46:38,031 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-01-31 01:46:38,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 20 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:46:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-01-31 01:46:38,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 01:46:38,032 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:46:38,032 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:46:38,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-31 01:46:38,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-31 01:46:38,233 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:46:38,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:46:38,233 INFO L85 PathProgramCache]: Analyzing trace with hash -20509823, now seen corresponding path program 12 times [2022-01-31 01:46:38,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:46:38,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467120837] [2022-01-31 01:46:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:46:38,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:46:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:38,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:46:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:38,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:46:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 01:46:38,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:46:38,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467120837] [2022-01-31 01:46:38,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467120837] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:46:38,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590116937] [2022-01-31 01:46:38,409 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:46:38,409 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:46:38,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:46:38,410 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:46:38,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-31 01:46:38,531 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-01-31 01:46:38,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:46:38,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 01:46:38,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:46:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 01:46:38,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:46:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 01:46:38,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590116937] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:46:38,950 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:46:38,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 01:46:38,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179977830] [2022-01-31 01:46:38,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:46:38,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 01:46:38,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:46:38,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 01:46:38,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 01:46:38,951 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:46:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:46:39,443 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-01-31 01:46:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 01:46:39,444 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2022-01-31 01:46:39,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:46:39,444 INFO L225 Difference]: With dead ends: 78 [2022-01-31 01:46:39,444 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 01:46:39,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2022-01-31 01:46:39,445 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 109 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:46:39,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 76 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 01:46:39,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 01:46:39,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2022-01-31 01:46:39,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:46:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-01-31 01:46:39,454 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 56 [2022-01-31 01:46:39,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:46:39,455 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-01-31 01:46:39,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:46:39,455 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-01-31 01:46:39,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 01:46:39,455 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:46:39,455 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:46:39,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-31 01:46:39,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-31 01:46:39,656 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:46:39,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:46:39,656 INFO L85 PathProgramCache]: Analyzing trace with hash 833611811, now seen corresponding path program 13 times [2022-01-31 01:46:39,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:46:39,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28323304] [2022-01-31 01:46:39,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:46:39,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:46:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:42,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:46:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:42,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:46:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:46:42,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:46:42,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28323304] [2022-01-31 01:46:42,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28323304] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:46:42,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523140629] [2022-01-31 01:46:42,948 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:46:42,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:46:42,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:46:42,950 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:46:42,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-31 01:46:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:46:43,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 115 conjunts are in the unsatisfiable core [2022-01-31 01:46:43,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:46:43,052 INFO L387 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 11 treesize of output 7 [2022-01-31 01:46:43,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-01-31 01:46:43,079 INFO L387 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 14 treesize of output 16 [2022-01-31 01:46:43,111 INFO L387 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 14 treesize of output 16 [2022-01-31 01:46:43,143 INFO L387 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 14 treesize of output 16 [2022-01-31 01:46:43,174 INFO L387 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 14 treesize of output 16 [2022-01-31 01:46:43,212 INFO L387 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 14 treesize of output 16 [2022-01-31 01:46:43,485 INFO L387 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 44 treesize of output 27 [2022-01-31 01:46:43,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:43,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2022-01-31 01:46:44,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2022-01-31 01:46:44,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2022-01-31 01:46:44,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:44,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2022-01-31 01:46:45,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:46:45,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,138 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2022-01-31 01:46:45,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:46:45,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 82 [2022-01-31 01:46:45,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:46:45,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:45,763 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2022-01-31 01:46:46,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:46,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:46,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:46,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:46,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:46:46,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:46,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:46,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:46,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:46,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:46,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:46:46,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 83 [2022-01-31 01:46:46,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2022-01-31 01:46:46,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 22 [2022-01-31 01:46:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:46:46,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:48:41,896 WARN L228 SmtUtils]: Spent 1.46m on a formula simplification. DAG size of input: 4993 DAG size of output: 1731 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-01-31 01:48:41,901 INFO L353 Elim1Store]: treesize reduction 32760, result has 13.4 percent of original size [2022-01-31 01:48:41,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 106 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 111 new quantified variables, introduced 1070 case distinctions, treesize of input 12055658420 treesize of output 2133029390 [2022-01-31 01:53:09,043 WARN L228 SmtUtils]: Spent 4.45m on a formula simplification that was a NOOP. DAG size: 21215 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)