/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/condg.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 00:53:04,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 00:53:04,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 00:53:04,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 00:53:04,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 00:53:04,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 00:53:04,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 00:53:04,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 00:53:04,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 00:53:04,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 00:53:04,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 00:53:04,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 00:53:04,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 00:53:04,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 00:53:04,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 00:53:04,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 00:53:04,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 00:53:04,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 00:53:04,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 00:53:04,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 00:53:04,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 00:53:04,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 00:53:04,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 00:53:04,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 00:53:04,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 00:53:04,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 00:53:04,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 00:53:04,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 00:53:04,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 00:53:04,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 00:53:04,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 00:53:04,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 00:53:04,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 00:53:04,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 00:53:04,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 00:53:04,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 00:53:04,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 00:53:04,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 00:53:04,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 00:53:04,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 00:53:04,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 00:53:04,351 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 00:53:04,398 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 00:53:04,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 00:53:04,399 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 00:53:04,399 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 00:53:04,399 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 00:53:04,400 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 00:53:04,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 00:53:04,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 00:53:04,400 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 00:53:04,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 00:53:04,400 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 00:53:04,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 00:53:04,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 00:53:04,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 00:53:04,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 00:53:04,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 00:53:04,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 00:53:04,401 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 00:53:04,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 00:53:04,401 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 00:53:04,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 00:53:04,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 00:53:04,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 00:53:04,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 00:53:04,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 00:53:04,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 00:53:04,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 00:53:04,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 00:53:04,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 00:53:04,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 00:53:04,402 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 00:53:04,402 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 00:53:04,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 00:53:04,403 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 00:53:04,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 00:53:04,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 00:53:04,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 00:53:04,610 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 00:53:04,614 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 00:53:04,615 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condg.c [2022-01-31 00:53:04,688 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3bd91beb/0143396d220045718a27e78f47fb926c/FLAG8b3b7f67c [2022-01-31 00:53:05,034 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 00:53:05,035 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condg.c [2022-01-31 00:53:05,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3bd91beb/0143396d220045718a27e78f47fb926c/FLAG8b3b7f67c [2022-01-31 00:53:05,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3bd91beb/0143396d220045718a27e78f47fb926c [2022-01-31 00:53:05,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 00:53:05,472 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 00:53:05,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 00:53:05,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 00:53:05,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 00:53:05,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:53:05" (1/1) ... [2022-01-31 00:53:05,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436e4db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:05, skipping insertion in model container [2022-01-31 00:53:05,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:53:05" (1/1) ... [2022-01-31 00:53:05,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 00:53:05,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 00:53:05,618 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/condg.c[588,601] [2022-01-31 00:53:05,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 00:53:05,635 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 00:53:05,671 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/condg.c[588,601] [2022-01-31 00:53:05,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 00:53:05,685 INFO L208 MainTranslator]: Completed translation [2022-01-31 00:53:05,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:05 WrapperNode [2022-01-31 00:53:05,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 00:53:05,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 00:53:05,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 00:53:05,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 00:53:05,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:05" (1/1) ... [2022-01-31 00:53:05,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:05" (1/1) ... [2022-01-31 00:53:05,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:05" (1/1) ... [2022-01-31 00:53:05,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:05" (1/1) ... [2022-01-31 00:53:05,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:05" (1/1) ... [2022-01-31 00:53:05,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:05" (1/1) ... [2022-01-31 00:53:05,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:05" (1/1) ... [2022-01-31 00:53:05,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 00:53:05,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 00:53:05,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 00:53:05,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 00:53:05,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:05" (1/1) ... [2022-01-31 00:53:05,740 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 00:53:05,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:53:05,795 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 00:53:05,825 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 00:53:05,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 00:53:05,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 00:53:05,837 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 00:53:05,837 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 00:53:05,838 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 00:53:05,840 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 00:53:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 00:53:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 00:53:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 00:53:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 00:53:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 00:53:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 00:53:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 00:53:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 00:53:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 00:53:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 00:53:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 00:53:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 00:53:05,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 00:53:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 00:53:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 00:53:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 00:53:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 00:53:05,886 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 00:53:05,887 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 00:53:05,999 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 00:53:06,003 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 00:53:06,003 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-31 00:53:06,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:53:06 BoogieIcfgContainer [2022-01-31 00:53:06,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 00:53:06,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 00:53:06,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 00:53:06,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 00:53:06,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 12:53:05" (1/3) ... [2022-01-31 00:53:06,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f50c6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:53:06, skipping insertion in model container [2022-01-31 00:53:06,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:05" (2/3) ... [2022-01-31 00:53:06,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f50c6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:53:06, skipping insertion in model container [2022-01-31 00:53:06,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:53:06" (3/3) ... [2022-01-31 00:53:06,024 INFO L111 eAbstractionObserver]: Analyzing ICFG condg.c [2022-01-31 00:53:06,027 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 00:53:06,027 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 00:53:06,109 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 00:53:06,115 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 00:53:06,116 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 00:53:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 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 00:53:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 00:53:06,136 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:53:06,136 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] [2022-01-31 00:53:06,137 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:53:06,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:53:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash 889499042, now seen corresponding path program 1 times [2022-01-31 00:53:06,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:53:06,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891018274] [2022-01-31 00:53:06,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:06,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:53:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:06,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:53:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:06,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:53:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:06,347 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 00:53:06,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:53:06,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891018274] [2022-01-31 00:53:06,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891018274] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 00:53:06,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 00:53:06,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 00:53:06,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645994388] [2022-01-31 00:53:06,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 00:53:06,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 00:53:06,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:53:06,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 00:53:06,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 00:53:06,384 INFO L87 Difference]: Start difference. First operand has 38 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 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 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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 00:53:06,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:53:06,458 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2022-01-31 00:53:06,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 00:53:06,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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 24 [2022-01-31 00:53:06,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:53:06,471 INFO L225 Difference]: With dead ends: 66 [2022-01-31 00:53:06,471 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 00:53:06,473 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 00:53:06,480 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 00:53:06,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 47 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 00:53:06,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 00:53:06,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-01-31 00:53:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 00:53:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-01-31 00:53:06,506 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 24 [2022-01-31 00:53:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:53:06,506 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-01-31 00:53:06,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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 00:53:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-01-31 00:53:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-31 00:53:06,508 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:53:06,508 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] [2022-01-31 00:53:06,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 00:53:06,508 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:53:06,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:53:06,509 INFO L85 PathProgramCache]: Analyzing trace with hash -390364636, now seen corresponding path program 1 times [2022-01-31 00:53:06,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:53:06,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904690082] [2022-01-31 00:53:06,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:06,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:53:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:06,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:53:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:06,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:53:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:06,583 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 00:53:06,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:53:06,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904690082] [2022-01-31 00:53:06,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904690082] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 00:53:06,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 00:53:06,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 00:53:06,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585055531] [2022-01-31 00:53:06,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 00:53:06,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 00:53:06,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:53:06,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 00:53:06,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 00:53:06,586 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 00:53:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:53:06,672 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2022-01-31 00:53:06,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 00:53:06,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 24 [2022-01-31 00:53:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:53:06,675 INFO L225 Difference]: With dead ends: 62 [2022-01-31 00:53:06,675 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 00:53:06,676 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 00:53:06,676 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 50 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:53:06,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 28 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 00:53:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 00:53:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-01-31 00:53:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 00:53:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-01-31 00:53:06,684 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2022-01-31 00:53:06,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:53:06,685 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-01-31 00:53:06,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 00:53:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-01-31 00:53:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 00:53:06,686 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:53:06,686 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, 1] [2022-01-31 00:53:06,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 00:53:06,686 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:53:06,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:53:06,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1893085318, now seen corresponding path program 1 times [2022-01-31 00:53:06,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:53:06,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877763391] [2022-01-31 00:53:06,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:06,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:53:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:06,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:53:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:07,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:53:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:07,019 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 00:53:07,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:53:07,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877763391] [2022-01-31 00:53:07,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877763391] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:53:07,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103359539] [2022-01-31 00:53:07,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:07,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:53:07,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:53:07,022 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 00:53:07,024 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 00:53:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:07,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-31 00:53:07,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:53:07,219 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 00:53:07,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:07,310 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 00:53:07,375 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 00:53:07,417 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 00:53:07,450 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 00:53:07,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:53:07,582 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_43 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_43) c_main_~a~0.base) c_main_~a~0.offset)) 0)) is different from false [2022-01-31 00:53:07,630 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:53:07,631 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 24 treesize of output 25 [2022-01-31 00:53:07,639 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:53:07,639 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 38 treesize of output 38 [2022-01-31 00:53:07,644 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 11 treesize of output 9 [2022-01-31 00:53:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-31 00:53:07,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103359539] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:53:07,722 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:53:07,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 23 [2022-01-31 00:53:07,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092012956] [2022-01-31 00:53:07,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:53:07,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 00:53:07,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:53:07,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 00:53:07,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=397, Unknown=1, NotChecked=40, Total=506 [2022-01-31 00:53:07,727 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:53:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:53:08,102 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-01-31 00:53:08,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 00:53:08,103 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-01-31 00:53:08,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:53:08,106 INFO L225 Difference]: With dead ends: 67 [2022-01-31 00:53:08,106 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 00:53:08,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=696, Unknown=1, NotChecked=54, Total=870 [2022-01-31 00:53:08,110 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 60 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 00:53:08,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 182 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 461 Invalid, 0 Unknown, 58 Unchecked, 0.2s Time] [2022-01-31 00:53:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 00:53:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2022-01-31 00:53:08,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 40 states have internal predecessors, (48), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:53:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-01-31 00:53:08,131 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 31 [2022-01-31 00:53:08,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:53:08,134 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-01-31 00:53:08,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:53:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-01-31 00:53:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 00:53:08,136 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:53:08,136 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, 1] [2022-01-31 00:53:08,156 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 00:53:08,347 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 00:53:08,348 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:53:08,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:53:08,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1721823608, now seen corresponding path program 1 times [2022-01-31 00:53:08,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:53:08,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757725209] [2022-01-31 00:53:08,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:08,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:53:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:08,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:53:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:08,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:53:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:53:08,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:53:08,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757725209] [2022-01-31 00:53:08,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757725209] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:53:08,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121802479] [2022-01-31 00:53:08,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:08,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:53:08,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:53:08,712 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 00:53:08,740 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 00:53:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:08,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 26 conjunts are in the unsatisfiable core [2022-01-31 00:53:08,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:53:08,872 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 00:53:08,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:08,909 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 23 treesize of output 22 [2022-01-31 00:53:09,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:09,072 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 00:53:09,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:09,149 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 30 treesize of output 14 [2022-01-31 00:53:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:53:09,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:53:09,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:53:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:53:09,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121802479] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:53:09,315 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:53:09,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2022-01-31 00:53:09,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368774672] [2022-01-31 00:53:09,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:53:09,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 00:53:09,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:53:09,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 00:53:09,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2022-01-31 00:53:09,316 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 00:53:09,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:53:09,625 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2022-01-31 00:53:09,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 00:53:09,625 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-01-31 00:53:09,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:53:09,627 INFO L225 Difference]: With dead ends: 94 [2022-01-31 00:53:09,628 INFO L226 Difference]: Without dead ends: 80 [2022-01-31 00:53:09,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2022-01-31 00:53:09,629 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 00:53:09,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 110 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 388 Invalid, 0 Unknown, 9 Unchecked, 0.2s Time] [2022-01-31 00:53:09,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-31 00:53:09,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 58. [2022-01-31 00:53:09,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:53:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2022-01-31 00:53:09,636 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 31 [2022-01-31 00:53:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:53:09,636 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2022-01-31 00:53:09,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 00:53:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2022-01-31 00:53:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 00:53:09,637 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:53:09,637 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, 1] [2022-01-31 00:53:09,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-31 00:53:09,856 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 00:53:09,856 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:53:09,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:53:09,857 INFO L85 PathProgramCache]: Analyzing trace with hash -402281846, now seen corresponding path program 2 times [2022-01-31 00:53:09,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:53:09,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259846489] [2022-01-31 00:53:09,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:09,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:53:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:09,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:53:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:09,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:53:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:09,927 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 00:53:09,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:53:09,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259846489] [2022-01-31 00:53:09,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259846489] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:53:09,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050966168] [2022-01-31 00:53:09,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 00:53:09,927 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:53:09,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:53:09,928 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 00:53:09,947 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 00:53:10,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 00:53:10,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:53:10,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 00:53:10,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:53:10,113 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 00:53:10,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:53:10,172 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 00:53:10,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050966168] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:53:10,172 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:53:10,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-01-31 00:53:10,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945229067] [2022-01-31 00:53:10,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:53:10,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 00:53:10,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:53:10,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 00:53:10,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-01-31 00:53:10,175 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 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 00:53:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:53:10,481 INFO L93 Difference]: Finished difference Result 117 states and 140 transitions. [2022-01-31 00:53:10,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 00:53:10,482 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 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 33 [2022-01-31 00:53:10,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:53:10,483 INFO L225 Difference]: With dead ends: 117 [2022-01-31 00:53:10,483 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 00:53:10,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-01-31 00:53:10,484 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 132 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 00:53:10,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 90 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 00:53:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 00:53:10,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-01-31 00:53:10,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 46 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:53:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-01-31 00:53:10,490 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 33 [2022-01-31 00:53:10,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:53:10,490 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-01-31 00:53:10,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 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 00:53:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-01-31 00:53:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 00:53:10,491 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:53:10,491 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, 1] [2022-01-31 00:53:10,516 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 00:53:10,691 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 00:53:10,692 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:53:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:53:10,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1880636774, now seen corresponding path program 1 times [2022-01-31 00:53:10,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:53:10,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602472403] [2022-01-31 00:53:10,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:10,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:53:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:10,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:53:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:10,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:53:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 00:53:10,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:53:10,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602472403] [2022-01-31 00:53:10,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602472403] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:53:10,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100875596] [2022-01-31 00:53:10,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:10,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:53:10,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:53:10,772 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 00:53:10,773 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 00:53:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:10,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-31 00:53:10,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:53:10,840 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 00:53:10,869 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 00:53:10,888 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 15 treesize of output 17 [2022-01-31 00:53:10,895 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 8 [2022-01-31 00:53:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 00:53:10,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:53:10,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_150 (Array Int Int))) (= (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_150) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) |c_main_#t~mem11|)) is different from false [2022-01-31 00:53:10,931 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_150 (Array Int Int))) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_150) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) is different from false [2022-01-31 00:53:10,947 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:53:10,947 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 18 treesize of output 19 [2022-01-31 00:53:10,949 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 18 treesize of output 14 [2022-01-31 00:53:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 5 not checked. [2022-01-31 00:53:10,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100875596] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:53:10,980 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:53:10,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2022-01-31 00:53:10,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342777946] [2022-01-31 00:53:10,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:53:10,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 00:53:10,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:53:10,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 00:53:10,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=43, Unknown=2, NotChecked=26, Total=90 [2022-01-31 00:53:10,982 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 00:53:11,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:53:11,069 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-01-31 00:53:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 00:53:11,069 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2022-01-31 00:53:11,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:53:11,070 INFO L225 Difference]: With dead ends: 70 [2022-01-31 00:53:11,070 INFO L226 Difference]: Without dead ends: 56 [2022-01-31 00:53:11,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=68, Unknown=2, NotChecked=34, Total=132 [2022-01-31 00:53:11,071 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 11 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:53:11,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 109 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2022-01-31 00:53:11,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-31 00:53:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-01-31 00:53:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.173913043478261) internal successors, (54), 47 states have internal predecessors, (54), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:53:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-01-31 00:53:11,076 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 38 [2022-01-31 00:53:11,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:53:11,076 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-01-31 00:53:11,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 00:53:11,076 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-01-31 00:53:11,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 00:53:11,077 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:53:11,077 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, 1] [2022-01-31 00:53:11,105 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 00:53:11,294 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 00:53:11,294 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:53:11,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:53:11,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1200578404, now seen corresponding path program 3 times [2022-01-31 00:53:11,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:53:11,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395850761] [2022-01-31 00:53:11,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:11,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:53:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:11,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:53:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:11,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:53:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 00:53:11,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:53:11,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395850761] [2022-01-31 00:53:11,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395850761] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:53:11,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459810400] [2022-01-31 00:53:11,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 00:53:11,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:53:11,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:53:12,004 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 00:53:12,012 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 00:53:12,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 00:53:12,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:53:12,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-31 00:53:12,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:53:12,088 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 00:53:12,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:12,124 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 23 treesize of output 22 [2022-01-31 00:53:12,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:12,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:12,196 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 00:53:12,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:12,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:12,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:53:12,341 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 00:53:12,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:12,426 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 00:53:12,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:12,514 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 00:53:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 00:53:12,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:53:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 00:53:13,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459810400] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:53:13,175 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:53:13,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 39 [2022-01-31 00:53:13,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644125086] [2022-01-31 00:53:13,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:53:13,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-31 00:53:13,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:53:13,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-31 00:53:13,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2022-01-31 00:53:13,178 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 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 00:53:14,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:53:14,499 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-01-31 00:53:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 00:53:14,499 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 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 38 [2022-01-31 00:53:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:53:14,500 INFO L225 Difference]: With dead ends: 100 [2022-01-31 00:53:14,500 INFO L226 Difference]: Without dead ends: 83 [2022-01-31 00:53:14,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=345, Invalid=2411, Unknown=0, NotChecked=0, Total=2756 [2022-01-31 00:53:14,502 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 00:53:14,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 158 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 703 Invalid, 0 Unknown, 44 Unchecked, 0.5s Time] [2022-01-31 00:53:14,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-31 00:53:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2022-01-31 00:53:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 60 states have internal predecessors, (70), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:53:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-01-31 00:53:14,508 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 38 [2022-01-31 00:53:14,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:53:14,509 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-01-31 00:53:14,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 38 states have internal predecessors, (62), 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 00:53:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-01-31 00:53:14,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 00:53:14,509 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:53:14,509 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, 1] [2022-01-31 00:53:14,529 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 00:53:14,726 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 00:53:14,726 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:53:14,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:53:14,727 INFO L85 PathProgramCache]: Analyzing trace with hash -30646630, now seen corresponding path program 4 times [2022-01-31 00:53:14,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:53:14,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174594673] [2022-01-31 00:53:14,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:14,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:53:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:14,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:53:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:14,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:53:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 00:53:14,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:53:14,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174594673] [2022-01-31 00:53:14,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174594673] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:53:14,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232898162] [2022-01-31 00:53:14,811 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 00:53:14,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:53:14,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:53:14,812 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 00:53:14,814 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 00:53:14,855 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 00:53:14,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:53:14,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 00:53:14,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:53:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 00:53:14,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:53:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 00:53:15,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232898162] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:53:15,016 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:53:15,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 00:53:15,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913562418] [2022-01-31 00:53:15,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:53:15,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 00:53:15,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:53:15,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 00:53:15,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 00:53:15,017 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 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 00:53:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:53:15,335 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2022-01-31 00:53:15,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 00:53:15,335 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 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 40 [2022-01-31 00:53:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:53:15,336 INFO L225 Difference]: With dead ends: 141 [2022-01-31 00:53:15,336 INFO L226 Difference]: Without dead ends: 109 [2022-01-31 00:53:15,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-01-31 00:53:15,337 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 77 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 00:53:15,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 123 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 00:53:15,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-31 00:53:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2022-01-31 00:53:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.173913043478261) internal successors, (81), 70 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:53:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2022-01-31 00:53:15,346 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 40 [2022-01-31 00:53:15,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:53:15,347 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2022-01-31 00:53:15,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 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 00:53:15,351 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2022-01-31 00:53:15,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 00:53:15,352 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:53:15,352 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:53:15,385 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 00:53:15,571 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 00:53:15,571 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:53:15,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:53:15,572 INFO L85 PathProgramCache]: Analyzing trace with hash -686819702, now seen corresponding path program 2 times [2022-01-31 00:53:15,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:53:15,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024262043] [2022-01-31 00:53:15,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:15,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:53:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:15,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:53:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:15,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:53:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 00:53:15,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:53:15,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024262043] [2022-01-31 00:53:15,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024262043] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:53:15,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374109704] [2022-01-31 00:53:15,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 00:53:15,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:53:15,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:53:15,643 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 00:53:15,644 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 00:53:15,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 00:53:15,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:53:15,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 00:53:15,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:53:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 00:53:15,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:53:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 00:53:15,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374109704] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:53:15,873 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:53:15,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 00:53:15,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316854502] [2022-01-31 00:53:15,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:53:15,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 00:53:15,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:53:15,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 00:53:15,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 00:53:15,876 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 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 00:53:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:53:16,113 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2022-01-31 00:53:16,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 00:53:16,113 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 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 41 [2022-01-31 00:53:16,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:53:16,115 INFO L225 Difference]: With dead ends: 135 [2022-01-31 00:53:16,115 INFO L226 Difference]: Without dead ends: 98 [2022-01-31 00:53:16,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-01-31 00:53:16,118 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 91 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 00:53:16,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 92 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 00:53:16,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-01-31 00:53:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 80. [2022-01-31 00:53:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 69 states have internal predecessors, (78), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:53:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-01-31 00:53:16,134 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 41 [2022-01-31 00:53:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:53:16,134 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-01-31 00:53:16,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 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 00:53:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-01-31 00:53:16,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 00:53:16,135 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:53:16,135 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:53:16,154 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 00:53:16,347 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 00:53:16,348 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:53:16,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:53:16,348 INFO L85 PathProgramCache]: Analyzing trace with hash -815729870, now seen corresponding path program 1 times [2022-01-31 00:53:16,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:53:16,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933013018] [2022-01-31 00:53:16,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:16,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:53:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:16,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:53:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:16,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:53:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:16,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 00:53:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 00:53:16,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:53:16,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933013018] [2022-01-31 00:53:16,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933013018] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:53:16,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50271233] [2022-01-31 00:53:16,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:16,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:53:16,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:53:16,604 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 00:53:16,617 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 00:53:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:16,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-31 00:53:16,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:53:16,701 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 00:53:16,707 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 00:53:16,730 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 23 treesize of output 22 [2022-01-31 00:53:16,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:16,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-01-31 00:53:16,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:16,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:53:16,912 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 52 treesize of output 42 [2022-01-31 00:53:16,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:17,000 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 54 treesize of output 38 [2022-01-31 00:53:17,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:17,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:53:17,160 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 42 [2022-01-31 00:53:17,306 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 53 treesize of output 30 [2022-01-31 00:53:18,544 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 35 treesize of output 15 [2022-01-31 00:53:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:53:18,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:53:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:53:36,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50271233] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:53:36,514 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:53:36,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 20] total 48 [2022-01-31 00:53:36,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380529959] [2022-01-31 00:53:36,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:53:36,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-31 00:53:36,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:53:36,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-31 00:53:36,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2049, Unknown=10, NotChecked=0, Total=2256 [2022-01-31 00:53:36,516 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 48 states, 47 states have (on average 1.9574468085106382) internal successors, (92), 45 states have internal predecessors, (92), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 00:53:46,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:53:46,262 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-01-31 00:53:46,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 00:53:46,263 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.9574468085106382) internal successors, (92), 45 states have internal predecessors, (92), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 46 [2022-01-31 00:53:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:53:46,264 INFO L225 Difference]: With dead ends: 108 [2022-01-31 00:53:46,264 INFO L226 Difference]: Without dead ends: 91 [2022-01-31 00:53:46,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=428, Invalid=3464, Unknown=14, NotChecked=0, Total=3906 [2022-01-31 00:53:46,265 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 42 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 337 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:53:46,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 377 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 317 Invalid, 0 Unknown, 337 Unchecked, 0.1s Time] [2022-01-31 00:53:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-01-31 00:53:46,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2022-01-31 00:53:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 69 states have internal predecessors, (77), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:53:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-01-31 00:53:46,272 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 46 [2022-01-31 00:53:46,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:53:46,272 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-01-31 00:53:46,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.9574468085106382) internal successors, (92), 45 states have internal predecessors, (92), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 00:53:46,273 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-01-31 00:53:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 00:53:46,273 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:53:46,273 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:53:46,309 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 00:53:46,473 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 00:53:46,474 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:53:46,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:53:46,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1890889524, now seen corresponding path program 1 times [2022-01-31 00:53:46,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:53:46,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797419954] [2022-01-31 00:53:46,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:46,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:53:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:46,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:53:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:46,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:53:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:46,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 00:53:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-31 00:53:46,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:53:46,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797419954] [2022-01-31 00:53:46,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797419954] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:53:46,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535677139] [2022-01-31 00:53:46,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:46,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:53:46,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:53:46,531 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 00:53:46,532 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 00:53:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:46,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-31 00:53:46,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:53:46,608 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 00:53:46,635 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 00:53:46,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 00:53:46,655 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 00:53:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 00:53:46,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:53:46,716 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array Int Int))) (= (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_377) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) |c_main_#t~mem11|)) is different from false [2022-01-31 00:53:46,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array Int Int))) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_377) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) is different from false [2022-01-31 00:53:46,734 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:53:46,734 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 18 treesize of output 19 [2022-01-31 00:53:46,736 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 18 treesize of output 14 [2022-01-31 00:53:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2022-01-31 00:53:46,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535677139] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:53:46,772 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:53:46,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2022-01-31 00:53:46,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321867563] [2022-01-31 00:53:46,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:53:46,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 00:53:46,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:53:46,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 00:53:46,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=43, Unknown=2, NotChecked=26, Total=90 [2022-01-31 00:53:46,773 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 00:53:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:53:46,881 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2022-01-31 00:53:46,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 00:53:46,882 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-01-31 00:53:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:53:46,883 INFO L225 Difference]: With dead ends: 96 [2022-01-31 00:53:46,883 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 00:53:46,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=68, Unknown=2, NotChecked=34, Total=132 [2022-01-31 00:53:46,883 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:53:46,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 116 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2022-01-31 00:53:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 00:53:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-01-31 00:53:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 00:53:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-01-31 00:53:46,888 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 46 [2022-01-31 00:53:46,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:53:46,888 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-01-31 00:53:46,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 00:53:46,888 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-01-31 00:53:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 00:53:46,889 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:53:46,889 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, 1] [2022-01-31 00:53:46,913 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 00:53:47,113 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 00:53:47,113 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:53:47,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:53:47,114 INFO L85 PathProgramCache]: Analyzing trace with hash -915711794, now seen corresponding path program 3 times [2022-01-31 00:53:47,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:53:47,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962433967] [2022-01-31 00:53:47,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:53:47,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:53:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:47,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:53:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:47,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:53:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:53:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 00:53:47,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:53:47,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962433967] [2022-01-31 00:53:47,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962433967] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:53:47,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202585971] [2022-01-31 00:53:47,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 00:53:47,527 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:53:47,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:53:47,531 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 00:53:47,533 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 00:53:47,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-31 00:53:47,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:53:47,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-31 00:53:47,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:53:47,633 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 00:53:47,643 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 15 treesize of output 11 [2022-01-31 00:53:47,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:47,685 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 00:53:47,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:53:47,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 00:53:47,796 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 00:53:47,815 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 00:53:47,835 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 00:53:47,930 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 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 00:53:47,991 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 00:53:47,991 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 23 treesize of output 28 [2022-01-31 00:53:48,103 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 00:53:48,104 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 32 [2022-01-31 00:53:48,187 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 00:53:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 00:53:48,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:53:50,450 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_135 Int) (v_ArrVal_443 Int) (main_~i~0 Int) (v_ArrVal_441 Int)) (or (< (+ v_main_~i~0_135 1) c_~N~0) (not (<= v_main_~i~0_135 (+ main_~i~0 1))) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset) 0))) is different from false [2022-01-31 00:53:52,516 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_135 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (= 0 (select (store (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset)) (< (+ v_main_~i~0_135 1) c_~N~0) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) is different from false [2022-01-31 00:53:54,564 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_135 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (= (select (store (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) (- 1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset) 0) (< (+ v_main_~i~0_135 1) c_~N~0) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) is different from false [2022-01-31 00:53:54,625 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_135 Int) (v_ArrVal_443 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (< (+ v_main_~i~0_135 1) c_~N~0) (= (select (store (store (let ((.cse0 (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_437) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset) 0) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) is different from false [2022-01-31 00:53:54,814 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (v_main_~i~0_135 Int) (v_ArrVal_443 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (<= (+ v_main_~i~0_135 1) c_main_~i~0) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_434)) |c_main_~#sum~0.base| v_ArrVal_437) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) (- 1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset)) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) is different from false [2022-01-31 00:53:54,887 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_144 Int)) (or (forall ((v_ArrVal_434 Int) (v_main_~i~0_135 Int) (v_ArrVal_443 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (<= (+ v_main_~i~0_135 1) v_main_~i~0_144) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_434)) |c_main_~#sum~0.base| v_ArrVal_437) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset)) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_144)))) is different from false [2022-01-31 00:53:54,966 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (v_main_~i~0_135 Int) (v_main_~i~0_144 Int) (v_ArrVal_443 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (<= (+ v_main_~i~0_135 1) v_main_~i~0_144) (= (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_431) (+ (* 4 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_434)) |c_main_~#sum~0.base| v_ArrVal_437) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (select .cse0 c_main_~a~0.offset) (- 1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset) 0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_144)) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) is different from false [2022-01-31 00:53:55,140 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_145 Int)) (or (forall ((v_ArrVal_434 Int) (v_main_~i~0_135 Int) (v_main_~i~0_144 Int) (v_ArrVal_443 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_145)) v_ArrVal_431) (+ (* 4 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_434)) |c_main_~#sum~0.base| v_ArrVal_437) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset)) (<= (+ v_main_~i~0_135 1) v_main_~i~0_144) (not (<= (+ v_main_~i~0_145 1) v_main_~i~0_144)) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_145)))) is different from false [2022-01-31 00:53:55,178 INFO L353 Elim1Store]: treesize reduction 122, result has 23.3 percent of original size [2022-01-31 00:53:55,178 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 3 case distinctions, treesize of input 88 treesize of output 73 [2022-01-31 00:53:55,184 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 78 treesize of output 72 [2022-01-31 00:53:55,192 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 162 treesize of output 158 [2022-01-31 00:53:55,205 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:53:55,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 90 [2022-01-31 00:53:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 24 not checked. [2022-01-31 00:53:55,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202585971] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:53:55,444 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:53:55,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 20] total 43 [2022-01-31 00:53:55,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500554911] [2022-01-31 00:53:55,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:53:55,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-31 00:53:55,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:53:55,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-31 00:53:55,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1044, Unknown=8, NotChecked=584, Total=1806 [2022-01-31 00:53:55,447 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 43 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 40 states have internal predecessors, (88), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:53:57,504 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_145 Int)) (or (forall ((v_ArrVal_434 Int) (v_main_~i~0_135 Int) (v_main_~i~0_144 Int) (v_ArrVal_443 Int) (v_ArrVal_431 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_145)) v_ArrVal_431) (+ (* 4 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_434)) |c_main_~#sum~0.base| v_ArrVal_437) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset)) (<= (+ v_main_~i~0_135 1) v_main_~i~0_144) (not (<= (+ v_main_~i~0_145 1) v_main_~i~0_144)) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_145)))) (= (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 00:53:59,520 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_144 Int)) (or (forall ((v_ArrVal_434 Int) (v_main_~i~0_135 Int) (v_ArrVal_443 Int) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_441 Int) (v_main_~i~0_137 Int)) (or (<= (+ v_main_~i~0_135 1) v_main_~i~0_144) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_144) c_main_~a~0.offset) v_ArrVal_434)) |c_main_~#sum~0.base| v_ArrVal_437) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_137)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset)) (not (<= v_main_~i~0_135 (+ v_main_~i~0_137 1))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_144)))) (= (+ (* c_main_~i~0 4) c_main_~a~0.offset (- 4)) 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| c_main_~a~0.base) 0) 1)) is different from false [2022-01-31 00:54:00,487 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (= (select .cse0 (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 0) (< 2 c_~N~0) (= c_main_~i~0 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_135 Int) (v_ArrVal_443 Int) (main_~i~0 Int) (v_ArrVal_441 Int)) (or (< (+ v_main_~i~0_135 1) c_~N~0) (not (<= v_main_~i~0_135 (+ main_~i~0 1))) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset) 0))) (= (select .cse0 c_main_~a~0.offset) 0))) is different from false [2022-01-31 00:54:01,124 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (< 2 c_~N~0) (= (select .cse0 0) 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_135 Int) (v_ArrVal_443 Int) (main_~i~0 Int) (v_ArrVal_441 Int)) (or (< (+ v_main_~i~0_135 1) c_~N~0) (not (<= v_main_~i~0_135 (+ main_~i~0 1))) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_441) (+ (* 4 v_main_~i~0_135) c_main_~a~0.offset) v_ArrVal_443) c_main_~a~0.offset) 0))) (= (select .cse0 c_main_~a~0.offset) 0))) is different from false [2022-01-31 00:54:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:54:01,456 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2022-01-31 00:54:01,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 00:54:01,457 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 40 states have internal predecessors, (88), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-01-31 00:54:01,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:54:01,458 INFO L225 Difference]: With dead ends: 86 [2022-01-31 00:54:01,458 INFO L226 Difference]: Without dead ends: 84 [2022-01-31 00:54:01,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 73 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=331, Invalid=1961, Unknown=12, NotChecked=1236, Total=3540 [2022-01-31 00:54:01,459 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 78 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 509 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 00:54:01,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 226 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 667 Invalid, 0 Unknown, 509 Unchecked, 0.3s Time] [2022-01-31 00:54:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-31 00:54:01,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2022-01-31 00:54:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 62 states have internal predecessors, (73), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:54:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2022-01-31 00:54:01,465 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 45 [2022-01-31 00:54:01,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:54:01,465 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2022-01-31 00:54:01,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 40 states have internal predecessors, (88), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:54:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-01-31 00:54:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 00:54:01,465 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:54:01,465 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, 1] [2022-01-31 00:54:01,487 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 00:54:01,679 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 00:54:01,679 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:54:01,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:54:01,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1937410034, now seen corresponding path program 2 times [2022-01-31 00:54:01,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:54:01,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559312273] [2022-01-31 00:54:01,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:54:01,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:54:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:01,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:54:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:01,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:54:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-31 00:54:01,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:54:01,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559312273] [2022-01-31 00:54:01,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559312273] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:54:01,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951338641] [2022-01-31 00:54:01,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 00:54:01,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:54:01,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:54:01,748 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 00:54:01,749 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 00:54:01,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 00:54:01,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:54:01,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-31 00:54:01,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:54:01,873 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 00:54:01,938 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 00:54:01,955 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 15 treesize of output 17 [2022-01-31 00:54:01,970 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 15 treesize of output 17 [2022-01-31 00:54:01,988 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 8 [2022-01-31 00:54:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 00:54:01,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:54:02,018 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (not (= c_~N~0 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_498) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) is different from false [2022-01-31 00:54:02,027 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (= (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_498) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) |c_main_#t~mem11|)) is different from false [2022-01-31 00:54:02,031 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_498) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) is different from false [2022-01-31 00:54:02,041 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:54:02,042 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 18 treesize of output 19 [2022-01-31 00:54:02,043 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 18 treesize of output 14 [2022-01-31 00:54:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 12 not checked. [2022-01-31 00:54:02,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951338641] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:54:02,079 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:54:02,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 14 [2022-01-31 00:54:02,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147643602] [2022-01-31 00:54:02,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:54:02,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 00:54:02,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:54:02,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 00:54:02,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=88, Unknown=3, NotChecked=60, Total=182 [2022-01-31 00:54:02,080 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 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 00:54:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:54:02,275 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2022-01-31 00:54:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 00:54:02,276 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 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 45 [2022-01-31 00:54:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:54:02,289 INFO L225 Difference]: With dead ends: 107 [2022-01-31 00:54:02,289 INFO L226 Difference]: Without dead ends: 93 [2022-01-31 00:54:02,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 88 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=188, Unknown=3, NotChecked=90, Total=342 [2022-01-31 00:54:02,291 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:54:02,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 136 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 283 Invalid, 0 Unknown, 153 Unchecked, 0.1s Time] [2022-01-31 00:54:02,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-31 00:54:02,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2022-01-31 00:54:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.203125) internal successors, (77), 65 states have internal predecessors, (77), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:54:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2022-01-31 00:54:02,302 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 45 [2022-01-31 00:54:02,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:54:02,302 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2022-01-31 00:54:02,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 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 00:54:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2022-01-31 00:54:02,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 00:54:02,303 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:54:02,303 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, 1] [2022-01-31 00:54:02,320 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 00:54:02,504 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 00:54:02,504 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:54:02,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:54:02,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1257351664, now seen corresponding path program 5 times [2022-01-31 00:54:02,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:54:02,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585972799] [2022-01-31 00:54:02,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:54:02,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:54:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:03,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:54:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:03,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:54:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:03,140 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-31 00:54:03,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:54:03,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585972799] [2022-01-31 00:54:03,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585972799] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:54:03,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046786952] [2022-01-31 00:54:03,140 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 00:54:03,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:54:03,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:54:03,149 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 00:54:03,150 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 00:54:03,224 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 00:54:03,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:54:03,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 57 conjunts are in the unsatisfiable core [2022-01-31 00:54:03,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:54:03,246 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 00:54:03,252 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 00:54:03,264 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 23 treesize of output 22 [2022-01-31 00:54:03,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:03,299 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 00:54:03,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:03,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:03,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-01-31 00:54:03,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:03,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:03,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:54:03,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:03,522 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 58 treesize of output 51 [2022-01-31 00:54:03,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:03,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:03,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:54:03,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:03,626 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 00:54:03,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:03,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:54:03,754 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 58 treesize of output 47 [2022-01-31 00:54:03,896 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 39 treesize of output 35 [2022-01-31 00:54:03,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:03,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:03,900 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 18 treesize of output 10 [2022-01-31 00:54:03,945 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 17 treesize of output 9 [2022-01-31 00:54:04,043 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 00:54:04,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:54:04,548 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (<= 3 c_main_~i~0))) (and (or (forall ((v_ArrVal_564 (Array Int Int))) (<= (select (select (store (let ((.cse5 (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) 1))) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base .cse5))) (store .cse0 |c_main_~#sum~0.base| (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (store .cse1 |c_main_~#sum~0.offset| (let ((.cse2 (select .cse5 c_main_~a~0.offset)) (.cse4 (select .cse1 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ .cse2 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse3 .cse4)))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (+ c_main_~i~0 1))) .cse6) (or (forall ((v_ArrVal_564 (Array Int Int))) (<= 3 (select (select (store (let ((.cse12 (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) 1))) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base .cse12))) (store .cse7 |c_main_~#sum~0.base| (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (store .cse8 |c_main_~#sum~0.offset| (let ((.cse9 (select .cse12 c_main_~a~0.offset)) (.cse11 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse10 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse9 .cse11))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ .cse9 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse9 .cse10 .cse11))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse10 .cse11)))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) .cse6))) is different from false [2022-01-31 00:54:04,562 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 2 c_main_~i~0))) (and (or .cse0 (forall ((v_ArrVal_564 (Array Int Int))) (<= 3 (select (select (store (let ((.cse6 (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4) 1))) (let ((.cse1 (store |c_#memory_int| c_main_~a~0.base .cse6))) (store .cse1 |c_main_~#sum~0.base| (let ((.cse2 (select .cse1 |c_main_~#sum~0.base|))) (store .cse2 |c_main_~#sum~0.offset| (let ((.cse3 (select .cse2 |c_main_~#sum~0.offset|)) (.cse4 (select .cse6 c_main_~a~0.offset))) (let ((.cse5 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse3 .cse4 .cse5)))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (or .cse0 (forall ((v_ArrVal_564 (Array Int Int))) (<= (select (select (store (let ((.cse12 (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4) 1))) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base .cse12))) (store .cse7 |c_main_~#sum~0.base| (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (store .cse8 |c_main_~#sum~0.offset| (let ((.cse9 (select .cse8 |c_main_~#sum~0.offset|)) (.cse10 (select .cse12 c_main_~a~0.offset))) (let ((.cse11 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse9 .cse10))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse9 .cse10 .cse11))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse9 .cse10 .cse11)))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (+ c_main_~i~0 2)))))) is different from false [2022-01-31 00:54:04,581 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 2 c_main_~i~0))) (and (or .cse0 (forall ((v_ArrVal_564 (Array Int Int))) (<= 3 (select (select (store (let ((.cse6 (let ((.cse7 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse7 c_main_~a~0.offset) 1) (+ .cse7 c_main_~a~0.offset 4) 1)))) (let ((.cse1 (store |c_#memory_int| c_main_~a~0.base .cse6))) (store .cse1 |c_main_~#sum~0.base| (let ((.cse2 (select .cse1 |c_main_~#sum~0.base|))) (store .cse2 |c_main_~#sum~0.offset| (let ((.cse4 (select .cse6 c_main_~a~0.offset)) (.cse5 (select .cse2 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse4 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ .cse3 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse4 .cse5)))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))) (or .cse0 (forall ((v_ArrVal_564 (Array Int Int))) (<= (select (select (store (let ((.cse13 (let ((.cse14 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse14 c_main_~a~0.offset) 1) (+ .cse14 c_main_~a~0.offset 4) 1)))) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base .cse13))) (store .cse8 |c_main_~#sum~0.base| (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (store .cse9 |c_main_~#sum~0.offset| (let ((.cse11 (select .cse13 c_main_~a~0.offset)) (.cse12 (select .cse9 |c_main_~#sum~0.offset|))) (let ((.cse10 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse11 .cse12))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ .cse10 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse10 .cse11 .cse12))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse11 .cse12)))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (+ c_main_~i~0 2)))))) is different from false [2022-01-31 00:54:04,629 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (<= 1 c_main_~i~0))) (and (or (forall ((v_ArrVal_564 (Array Int Int))) (<= 3 (select (select (store (let ((.cse5 (let ((.cse6 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse6 c_main_~a~0.offset 4) 1) (+ .cse6 c_main_~a~0.offset 8) 1)))) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base .cse5))) (store .cse0 |c_main_~#sum~0.base| (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (store .cse1 |c_main_~#sum~0.offset| (let ((.cse2 (select .cse5 c_main_~a~0.offset)) (.cse4 (select .cse1 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse2 .cse3 .cse4)))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) .cse7) (or .cse7 (forall ((v_ArrVal_564 (Array Int Int))) (<= (select (select (store (let ((.cse13 (let ((.cse14 (* c_main_~i~0 4))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse14 c_main_~a~0.offset 4) 1) (+ .cse14 c_main_~a~0.offset 8) 1)))) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base .cse13))) (store .cse8 |c_main_~#sum~0.base| (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (store .cse9 |c_main_~#sum~0.offset| (let ((.cse10 (select .cse13 c_main_~a~0.offset)) (.cse12 (select .cse9 |c_main_~#sum~0.offset|))) (let ((.cse11 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse10 .cse12))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse10 .cse11 .cse12))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) .cse10 .cse11 .cse12)))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (+ c_main_~i~0 3)))))) is different from false [2022-01-31 00:54:04,668 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 1 c_main_~i~0))) (and (or .cse0 (forall ((v_ArrVal_564 (Array Int Int))) (<= (select (select (store (let ((.cse6 (let ((.cse7 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse7 c_main_~a~0.offset) 1) (+ .cse7 c_main_~a~0.offset 4) 1) (+ .cse7 c_main_~a~0.offset 8) 1)))) (let ((.cse1 (store |c_#memory_int| c_main_~a~0.base .cse6))) (store .cse1 |c_main_~#sum~0.base| (let ((.cse2 (select .cse1 |c_main_~#sum~0.base|))) (store .cse2 |c_main_~#sum~0.offset| (let ((.cse3 (select .cse2 |c_main_~#sum~0.offset|)) (.cse5 (select .cse6 c_main_~a~0.offset))) (let ((.cse4 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ .cse3 .cse4 .cse5 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 .cse4 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (+ c_main_~i~0 3)))) (or (forall ((v_ArrVal_564 (Array Int Int))) (<= 3 (select (select (store (let ((.cse13 (let ((.cse14 (* c_main_~i~0 4))) (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse14 c_main_~a~0.offset) 1) (+ .cse14 c_main_~a~0.offset 4) 1) (+ .cse14 c_main_~a~0.offset 8) 1)))) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base .cse13))) (store .cse8 |c_main_~#sum~0.base| (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (store .cse9 |c_main_~#sum~0.offset| (let ((.cse10 (select .cse9 |c_main_~#sum~0.offset|)) (.cse12 (select .cse13 c_main_~a~0.offset))) (let ((.cse11 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse10 .cse12))) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) (+ .cse10 .cse11 .cse12 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse10 .cse11 .cse12))) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))))))))) c_main_~a~0.base v_ArrVal_564) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) .cse0))) is different from false [2022-01-31 00:54:04,705 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 00:54:04,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046786952] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:54:04,705 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:54:04,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21] total 53 [2022-01-31 00:54:04,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481482708] [2022-01-31 00:54:04,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:54:04,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-31 00:54:04,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:54:04,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-31 00:54:04,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1996, Unknown=11, NotChecked=480, Total=2756 [2022-01-31 00:54:04,707 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 53 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 52 states have internal predecessors, (85), 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 00:54:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:54:05,786 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2022-01-31 00:54:05,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 00:54:05,787 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 52 states have internal predecessors, (85), 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 45 [2022-01-31 00:54:05,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:54:05,788 INFO L225 Difference]: With dead ends: 106 [2022-01-31 00:54:05,788 INFO L226 Difference]: Without dead ends: 87 [2022-01-31 00:54:05,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=391, Invalid=2924, Unknown=11, NotChecked=580, Total=3906 [2022-01-31 00:54:05,790 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 459 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 00:54:05,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 231 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 412 Invalid, 0 Unknown, 459 Unchecked, 0.2s Time] [2022-01-31 00:54:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-31 00:54:05,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-01-31 00:54:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 78 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 00:54:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2022-01-31 00:54:05,800 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 45 [2022-01-31 00:54:05,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:54:05,800 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2022-01-31 00:54:05,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 52 states have internal predecessors, (85), 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 00:54:05,801 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-01-31 00:54:05,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 00:54:05,802 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:54:05,802 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, 1] [2022-01-31 00:54:05,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-31 00:54:06,002 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 00:54:06,003 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:54:06,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:54:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash 832104082, now seen corresponding path program 6 times [2022-01-31 00:54:06,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:54:06,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178157607] [2022-01-31 00:54:06,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:54:06,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:54:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:06,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:54:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:06,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:54:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:06,104 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 00:54:06,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:54:06,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178157607] [2022-01-31 00:54:06,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178157607] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:54:06,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616872086] [2022-01-31 00:54:06,104 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 00:54:06,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:54:06,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:54:06,128 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 00:54:06,139 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 00:54:06,210 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-31 00:54:06,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:54:06,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 00:54:06,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:54:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 00:54:06,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:54:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 00:54:06,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616872086] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:54:06,420 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:54:06,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-01-31 00:54:06,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130767023] [2022-01-31 00:54:06,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:54:06,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 00:54:06,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:54:06,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 00:54:06,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2022-01-31 00:54:06,421 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 25 states, 25 states have (on average 2.88) internal successors, (72), 24 states have internal predecessors, (72), 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 00:54:07,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:54:07,066 INFO L93 Difference]: Finished difference Result 192 states and 226 transitions. [2022-01-31 00:54:07,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 00:54:07,066 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.88) internal successors, (72), 24 states have internal predecessors, (72), 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 47 [2022-01-31 00:54:07,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:54:07,067 INFO L225 Difference]: With dead ends: 192 [2022-01-31 00:54:07,067 INFO L226 Difference]: Without dead ends: 141 [2022-01-31 00:54:07,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=1753, Unknown=0, NotChecked=0, Total=2070 [2022-01-31 00:54:07,068 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 337 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 00:54:07,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 141 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 00:54:07,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-01-31 00:54:07,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2022-01-31 00:54:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 104 states have (on average 1.1442307692307692) internal successors, (119), 106 states have internal predecessors, (119), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 00:54:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2022-01-31 00:54:07,080 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 47 [2022-01-31 00:54:07,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:54:07,080 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2022-01-31 00:54:07,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.88) internal successors, (72), 24 states have internal predecessors, (72), 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 00:54:07,080 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2022-01-31 00:54:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 00:54:07,080 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:54:07,080 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:54:07,098 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 00:54:07,289 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 00:54:07,290 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:54:07,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:54:07,290 INFO L85 PathProgramCache]: Analyzing trace with hash -602357212, now seen corresponding path program 2 times [2022-01-31 00:54:07,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:54:07,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361997115] [2022-01-31 00:54:07,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:54:07,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:54:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:07,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:54:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:07,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:54:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:07,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 00:54:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 00:54:07,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:54:07,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361997115] [2022-01-31 00:54:07,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361997115] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:54:07,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159193934] [2022-01-31 00:54:07,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 00:54:07,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:54:07,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:54:07,746 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 00:54:07,747 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 00:54:07,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 00:54:07,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:54:07,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-31 00:54:07,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:54:07,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 15 treesize of output 11 [2022-01-31 00:54:07,902 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 00:54:07,902 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 00:54:07,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:07,928 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 16 treesize of output 18 [2022-01-31 00:54:07,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:07,937 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 16 treesize of output 18 [2022-01-31 00:54:07,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:07,950 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 16 treesize of output 18 [2022-01-31 00:54:07,989 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 00:54:07,990 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 00:54:08,025 INFO L353 Elim1Store]: treesize reduction 53, result has 5.4 percent of original size [2022-01-31 00:54:08,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 20 [2022-01-31 00:54:08,094 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 00:54:08,095 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 26 [2022-01-31 00:54:08,224 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 21 treesize of output 9 [2022-01-31 00:54:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 00:54:08,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:54:14,428 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_208 Int)) (or (forall ((v_ArrVal_681 Int)) (= (+ (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_208)))) is different from false [2022-01-31 00:54:14,996 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 Int) (v_main_~i~0_208 Int)) (or (= (+ (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ c_main_~i~0 1) v_main_~i~0_208)))) is different from false [2022-01-31 00:54:15,665 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 Int) (v_main_~i~0_208 Int)) (or (= (+ (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ c_main_~i~0 2) v_main_~i~0_208)))) is different from false [2022-01-31 00:54:15,822 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_675 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_675) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1)) is different from false [2022-01-31 00:54:15,846 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_672 Int) (v_ArrVal_675 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_672)) |c_main_~#sum~0.base| v_ArrVal_675) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1)) is different from false [2022-01-31 00:54:15,858 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_216 Int)) (or (forall ((v_ArrVal_672 Int) (v_ArrVal_675 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_216)) v_ArrVal_672)) |c_main_~#sum~0.base| v_ArrVal_675) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_216)))) is different from false [2022-01-31 00:54:15,875 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-31 00:54:15,875 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 2 case distinctions, treesize of input 31 treesize of output 37 [2022-01-31 00:54:15,882 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:54:15,882 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 38 treesize of output 38 [2022-01-31 00:54:15,886 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 11 treesize of output 7 [2022-01-31 00:54:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2022-01-31 00:54:15,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159193934] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:54:15,966 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:54:15,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 45 [2022-01-31 00:54:15,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142272507] [2022-01-31 00:54:15,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:54:15,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-31 00:54:15,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:54:15,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-31 00:54:15,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1332, Unknown=8, NotChecked=474, Total=1980 [2022-01-31 00:54:15,968 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 45 states, 44 states have (on average 2.340909090909091) internal successors, (103), 42 states have internal predecessors, (103), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 00:54:18,095 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (+ (- 1) c_main_~i~0)) (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (forall ((v_main_~i~0_216 Int)) (or (forall ((v_ArrVal_672 Int) (v_ArrVal_675 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_216)) v_ArrVal_672)) |c_main_~#sum~0.base| v_ArrVal_675) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_216)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 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 00:54:20,315 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 0) (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_208 Int)) (or (forall ((v_ArrVal_681 Int)) (= (+ (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_208))))) is different from false [2022-01-31 00:54:20,906 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (<= 2 c_main_~i~0) (= c_main_~a~0.offset 0) (= (+ (select .cse0 (+ c_main_~a~0.offset 4)) 1) 1) (forall ((v_ArrVal_681 Int) (v_main_~i~0_208 Int)) (or (= (+ (select (store (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse1 .cse2 (+ (- 1) (select .cse1 .cse2)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ c_main_~i~0 1) v_main_~i~0_208)))) (= (select .cse0 4) 0))) is different from false [2022-01-31 00:54:22,913 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (+ (- 1) c_main_~i~0)) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 1) 1) (forall ((v_main_~i~0_208 Int)) (or (forall ((v_ArrVal_681 Int)) (= (+ (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_208))))) is different from false [2022-01-31 00:54:23,483 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_681 Int) (v_main_~i~0_208 Int)) (or (= (+ (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ c_main_~i~0 2) v_main_~i~0_208)))) (<= 2 c_main_~i~0) (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1) 1)) is different from false [2022-01-31 00:54:24,095 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1) 1) (forall ((v_ArrVal_681 Int) (v_main_~i~0_208 Int)) (or (= (+ (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_208)) v_ArrVal_681) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ c_main_~i~0 1) v_main_~i~0_208))))) is different from false [2022-01-31 00:54:24,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:54:24,376 INFO L93 Difference]: Finished difference Result 214 states and 253 transitions. [2022-01-31 00:54:24,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-01-31 00:54:24,377 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.340909090909091) internal successors, (103), 42 states have internal predecessors, (103), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 53 [2022-01-31 00:54:24,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:54:24,378 INFO L225 Difference]: With dead ends: 214 [2022-01-31 00:54:24,379 INFO L226 Difference]: Without dead ends: 210 [2022-01-31 00:54:24,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 89 SyntacticMatches, 11 SemanticMatches, 60 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=248, Invalid=2236, Unknown=14, NotChecked=1284, Total=3782 [2022-01-31 00:54:24,380 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 72 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 696 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 00:54:24,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 366 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 938 Invalid, 0 Unknown, 696 Unchecked, 0.4s Time] [2022-01-31 00:54:24,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-01-31 00:54:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 192. [2022-01-31 00:54:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 173 states have (on average 1.2196531791907514) internal successors, (211), 175 states have internal predecessors, (211), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-31 00:54:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 229 transitions. [2022-01-31 00:54:24,400 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 229 transitions. Word has length 53 [2022-01-31 00:54:24,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:54:24,400 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 229 transitions. [2022-01-31 00:54:24,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.340909090909091) internal successors, (103), 42 states have internal predecessors, (103), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 00:54:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 229 transitions. [2022-01-31 00:54:24,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 00:54:24,401 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:54:24,401 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, 1] [2022-01-31 00:54:24,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-31 00:54:24,603 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 00:54:24,603 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:54:24,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:54:24,604 INFO L85 PathProgramCache]: Analyzing trace with hash -547286252, now seen corresponding path program 7 times [2022-01-31 00:54:24,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:54:24,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087795810] [2022-01-31 00:54:24,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:54:24,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:54:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:25,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:54:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:25,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:54:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 00:54:25,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:54:25,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087795810] [2022-01-31 00:54:25,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087795810] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:54:25,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664040658] [2022-01-31 00:54:25,659 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 00:54:25,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:54:25,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:54:25,660 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 00:54:25,661 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 00:54:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:25,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 68 conjunts are in the unsatisfiable core [2022-01-31 00:54:25,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:54:25,763 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 00:54:25,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:25,814 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 23 treesize of output 22 [2022-01-31 00:54:25,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:25,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:25,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 00:54:25,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:25,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:25,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:25,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:25,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-01-31 00:54:26,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 59 [2022-01-31 00:54:26,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:54:26,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,342 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 67 treesize of output 63 [2022-01-31 00:54:26,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:54:26,471 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 74 treesize of output 68 [2022-01-31 00:54:26,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:54:26,612 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 67 treesize of output 61 [2022-01-31 00:54:26,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,761 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 59 treesize of output 55 [2022-01-31 00:54:26,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:26,884 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 51 treesize of output 23 [2022-01-31 00:54:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 00:54:26,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:54:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 00:54:30,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664040658] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:54:30,069 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:54:30,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 21] total 64 [2022-01-31 00:54:30,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124946279] [2022-01-31 00:54:30,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:54:30,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-01-31 00:54:30,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:54:30,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-01-31 00:54:30,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=3686, Unknown=0, NotChecked=0, Total=4032 [2022-01-31 00:54:30,071 INFO L87 Difference]: Start difference. First operand 192 states and 229 transitions. Second operand has 64 states, 64 states have (on average 1.34375) internal successors, (86), 63 states have internal predecessors, (86), 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 00:54:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:54:33,123 INFO L93 Difference]: Finished difference Result 220 states and 260 transitions. [2022-01-31 00:54:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 00:54:33,124 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.34375) internal successors, (86), 63 states have internal predecessors, (86), 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 52 [2022-01-31 00:54:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:54:33,126 INFO L225 Difference]: With dead ends: 220 [2022-01-31 00:54:33,126 INFO L226 Difference]: Without dead ends: 198 [2022-01-31 00:54:33,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1879 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=472, Invalid=4930, Unknown=0, NotChecked=0, Total=5402 [2022-01-31 00:54:33,130 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-31 00:54:33,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 222 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1184 Invalid, 0 Unknown, 105 Unchecked, 2.2s Time] [2022-01-31 00:54:33,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-01-31 00:54:33,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2022-01-31 00:54:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 178 states have (on average 1.2191011235955056) internal successors, (217), 180 states have internal predecessors, (217), 10 states have call successors, (10), 10 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-31 00:54:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 235 transitions. [2022-01-31 00:54:33,167 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 235 transitions. Word has length 52 [2022-01-31 00:54:33,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:54:33,167 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 235 transitions. [2022-01-31 00:54:33,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.34375) internal successors, (86), 63 states have internal predecessors, (86), 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 00:54:33,167 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 235 transitions. [2022-01-31 00:54:33,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 00:54:33,168 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:54:33,168 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, 1] [2022-01-31 00:54:33,187 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 00:54:33,385 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 00:54:33,385 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:54:33,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:54:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1587659694, now seen corresponding path program 8 times [2022-01-31 00:54:33,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:54:33,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040100640] [2022-01-31 00:54:33,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:54:33,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:54:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:33,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:54:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:33,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:54:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:33,503 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 00:54:33,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:54:33,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040100640] [2022-01-31 00:54:33,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040100640] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:54:33,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646508245] [2022-01-31 00:54:33,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 00:54:33,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:54:33,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:54:33,504 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 00:54:33,505 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 00:54:33,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 00:54:33,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:54:33,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 00:54:33,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:54:33,741 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 00:54:33,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:54:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 00:54:33,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646508245] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:54:33,822 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:54:33,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 00:54:33,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596467151] [2022-01-31 00:54:33,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:54:33,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 00:54:33,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:54:33,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 00:54:33,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 00:54:33,823 INFO L87 Difference]: Start difference. First operand 197 states and 235 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 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 00:54:34,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:54:34,240 INFO L93 Difference]: Finished difference Result 350 states and 416 transitions. [2022-01-31 00:54:34,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 00:54:34,240 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 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 54 [2022-01-31 00:54:34,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:54:34,241 INFO L225 Difference]: With dead ends: 350 [2022-01-31 00:54:34,241 INFO L226 Difference]: Without dead ends: 249 [2022-01-31 00:54:34,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2022-01-31 00:54:34,242 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 272 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 00:54:34,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 111 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 00:54:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-01-31 00:54:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 217. [2022-01-31 00:54:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 192 states have (on average 1.125) internal successors, (216), 196 states have internal predecessors, (216), 15 states have call successors, (15), 11 states have call predecessors, (15), 9 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-31 00:54:34,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 243 transitions. [2022-01-31 00:54:34,271 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 243 transitions. Word has length 54 [2022-01-31 00:54:34,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:54:34,271 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 243 transitions. [2022-01-31 00:54:34,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 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 00:54:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 243 transitions. [2022-01-31 00:54:34,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 00:54:34,273 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:54:34,273 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, 1] [2022-01-31 00:54:34,291 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 00:54:34,491 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 00:54:34,491 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:54:34,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:54:34,491 INFO L85 PathProgramCache]: Analyzing trace with hash 654408850, now seen corresponding path program 9 times [2022-01-31 00:54:34,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:54:34,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91955028] [2022-01-31 00:54:34,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:54:34,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:54:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:34,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:54:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:34,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:54:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 00:54:34,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:54:34,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91955028] [2022-01-31 00:54:34,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91955028] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:54:34,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026995129] [2022-01-31 00:54:34,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 00:54:34,625 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:54:34,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:54:34,644 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 00:54:34,670 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 00:54:34,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-01-31 00:54:34,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:54:34,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 00:54:34,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:54:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 00:54:34,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:54:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 00:54:35,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026995129] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:54:35,000 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:54:35,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 00:54:35,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268121964] [2022-01-31 00:54:35,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:54:35,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 00:54:35,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:54:35,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 00:54:35,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 00:54:35,002 INFO L87 Difference]: Start difference. First operand 217 states and 243 transitions. Second operand has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 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 00:54:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:54:35,459 INFO L93 Difference]: Finished difference Result 269 states and 300 transitions. [2022-01-31 00:54:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 00:54:35,460 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 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 54 [2022-01-31 00:54:35,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:54:35,462 INFO L225 Difference]: With dead ends: 269 [2022-01-31 00:54:35,462 INFO L226 Difference]: Without dead ends: 216 [2022-01-31 00:54:35,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2022-01-31 00:54:35,463 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 150 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 00:54:35,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 126 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 00:54:35,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-01-31 00:54:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 191. [2022-01-31 00:54:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 167 states have (on average 1.1077844311377245) internal successors, (185), 170 states have internal predecessors, (185), 14 states have call successors, (14), 11 states have call predecessors, (14), 9 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-31 00:54:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 210 transitions. [2022-01-31 00:54:35,489 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 210 transitions. Word has length 54 [2022-01-31 00:54:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:54:35,489 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 210 transitions. [2022-01-31 00:54:35,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 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 00:54:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 210 transitions. [2022-01-31 00:54:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 00:54:35,490 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:54:35,490 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:54:35,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-01-31 00:54:35,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:54:35,708 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:54:35,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:54:35,708 INFO L85 PathProgramCache]: Analyzing trace with hash -766872198, now seen corresponding path program 3 times [2022-01-31 00:54:35,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:54:35,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310069851] [2022-01-31 00:54:35,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:54:35,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:54:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:36,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:54:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:36,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:54:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:36,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 00:54:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:36,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 00:54:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:54:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 00:54:36,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:54:36,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310069851] [2022-01-31 00:54:36,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310069851] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:54:36,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176737666] [2022-01-31 00:54:36,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 00:54:36,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:54:36,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:54:36,382 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:54:36,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-31 00:54:36,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-31 00:54:36,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:54:36,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-31 00:54:36,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:54:36,549 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 00:54:36,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:36,617 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 16 treesize of output 18 [2022-01-31 00:54:36,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:36,642 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 16 treesize of output 18 [2022-01-31 00:54:36,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:36,657 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 16 treesize of output 18 [2022-01-31 00:54:36,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:54:36,713 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 21 treesize of output 20 [2022-01-31 00:54:36,738 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 00:54:36,738 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 30 [2022-01-31 00:54:36,844 INFO L353 Elim1Store]: treesize reduction 30, result has 46.4 percent of original size [2022-01-31 00:54:36,845 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 42 [2022-01-31 00:54:37,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:54:37,849 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:54:37,849 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 39 treesize of output 28 [2022-01-31 00:54:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 00:54:37,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:54:59,015 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 2 c_~N~0)) (forall ((v_ArrVal_951 Int) (main_~i~0 Int) (v_ArrVal_948 (Array Int Int)) (v_main_~i~0_303 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_303)) (= (select (let ((.cse0 (store (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_948) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_951)) (.cse1 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1)))) (+ c_main_~a~0.offset 8)) 0) (not (< v_main_~i~0_303 c_~N~0)) (< (+ v_main_~i~0_303 1) c_~N~0)))) is different from false [2022-01-31 00:54:59,169 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_main_~i~0_311 Int) (v_ArrVal_951 Int) (v_ArrVal_948 (Array Int Int)) (v_main_~i~0_303 Int)) (or (<= v_main_~i~0_303 1) (= (select (let ((.cse0 (store (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_948) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_311)) v_ArrVal_951)) (.cse1 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset 8)) 0) (not (<= (+ v_main_~i~0_311 1) v_main_~i~0_303)) (<= c_main_~i~0 v_main_~i~0_303))) (<= c_main_~i~0 2)) is different from false [2022-01-31 00:54:59,202 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_main_~i~0 1) (forall ((v_main_~i~0_311 Int) (v_ArrVal_951 Int) (v_ArrVal_948 (Array Int Int)) (v_main_~i~0_303 Int)) (or (<= v_main_~i~0_303 1) (<= (+ c_main_~i~0 1) v_main_~i~0_303) (= (select (let ((.cse0 (store (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_948) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_311)) v_ArrVal_951)) (.cse1 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset 8)) 0) (not (<= (+ v_main_~i~0_311 1) v_main_~i~0_303))))) is different from false [2022-01-31 00:54:59,216 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:54:59,217 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 70 treesize of output 59 [2022-01-31 00:54:59,220 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 98 treesize of output 92 [2022-01-31 00:54:59,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:54:59,233 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:54:59,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 101 [2022-01-31 00:54:59,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:54:59,259 INFO L353 Elim1Store]: treesize reduction 22, result has 51.1 percent of original size [2022-01-31 00:54:59,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 114 [2022-01-31 00:54:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 10 not checked. [2022-01-31 00:54:59,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176737666] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:54:59,653 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:54:59,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 22] total 58 [2022-01-31 00:54:59,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449923349] [2022-01-31 00:54:59,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:54:59,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-01-31 00:54:59,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:54:59,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-01-31 00:54:59,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=2638, Unknown=12, NotChecked=324, Total=3306 [2022-01-31 00:54:59,655 INFO L87 Difference]: Start difference. First operand 191 states and 210 transitions. Second operand has 58 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 55 states have internal predecessors, (118), 8 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 00:55:15,756 WARN L228 SmtUtils]: Spent 11.81s on a formula simplification. DAG size of input: 55 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 00:55:16,664 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_main_~i~0 4)) (.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (or (= (select .cse0 (+ .cse1 c_main_~a~0.offset)) 0) (not (< c_main_~i~0 c_~N~0))) (<= c_main_~i~0 3) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (<= 12 (* c_~N~0 4)) (= c_main_~a~0.offset 0) (= (select .cse0 8) 1) (or (not (< 2 c_~N~0)) (forall ((v_ArrVal_951 Int) (main_~i~0 Int) (v_ArrVal_948 (Array Int Int)) (v_main_~i~0_303 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_303)) (= (select (let ((.cse2 (store (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_948) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_951)) (.cse3 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse2 .cse3 (+ (select .cse2 .cse3) (- 1)))) (+ c_main_~a~0.offset 8)) 0) (not (< v_main_~i~0_303 c_~N~0)) (< (+ v_main_~i~0_303 1) c_~N~0)))) (or (= (select .cse0 (+ .cse1 c_main_~a~0.offset 4)) 0) (not (< (+ c_main_~i~0 1) c_~N~0))) (<= c_~N~0 3) (or (not (< (+ c_main_~i~0 2) c_~N~0)) (= (select .cse0 (+ .cse1 c_main_~a~0.offset 8)) 0)) (= (select .cse0 (+ c_main_~a~0.offset 8)) 1))) is different from false [2022-01-31 00:55:17,459 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (= c_main_~i~0 0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (<= 12 (* c_~N~0 4)) (= c_main_~a~0.offset 0) (= (select .cse0 8) 1) (or (not (< 2 c_~N~0)) (forall ((v_ArrVal_951 Int) (main_~i~0 Int) (v_ArrVal_948 (Array Int Int)) (v_main_~i~0_303 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_303)) (= (select (let ((.cse1 (store (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_948) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_951)) (.cse2 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse1 .cse2 (+ (select .cse1 .cse2) (- 1)))) (+ c_main_~a~0.offset 8)) 0) (not (< v_main_~i~0_303 c_~N~0)) (< (+ v_main_~i~0_303 1) c_~N~0)))) (<= c_~N~0 3) (= (select .cse0 (+ c_main_~a~0.offset 8)) 1))) is different from false [2022-01-31 00:55:18,127 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base))) (and (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (<= 12 (* c_~N~0 4)) (= c_main_~a~0.offset 0) (= (select .cse0 8) 1) (or (not (< 2 c_~N~0)) (forall ((v_ArrVal_951 Int) (main_~i~0 Int) (v_ArrVal_948 (Array Int Int)) (v_main_~i~0_303 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_303)) (= (select (let ((.cse1 (store (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_948) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_951)) (.cse2 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse1 .cse2 (+ (select .cse1 .cse2) (- 1)))) (+ c_main_~a~0.offset 8)) 0) (not (< v_main_~i~0_303 c_~N~0)) (< (+ v_main_~i~0_303 1) c_~N~0)))) (<= c_~N~0 3) (= (select .cse0 (+ c_main_~a~0.offset 8)) 1))) is different from false [2022-01-31 00:55:19,228 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~i~0 4)) (.cse1 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse4 (= (select .cse1 8) 1)) (.cse0 (* c_~N~0 4)) (.cse3 (= .cse2 8)) (.cse7 (= (select .cse1 (+ c_main_~a~0.offset 8)) 1))) (and (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (< c_main_~i~0 c_~N~0) (<= 12 .cse0) (= c_main_~a~0.offset 0) (or (= (+ (select .cse1 (+ .cse2 c_main_~a~0.offset)) 1) 1) (not .cse3)) (<= 3 c_~N~0) .cse4 (or (forall ((v_ArrVal_951 Int) (v_ArrVal_949 Int) (v_main_~i~0_305 Int) (v_main_~i~0_303 Int)) (or (not (<= (+ v_main_~i~0_305 1) v_main_~i~0_303)) (not (< v_main_~i~0_303 c_~N~0)) (= (select (let ((.cse5 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_949) (+ c_main_~a~0.offset (* 4 v_main_~i~0_305)) v_ArrVal_951)) (.cse6 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse5 .cse6 (+ (- 1) (select .cse5 .cse6)))) (+ c_main_~a~0.offset 8)) 0) (< (+ v_main_~i~0_303 1) c_~N~0))) (not (< 2 c_~N~0))) (or .cse4 (<= (+ .cse2 c_main_~a~0.offset 9) .cse0)) (<= c_~N~0 3) (or .cse3 .cse7) (or (not (< (+ c_main_~i~0 2) c_~N~0)) (= (select .cse1 (+ .cse2 c_main_~a~0.offset 8)) 0)) .cse7))) is different from false [2022-01-31 00:55:19,768 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_main_~i~0 4))) (let ((.cse4 (= .cse3 8)) (.cse2 (select |c_#memory_int| c_main_~a~0.base))) (and (<= c_main_~i~0 1) (or (forall ((v_ArrVal_951 Int) (main_~i~0 Int) (v_main_~i~0_303 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_303)) (not (< v_main_~i~0_303 c_~N~0)) (= (select (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_951)) (.cse1 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset 8)) 0) (< (+ v_main_~i~0_303 1) c_~N~0))) (not (< 2 c_~N~0))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (< c_main_~i~0 c_~N~0) (= c_main_~a~0.offset 0) (or (= (+ (select .cse2 (+ .cse3 c_main_~a~0.offset)) 1) 1) (not .cse4)) (<= 3 c_~N~0) (or (= (select .cse2 8) 1) (<= (+ .cse3 c_main_~a~0.offset 9) (* c_~N~0 4))) (<= c_~N~0 3) (or .cse4 (= (select .cse2 (+ c_main_~a~0.offset 8)) 1))))) is different from false [2022-01-31 00:55:20,369 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (let ((.cse3 (= .cse4 8)) (.cse2 (select |c_#memory_int| c_main_~a~0.base))) (and (or (forall ((v_ArrVal_951 Int) (main_~i~0 Int) (v_main_~i~0_303 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_303)) (not (< v_main_~i~0_303 c_~N~0)) (= (select (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_951)) (.cse1 (+ c_main_~a~0.offset (* 4 v_main_~i~0_303)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset 8)) 0) (< (+ v_main_~i~0_303 1) c_~N~0))) (not (< 2 c_~N~0))) (or (<= 3 c_main_~i~0) (= (select .cse2 (+ c_main_~a~0.offset 8)) 1)) (or (<= (+ c_main_~i~0 1) c_~N~0) (= (select .cse2 8) 0)) (= c_main_~a~0.offset 0) (<= c_~N~0 3) (or .cse3 (and (<= 3 c_~N~0) (<= c_main_~i~0 2))) (or (not .cse3) (and (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (or (<= (+ c_main_~i~0 2) c_~N~0) (= (select .cse2 .cse4) 1)))) (exists ((v_main_~i~0_296 Int)) (let ((.cse7 (* 4 v_main_~i~0_296))) (let ((.cse6 (= 8 .cse7)) (.cse5 (select |c_#memory_int| c_main_~a~0.base))) (and (<= c_main_~i~0 (+ v_main_~i~0_296 1)) (or (= (select .cse5 (+ c_main_~a~0.offset 8)) 1) .cse6) (or (not .cse6) (= (+ (select .cse5 (+ c_main_~a~0.offset .cse7)) 1) 1)) (< v_main_~i~0_296 c_~N~0)))))))) is different from false [2022-01-31 00:55:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:55:20,880 INFO L93 Difference]: Finished difference Result 217 states and 235 transitions. [2022-01-31 00:55:20,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-31 00:55:20,881 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 55 states have internal predecessors, (118), 8 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 61 [2022-01-31 00:55:20,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:55:20,882 INFO L225 Difference]: With dead ends: 217 [2022-01-31 00:55:20,882 INFO L226 Difference]: Without dead ends: 192 [2022-01-31 00:55:20,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 97 SyntacticMatches, 10 SemanticMatches, 83 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=621, Invalid=5095, Unknown=20, NotChecked=1404, Total=7140 [2022-01-31 00:55:20,886 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 78 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 00:55:20,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 301 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 535 Invalid, 0 Unknown, 303 Unchecked, 0.3s Time] [2022-01-31 00:55:20,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-01-31 00:55:20,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2022-01-31 00:55:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 167 states have (on average 1.1017964071856288) internal successors, (184), 170 states have internal predecessors, (184), 14 states have call successors, (14), 11 states have call predecessors, (14), 9 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-31 00:55:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 209 transitions. [2022-01-31 00:55:20,916 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 209 transitions. Word has length 61 [2022-01-31 00:55:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:55:20,916 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 209 transitions. [2022-01-31 00:55:20,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 55 states have internal predecessors, (118), 8 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 00:55:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 209 transitions. [2022-01-31 00:55:20,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 00:55:20,917 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:55:20,917 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-31 00:55:20,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-01-31 00:55:21,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:55:21,128 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:55:21,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:55:21,128 INFO L85 PathProgramCache]: Analyzing trace with hash -626323588, now seen corresponding path program 2 times [2022-01-31 00:55:21,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:55:21,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069274955] [2022-01-31 00:55:21,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:55:21,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:55:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:55:21,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:55:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:55:21,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:55:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:55:21,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 00:55:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:55:21,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 00:55:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:55:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-01-31 00:55:21,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:55:21,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069274955] [2022-01-31 00:55:21,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069274955] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:55:21,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130724554] [2022-01-31 00:55:21,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 00:55:21,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:55:21,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:55:21,205 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:55:21,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-31 00:55:21,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 00:55:21,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:55:21,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-31 00:55:21,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:55:21,381 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 00:55:21,460 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 00:55:21,473 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 00:55:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 00:55:21,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:55:21,546 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1006 (Array Int Int))) (= (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1006) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) |c_main_#t~mem11|)) is different from false [2022-01-31 00:55:21,549 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 18 treesize of output 14 [2022-01-31 00:55:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 2 not checked. [2022-01-31 00:55:21,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130724554] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:55:21,597 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:55:21,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 6] total 12 [2022-01-31 00:55:21,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770010946] [2022-01-31 00:55:21,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:55:21,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 00:55:21,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:55:21,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 00:55:21,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2022-01-31 00:55:21,598 INFO L87 Difference]: Start difference. First operand 191 states and 209 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 00:55:21,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:55:21,827 INFO L93 Difference]: Finished difference Result 266 states and 294 transitions. [2022-01-31 00:55:21,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 00:55:21,828 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 61 [2022-01-31 00:55:21,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:55:21,829 INFO L225 Difference]: With dead ends: 266 [2022-01-31 00:55:21,829 INFO L226 Difference]: Without dead ends: 156 [2022-01-31 00:55:21,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=186, Unknown=1, NotChecked=28, Total=272 [2022-01-31 00:55:21,829 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 00:55:21,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 126 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 322 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2022-01-31 00:55:21,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-01-31 00:55:21,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 139. [2022-01-31 00:55:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 122 states have (on average 1.0737704918032787) internal successors, (131), 124 states have internal predecessors, (131), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 00:55:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2022-01-31 00:55:21,850 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 61 [2022-01-31 00:55:21,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:55:21,850 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2022-01-31 00:55:21,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 00:55:21,850 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2022-01-31 00:55:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 00:55:21,851 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:55:21,851 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, 1] [2022-01-31 00:55:21,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-31 00:55:22,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:55:22,069 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:55:22,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:55:22,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1571424664, now seen corresponding path program 10 times [2022-01-31 00:55:22,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:55:22,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228912793] [2022-01-31 00:55:22,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:55:22,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:55:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:55:23,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:55:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:55:23,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:55:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:55:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 50 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 00:55:23,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:55:23,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228912793] [2022-01-31 00:55:23,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228912793] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:55:23,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627295937] [2022-01-31 00:55:23,513 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 00:55:23,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:55:23,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:55:23,514 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:55:23,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-01-31 00:55:23,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 00:55:23,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:55:23,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-31 00:55:23,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:55:23,624 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 00:55:23,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:23,667 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 23 treesize of output 22 [2022-01-31 00:55:23,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:23,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:23,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-01-31 00:55:23,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:23,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:23,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:23,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:23,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-01-31 00:55:23,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:23,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:23,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:23,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:23,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:23,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:23,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:23,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-01-31 00:55:24,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2022-01-31 00:55:24,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,398 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:55:24,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,401 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 00:55:24,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:55:24,551 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 73 [2022-01-31 00:55:24,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:55:24,715 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 87 treesize of output 80 [2022-01-31 00:55:24,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:55:24,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:24,885 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 73 [2022-01-31 00:55:25,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:25,046 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 00:55:25,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:25,234 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 58 treesize of output 26 [2022-01-31 00:55:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 50 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 00:55:25,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:55:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 50 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 00:55:33,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627295937] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:55:33,957 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:55:33,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 25] total 76 [2022-01-31 00:55:33,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299602650] [2022-01-31 00:55:33,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:55:33,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-01-31 00:55:33,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:55:33,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-01-31 00:55:33,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=5284, Unknown=0, NotChecked=0, Total=5700 [2022-01-31 00:55:33,959 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand has 76 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 75 states have internal predecessors, (98), 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 00:55:41,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:55:41,979 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2022-01-31 00:55:41,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-31 00:55:41,979 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 75 states have internal predecessors, (98), 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 59 [2022-01-31 00:55:41,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:55:41,980 INFO L225 Difference]: With dead ends: 183 [2022-01-31 00:55:41,980 INFO L226 Difference]: Without dead ends: 158 [2022-01-31 00:55:41,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2489 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=584, Invalid=7072, Unknown=0, NotChecked=0, Total=7656 [2022-01-31 00:55:41,981 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 23 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 270 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-01-31 00:55:41,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 320 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2042 Invalid, 0 Unknown, 270 Unchecked, 5.6s Time] [2022-01-31 00:55:41,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-01-31 00:55:41,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2022-01-31 00:55:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 139 states have (on average 1.079136690647482) internal successors, (150), 141 states have internal predecessors, (150), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 00:55:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2022-01-31 00:55:41,997 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 59 [2022-01-31 00:55:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:55:41,997 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2022-01-31 00:55:41,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 75 states have internal predecessors, (98), 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 00:55:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2022-01-31 00:55:41,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 00:55:41,998 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:55:41,998 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 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, 1] [2022-01-31 00:55:42,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-01-31 00:55:42,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-31 00:55:42,211 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:55:42,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:55:42,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1834307942, now seen corresponding path program 11 times [2022-01-31 00:55:42,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:55:42,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560203623] [2022-01-31 00:55:42,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:55:42,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:55:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:55:42,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:55:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:55:42,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:55:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:55:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 27 proven. 34 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 00:55:42,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:55:42,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560203623] [2022-01-31 00:55:42,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560203623] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:55:42,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019511660] [2022-01-31 00:55:42,376 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 00:55:42,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:55:42,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:55:42,378 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:55:42,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-01-31 00:55:42,883 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-01-31 00:55:42,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:55:42,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 00:55:42,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:55:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 00:55:43,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:55:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 00:55:43,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019511660] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:55:43,350 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:55:43,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 35 [2022-01-31 00:55:43,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122449526] [2022-01-31 00:55:43,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:55:43,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-31 00:55:43,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:55:43,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-31 00:55:43,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 00:55:43,351 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. Second operand has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 34 states have internal predecessors, (96), 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 00:55:44,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:55:44,635 INFO L93 Difference]: Finished difference Result 284 states and 311 transitions. [2022-01-31 00:55:44,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-31 00:55:44,635 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 34 states have internal predecessors, (96), 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 61 [2022-01-31 00:55:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:55:44,636 INFO L225 Difference]: With dead ends: 284 [2022-01-31 00:55:44,636 INFO L226 Difference]: Without dead ends: 227 [2022-01-31 00:55:44,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=745, Invalid=4805, Unknown=0, NotChecked=0, Total=5550 [2022-01-31 00:55:44,638 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 545 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 00:55:44,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 293 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [447 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 00:55:44,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-01-31 00:55:44,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 195. [2022-01-31 00:55:44,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 173 states have (on average 1.0578034682080926) internal successors, (183), 175 states have internal predecessors, (183), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-01-31 00:55:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 206 transitions. [2022-01-31 00:55:44,664 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 206 transitions. Word has length 61 [2022-01-31 00:55:44,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:55:44,665 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 206 transitions. [2022-01-31 00:55:44,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.742857142857143) internal successors, (96), 34 states have internal predecessors, (96), 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 00:55:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 206 transitions. [2022-01-31 00:55:44,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 00:55:44,665 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:55:44,665 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:55:44,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-01-31 00:55:44,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-01-31 00:55:44,869 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:55:44,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:55:44,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1240146496, now seen corresponding path program 4 times [2022-01-31 00:55:44,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:55:44,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367668222] [2022-01-31 00:55:44,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:55:44,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:55:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:55:45,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:55:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:55:45,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:55:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:55:45,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-31 00:55:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:55:45,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-31 00:55:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:55:45,687 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 00:55:45,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:55:45,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367668222] [2022-01-31 00:55:45,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367668222] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:55:45,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589970163] [2022-01-31 00:55:45,688 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 00:55:45,688 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:55:45,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:55:45,704 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:55:45,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-01-31 00:55:45,813 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 00:55:45,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:55:45,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 53 conjunts are in the unsatisfiable core [2022-01-31 00:55:45,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:55:45,919 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 00:55:46,000 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 00:55:46,001 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 00:55:46,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:46,080 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 16 treesize of output 18 [2022-01-31 00:55:46,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:46,127 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 16 treesize of output 18 [2022-01-31 00:55:46,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:46,146 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 16 treesize of output 18 [2022-01-31 00:55:46,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:55:46,159 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 16 treesize of output 18 [2022-01-31 00:55:46,232 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 00:55:46,233 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 00:55:46,282 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 00:55:46,282 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 00:55:46,332 INFO L353 Elim1Store]: treesize reduction 53, result has 5.4 percent of original size [2022-01-31 00:55:46,332 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 20 [2022-01-31 00:55:46,406 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 00:55:46,407 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 26 [2022-01-31 00:55:46,682 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 21 treesize of output 9 [2022-01-31 00:55:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 00:55:46,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:55:54,961 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_400 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_400)) (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0)))) is different from false [2022-01-31 00:56:10,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_400 Int) (v_ArrVal_1257 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_400)) (= (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0))) is different from false [2022-01-31 00:56:42,559 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1250 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1250) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 1)) is different from false [2022-01-31 00:56:42,584 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1246 Int) (v_ArrVal_1250 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1246)) |c_main_~#sum~0.base| v_ArrVal_1250) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 1)) is different from false [2022-01-31 00:56:42,594 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_410 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_410)) (forall ((v_ArrVal_1246 Int) (v_ArrVal_1250 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_410) c_main_~a~0.offset) v_ArrVal_1246)) |c_main_~#sum~0.base| v_ArrVal_1250) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 1)))) is different from false [2022-01-31 00:56:42,608 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-31 00:56:42,608 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 2 case distinctions, treesize of input 31 treesize of output 37 [2022-01-31 00:56:42,613 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:56:42,614 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 38 treesize of output 38 [2022-01-31 00:56:42,616 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 11 treesize of output 7 [2022-01-31 00:56:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 13 trivial. 24 not checked. [2022-01-31 00:56:42,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589970163] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:56:42,747 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:56:42,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 23] total 63 [2022-01-31 00:56:42,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554744732] [2022-01-31 00:56:42,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:56:42,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-01-31 00:56:42,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:56:42,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-01-31 00:56:42,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=2983, Unknown=58, NotChecked=580, Total=3906 [2022-01-31 00:56:42,748 INFO L87 Difference]: Start difference. First operand 195 states and 206 transitions. Second operand has 63 states, 62 states have (on average 2.2096774193548385) internal successors, (137), 60 states have internal predecessors, (137), 8 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 00:56:46,202 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_410 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_410)) (forall ((v_ArrVal_1246 Int) (v_ArrVal_1250 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_410) c_main_~a~0.offset) v_ArrVal_1246)) |c_main_~#sum~0.base| v_ArrVal_1250) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 1)))) (= c_main_~i~0 2) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (<= c_main_~i~0 2) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 1) (<= (+ 2 (div (* (- 1) c_main_~a~0.offset) 4)) c_main_~i~0)) is different from false [2022-01-31 00:56:48,928 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (and (= (select (select |c_#memory_int| c_main_~a~0.base) .cse0) 0) (= .cse0 8) (= c_main_~i~0 2) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_400 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_400)) (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0)))))) is different from false [2022-01-31 00:56:51,031 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (* c_main_~i~0 4)) (.cse3 (select .cse4 (+ c_main_~a~0.offset 8)))) (and (not (= (+ .cse0 c_main_~a~0.offset) 8)) (forall ((v_main_~i~0_400 Int) (v_ArrVal_1257 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_400)) (= (select (store (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base)) (.cse2 (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) (store .cse1 .cse2 (+ (- 1) (select .cse1 .cse2)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0))) (or (<= (+ .cse0 c_main_~a~0.offset 1) (* c_~N~0 4)) (and (<= 1 .cse3) (<= .cse3 1))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (= (select .cse4 8) 0) (= (+ .cse3 1) 1) (<= 3 c_main_~i~0) (forall ((v_main_~i~0_400 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_400)) (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0))))))) is different from false [2022-01-31 00:56:51,627 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_400 Int) (v_ArrVal_1254 Int) (v_ArrVal_1257 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_400)) (= (select (store (let ((.cse2 (* c_main_~i~0 4))) (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset) v_ArrVal_1254)) (.cse1 (+ .cse2 c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1))))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0))) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| c_main_~a~0.base) 8) 0) (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0)) (forall ((v_main_~i~0_400 Int) (v_ArrVal_1257 Int)) (or (= (select (store (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base)) (.cse4 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse3 .cse4 (+ (- 1) (select .cse3 .cse4)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_400))))) is different from false [2022-01-31 00:56:52,403 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_400 Int) (v_ArrVal_1254 Int) (v_ArrVal_1257 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_400)) (= (select (store (let ((.cse2 (* c_main_~i~0 4))) (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset) v_ArrVal_1254)) (.cse1 (+ .cse2 c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1))))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0))) (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0)) (forall ((v_main_~i~0_400 Int) (v_ArrVal_1257 Int)) (or (= (select (store (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base)) (.cse4 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse3 .cse4 (+ (- 1) (select .cse3 .cse4)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_400))))) is different from false [2022-01-31 00:56:54,418 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_400 Int) (v_ArrVal_1257 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_400)) (= (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0))) (forall ((v_main_~i~0_400 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_400)) (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0)))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 0)) is different from false [2022-01-31 00:56:55,025 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0)) (forall ((v_main_~i~0_400 Int) (v_ArrVal_1257 Int)) (or (= (select (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_400))))) is different from false [2022-01-31 00:56:57,065 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_400 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_400)) (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_400)) v_ArrVal_1257) (+ c_main_~a~0.offset 8)) 0)))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 0)) is different from false [2022-01-31 00:56:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:56:58,645 INFO L93 Difference]: Finished difference Result 240 states and 256 transitions. [2022-01-31 00:56:58,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-01-31 00:56:58,646 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.2096774193548385) internal successors, (137), 60 states have internal predecessors, (137), 8 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 68 [2022-01-31 00:56:58,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:56:58,647 INFO L225 Difference]: With dead ends: 240 [2022-01-31 00:56:58,647 INFO L226 Difference]: Without dead ends: 236 [2022-01-31 00:56:58,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 109 SyntacticMatches, 14 SemanticMatches, 93 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 2248 ImplicationChecksByTransitivity, 71.8s TimeCoverageRelationStatistics Valid=569, Invalid=6056, Unknown=69, NotChecked=2236, Total=8930 [2022-01-31 00:56:58,648 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 89 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 2427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 872 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 00:56:58,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 430 Invalid, 2427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1453 Invalid, 0 Unknown, 872 Unchecked, 0.7s Time] [2022-01-31 00:56:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-01-31 00:56:58,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 230. [2022-01-31 00:56:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 201 states have (on average 1.064676616915423) internal successors, (214), 203 states have internal predecessors, (214), 16 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-01-31 00:56:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 243 transitions. [2022-01-31 00:56:58,677 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 243 transitions. Word has length 68 [2022-01-31 00:56:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:56:58,677 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 243 transitions. [2022-01-31 00:56:58,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.2096774193548385) internal successors, (137), 60 states have internal predecessors, (137), 8 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-31 00:56:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 243 transitions. [2022-01-31 00:56:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 00:56:58,678 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:56:58,678 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 00:56:58,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-01-31 00:56:58,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:58,895 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:56:58,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:56:58,895 INFO L85 PathProgramCache]: Analyzing trace with hash 22675052, now seen corresponding path program 5 times [2022-01-31 00:56:58,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:56:58,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961154146] [2022-01-31 00:56:58,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:56:58,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:56:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:56:59,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:56:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:56:59,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:56:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:56:59,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 00:56:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:56:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 00:56:59,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:56:59,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961154146] [2022-01-31 00:56:59,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961154146] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:56:59,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368544502] [2022-01-31 00:56:59,519 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 00:56:59,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:56:59,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:56:59,520 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:56:59,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-01-31 00:56:59,880 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 00:56:59,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:56:59,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-31 00:56:59,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:56:59,903 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 00:56:59,947 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 15 treesize of output 11 [2022-01-31 00:57:00,013 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 00:57:00,014 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 00:57:00,060 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 00:57:00,060 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 00:57:00,102 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 00:57:00,102 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 00:57:00,166 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 16 treesize of output 18 [2022-01-31 00:57:00,180 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 16 treesize of output 18 [2022-01-31 00:57:00,192 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 16 treesize of output 18 [2022-01-31 00:57:00,207 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 16 treesize of output 18 [2022-01-31 00:57:00,236 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 16 treesize of output 18 [2022-01-31 00:57:00,298 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 00:57:00,299 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 00:57:00,341 INFO L353 Elim1Store]: treesize reduction 53, result has 5.4 percent of original size [2022-01-31 00:57:00,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 20 [2022-01-31 00:57:00,411 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 00:57:00,411 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 26 [2022-01-31 00:57:00,472 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 00:57:00,472 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 26 [2022-01-31 00:57:00,551 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 00:57:00,551 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 26 [2022-01-31 00:57:00,724 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 21 treesize of output 9 [2022-01-31 00:57:00,774 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 11 proven. 69 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 00:57:00,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:57:06,948 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_427 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_427)) (forall ((v_ArrVal_1355 Int)) (= (+ (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1)))) is different from false [2022-01-31 00:57:07,476 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1354 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int)) (or (= (+ (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ c_main_~i~0 1) v_main_~i~0_427)))) is different from false [2022-01-31 00:57:09,506 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_428 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_428)) (forall ((v_ArrVal_1354 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int)) (or (= (+ (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_428)) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ v_main_~i~0_428 1) v_main_~i~0_427)))))) is different from false [2022-01-31 00:57:11,536 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int) (v_main_~i~0_428 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_428)) (= (+ (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1352) (+ c_main_~a~0.offset (* 4 v_main_~i~0_428)) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ v_main_~i~0_428 1) v_main_~i~0_427)))) is different from false [2022-01-31 00:57:13,616 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_429 Int)) (or (forall ((v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int) (v_main_~i~0_428 Int)) (or (not (<= (+ v_main_~i~0_429 1) v_main_~i~0_428)) (= (+ (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_429)) v_ArrVal_1352) (+ c_main_~a~0.offset (* 4 v_main_~i~0_428)) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ v_main_~i~0_428 1) v_main_~i~0_427)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_429)))) is different from false [2022-01-31 00:57:15,677 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_main_~i~0_429 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int) (v_main_~i~0_428 Int)) (or (not (<= (+ v_main_~i~0_429 1) v_main_~i~0_428)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_429)) (= (+ (select (store (store (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_429)) v_ArrVal_1352) (+ c_main_~a~0.offset (* 4 v_main_~i~0_428)) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ v_main_~i~0_428 1) v_main_~i~0_427)))) is different from false [2022-01-31 00:57:17,801 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_main_~i~0_429 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int) (v_main_~i~0_428 Int)) (or (= (+ (select (store (store (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_429)) v_ArrVal_1352) (+ c_main_~a~0.offset (* 4 v_main_~i~0_428)) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ c_main_~i~0 2) v_main_~i~0_429)) (not (<= (+ v_main_~i~0_429 1) v_main_~i~0_428)) (not (<= (+ v_main_~i~0_428 1) v_main_~i~0_427)))) is different from false [2022-01-31 00:57:19,881 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_main_~i~0_429 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int) (v_main_~i~0_428 Int) (v_ArrVal_1348 Int)) (or (= (+ (select (store (store (store (let ((.cse2 (* c_main_~i~0 4))) (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse2 c_main_~a~0.offset) v_ArrVal_1348)) (.cse1 (+ .cse2 c_main_~a~0.offset 4))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1))))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_429)) v_ArrVal_1352) (+ c_main_~a~0.offset (* 4 v_main_~i~0_428)) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ c_main_~i~0 2) v_main_~i~0_429)) (not (<= (+ v_main_~i~0_429 1) v_main_~i~0_428)) (not (<= (+ v_main_~i~0_428 1) v_main_~i~0_427)))) is different from false [2022-01-31 00:57:20,592 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1346 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1)) is different from false [2022-01-31 00:57:20,628 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1341 Int) (v_ArrVal_1346 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1)) is different from false [2022-01-31 00:57:20,640 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_439 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_439)) (forall ((v_ArrVal_1341 Int) (v_ArrVal_1346 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_439)) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1)))) is different from false [2022-01-31 00:57:20,653 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1341 Int) (v_ArrVal_1346 (Array Int Int)) (v_main_~i~0_439 Int) (v_ArrVal_1338 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_439)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1338) (+ c_main_~a~0.offset (* 4 v_main_~i~0_439)) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1))) is different from false [2022-01-31 00:57:20,682 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_440 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_440)) (forall ((v_ArrVal_1341 Int) (v_ArrVal_1346 (Array Int Int)) (v_main_~i~0_439 Int) (v_ArrVal_1338 Int)) (or (not (<= (+ v_main_~i~0_440 1) v_main_~i~0_439)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_440) c_main_~a~0.offset) v_ArrVal_1338) (+ c_main_~a~0.offset (* 4 v_main_~i~0_439)) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1))))) is different from false [2022-01-31 00:57:20,708 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1341 Int) (v_main_~i~0_440 Int) (v_ArrVal_1346 (Array Int Int)) (v_ArrVal_1336 Int) (v_main_~i~0_439 Int) (v_ArrVal_1338 Int)) (or (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1336) (+ (* 4 v_main_~i~0_440) c_main_~a~0.offset) v_ArrVal_1338) (+ c_main_~a~0.offset (* 4 v_main_~i~0_439)) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1) (not (<= (+ v_main_~i~0_440 1) v_main_~i~0_439)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_440)))) is different from false [2022-01-31 00:57:20,784 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_441 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_441)) (forall ((v_ArrVal_1341 Int) (v_main_~i~0_440 Int) (v_ArrVal_1346 (Array Int Int)) (v_ArrVal_1336 Int) (v_main_~i~0_439 Int) (v_ArrVal_1338 Int)) (or (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_441)) v_ArrVal_1336) (+ (* 4 v_main_~i~0_440) c_main_~a~0.offset) v_ArrVal_1338) (+ c_main_~a~0.offset (* 4 v_main_~i~0_439)) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1) (not (<= (+ v_main_~i~0_440 1) v_main_~i~0_439)) (not (<= (+ v_main_~i~0_441 1) v_main_~i~0_440)))))) is different from false [2022-01-31 00:57:20,835 INFO L353 Elim1Store]: treesize reduction 267, result has 15.5 percent of original size [2022-01-31 00:57:20,836 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 4 case distinctions, treesize of input 45 treesize of output 61 [2022-01-31 00:57:20,843 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:57:20,843 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 38 treesize of output 38 [2022-01-31 00:57:20,846 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 11 treesize of output 7 [2022-01-31 00:57:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 67 not checked. [2022-01-31 00:57:20,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368544502] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:57:20,935 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:57:20,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 27] total 60 [2022-01-31 00:57:20,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361650988] [2022-01-31 00:57:20,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:57:20,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-01-31 00:57:20,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:57:20,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-01-31 00:57:20,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1783, Unknown=17, NotChecked=1500, Total=3540 [2022-01-31 00:57:20,937 INFO L87 Difference]: Start difference. First operand 230 states and 243 transitions. Second operand has 60 states, 59 states have (on average 2.23728813559322) internal successors, (132), 57 states have internal predecessors, (132), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 00:57:23,020 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (forall ((v_main_~i~0_441 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_441)) (forall ((v_ArrVal_1341 Int) (v_main_~i~0_440 Int) (v_ArrVal_1346 (Array Int Int)) (v_ArrVal_1336 Int) (v_main_~i~0_439 Int) (v_ArrVal_1338 Int)) (or (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_441)) v_ArrVal_1336) (+ (* 4 v_main_~i~0_440) c_main_~a~0.offset) v_ArrVal_1338) (+ c_main_~a~0.offset (* 4 v_main_~i~0_439)) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1) (not (<= (+ v_main_~i~0_440 1) v_main_~i~0_439)) (not (<= (+ v_main_~i~0_441 1) v_main_~i~0_440)))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 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 00:57:25,041 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_440 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_440)) (forall ((v_ArrVal_1341 Int) (v_ArrVal_1346 (Array Int Int)) (v_main_~i~0_439 Int) (v_ArrVal_1338 Int)) (or (not (<= (+ v_main_~i~0_440 1) v_main_~i~0_439)) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_440) c_main_~a~0.offset) v_ArrVal_1338) (+ c_main_~a~0.offset (* 4 v_main_~i~0_439)) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1))))) (= (select (select |c_#memory_int| c_main_~a~0.base) 4) 1) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (= (+ (* c_main_~i~0 4) c_main_~a~0.offset (- 8)) 0)) is different from false [2022-01-31 00:57:27,061 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) 4) 1) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (<= (+ 2 (div (+ (* (- 1) c_main_~a~0.offset) 4) 4)) c_main_~i~0) (forall ((v_main_~i~0_439 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_439)) (forall ((v_ArrVal_1341 Int) (v_ArrVal_1346 (Array Int Int))) (= (select (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_439)) v_ArrVal_1341)) |c_main_~#sum~0.base| v_ArrVal_1346) c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 1))))) is different from false [2022-01-31 00:57:29,353 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 0) (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_429 Int)) (or (forall ((v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int) (v_main_~i~0_428 Int)) (or (not (<= (+ v_main_~i~0_429 1) v_main_~i~0_428)) (= (+ (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_429)) v_ArrVal_1352) (+ c_main_~a~0.offset (* 4 v_main_~i~0_428)) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ v_main_~i~0_428 1) v_main_~i~0_427)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_429))))) is different from false [2022-01-31 00:57:31,388 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_428 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_428)) (forall ((v_ArrVal_1354 Int) (v_ArrVal_1355 Int) (v_main_~i~0_427 Int)) (or (= (+ (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_428)) v_ArrVal_1354) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1) (not (<= (+ v_main_~i~0_428 1) v_main_~i~0_427)))))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (<= c_main_~i~0 2) (not (<= (+ (* c_main_~i~0 4) c_main_~a~0.offset) 7)) (= (select (select |c_#memory_int| c_main_~a~0.base) 4) 0)) is different from false [2022-01-31 00:57:33,435 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_427 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_427)) (forall ((v_ArrVal_1355 Int)) (= (+ (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_427)) v_ArrVal_1355) (+ c_main_~a~0.offset 4)) 1) 1)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (<= (+ 2 (div (+ (* (- 1) c_main_~a~0.offset) 4) 4)) c_main_~i~0) (= (select (select |c_#memory_int| c_main_~a~0.base) 4) 0)) is different from false [2022-01-31 00:57:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:57:33,786 INFO L93 Difference]: Finished difference Result 261 states and 277 transitions. [2022-01-31 00:57:33,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 00:57:33,787 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.23728813559322) internal successors, (132), 57 states have internal predecessors, (132), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 67 [2022-01-31 00:57:33,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:57:33,788 INFO L225 Difference]: With dead ends: 261 [2022-01-31 00:57:33,788 INFO L226 Difference]: Without dead ends: 259 [2022-01-31 00:57:33,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 107 SyntacticMatches, 24 SemanticMatches, 72 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=318, Invalid=2499, Unknown=23, NotChecked=2562, Total=5402 [2022-01-31 00:57:33,789 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 92 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1279 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 00:57:33,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 315 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 891 Invalid, 0 Unknown, 1279 Unchecked, 0.4s Time] [2022-01-31 00:57:33,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-01-31 00:57:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 241. [2022-01-31 00:57:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 209 states have (on average 1.062200956937799) internal successors, (222), 212 states have internal predecessors, (222), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-31 00:57:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 253 transitions. [2022-01-31 00:57:33,818 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 253 transitions. Word has length 67 [2022-01-31 00:57:33,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:57:33,819 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 253 transitions. [2022-01-31 00:57:33,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.23728813559322) internal successors, (132), 57 states have internal predecessors, (132), 5 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 00:57:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 253 transitions. [2022-01-31 00:57:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 00:57:33,819 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:57:33,820 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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 00:57:33,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-01-31 00:57:34,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:57:34,035 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:57:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:57:34,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2141089972, now seen corresponding path program 4 times [2022-01-31 00:57:34,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:57:34,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993686510] [2022-01-31 00:57:34,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:57:34,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:57:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:57:34,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:57:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:57:34,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:57:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:57:34,693 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-31 00:57:34,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:57:34,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993686510] [2022-01-31 00:57:34,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993686510] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:57:34,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468019266] [2022-01-31 00:57:34,693 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 00:57:34,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:57:34,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:57:34,694 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:57:34,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-01-31 00:57:34,802 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 00:57:34,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:57:34,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 61 conjunts are in the unsatisfiable core [2022-01-31 00:57:34,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:57:34,862 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 00:57:34,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:34,923 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 23 treesize of output 22 [2022-01-31 00:57:34,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:34,965 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 23 treesize of output 22 [2022-01-31 00:57:35,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:35,013 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 23 treesize of output 22 [2022-01-31 00:57:35,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:35,054 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 23 treesize of output 22 [2022-01-31 00:57:35,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:35,101 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 23 treesize of output 22 [2022-01-31 00:57:35,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:35,145 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 00:57:35,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:35,162 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 00:57:35,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:35,178 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 00:57:35,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:35,194 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 00:57:35,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:35,211 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 00:57:35,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:35,226 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 00:57:35,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:57:35,289 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:57:35,289 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2022-01-31 00:57:35,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:35,342 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 23 treesize of output 22 [2022-01-31 00:57:35,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:35,386 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 23 treesize of output 22 [2022-01-31 00:57:35,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:35,429 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 23 treesize of output 22 [2022-01-31 00:57:35,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:35,473 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 23 treesize of output 22 [2022-01-31 00:57:35,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:57:35,517 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 23 treesize of output 22 [2022-01-31 00:57:35,558 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 00:57:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-31 00:57:35,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 00:57:37,720 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_456 Int)) (or (forall ((v_ArrVal_1471 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_456)))) is different from false [2022-01-31 00:57:50,258 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_457 Int)) (or (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_main_~i~0_456 Int)) (or (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_457)))) is different from false [2022-01-31 00:57:52,286 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1468 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_457)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)))) is different from false [2022-01-31 00:57:54,375 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_458 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_458)) (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1468 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0))))) is different from false [2022-01-31 00:57:56,440 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_458)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)))) is different from false [2022-01-31 00:57:58,678 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_459 Int)) (or (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_459)))) is different from false [2022-01-31 00:58:00,763 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1464 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (= (select (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_459)))) is different from false [2022-01-31 00:58:03,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_460 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_460)) (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1464 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (= (select (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))))) is different from false [2022-01-31 00:58:05,134 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1464 Int) (v_main_~i~0_460 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_460)) (= 0 (select (store (store (store (store (store (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) is different from false [2022-01-31 00:58:07,191 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1464 Int) (v_main_~i~0_460 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_ArrVal_1460 (Array Int Int)) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (= (select (store (store (store (store (store (let ((.cse0 (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= 1 v_main_~i~0_460)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) is different from false [2022-01-31 00:58:08,401 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1464 Int) (v_main_~i~0_460 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_ArrVal_1460 (Array Int Int)) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (= (select (store (store (store (store (store (let ((.cse0 (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= 1 v_main_~i~0_460)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) is different from false [2022-01-31 00:58:08,647 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= 1 v_main_~i~0_460)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) is different from false [2022-01-31 00:58:08,810 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_470 Int)) (or (forall ((v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= 1 v_main_~i~0_460)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_470)))) is different from false [2022-01-31 00:58:08,947 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_470 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= 1 v_main_~i~0_460)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) is different from false [2022-01-31 00:58:09,191 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_471 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_471)) (forall ((v_main_~i~0_470 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= 1 v_main_~i~0_460)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))))) is different from false [2022-01-31 00:58:09,400 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= 1 v_main_~i~0_460)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_471)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) is different from false [2022-01-31 00:58:09,768 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_472 Int)) (or (forall ((v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_472 1) v_main_~i~0_471)) (not (<= 1 v_main_~i~0_460)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_472) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_472)))) is different from false [2022-01-31 00:58:09,947 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_472 Int) (v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_ArrVal_1448 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_472)) (not (<= (+ v_main_~i~0_472 1) v_main_~i~0_471)) (not (<= 1 v_main_~i~0_460)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1448) (+ (* 4 v_main_~i~0_472) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) is different from false [2022-01-31 00:58:10,406 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_473 Int)) (or (forall ((v_main_~i~0_472 Int) (v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_ArrVal_1448 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_472 1) v_main_~i~0_471)) (not (<= 1 v_main_~i~0_460)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_473)) v_ArrVal_1448) (+ (* 4 v_main_~i~0_472) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)) (not (<= (+ v_main_~i~0_473 1) v_main_~i~0_472)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_473)))) is different from false [2022-01-31 00:58:10,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_472 Int) (v_main_~i~0_473 Int) (v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_ArrVal_1445 Int) (v_ArrVal_1448 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_472 1) v_main_~i~0_471)) (not (<= 1 v_main_~i~0_460)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_473)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)) (not (<= (+ v_main_~i~0_473 1) v_main_~i~0_472)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_473)) v_ArrVal_1448) (+ (* 4 v_main_~i~0_472) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0))) is different from false [2022-01-31 00:58:11,139 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_474 Int)) (or (forall ((v_main_~i~0_472 Int) (v_main_~i~0_473 Int) (v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_ArrVal_1445 Int) (v_ArrVal_1448 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_474 1) v_main_~i~0_473)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_474)) v_ArrVal_1445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_473)) v_ArrVal_1448) (+ (* 4 v_main_~i~0_472) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_472 1) v_main_~i~0_471)) (not (<= 1 v_main_~i~0_460)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)) (not (<= (+ v_main_~i~0_473 1) v_main_~i~0_472)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_474)))) is different from false [2022-01-31 00:58:11,272 INFO L353 Elim1Store]: treesize reduction 785, result has 8.5 percent of original size [2022-01-31 00:58:11,272 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 6 case distinctions, treesize of input 151 treesize of output 130 [2022-01-31 00:58:11,284 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 120 treesize of output 114 [2022-01-31 00:58:11,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:11,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:11,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:11,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:11,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:11,315 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:58:11,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-01-31 00:58:11,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:11,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:11,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:11,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:11,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:11,322 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 11 treesize of output 9 [2022-01-31 00:58:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 94 not checked. [2022-01-31 00:58:11,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468019266] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 00:58:11,363 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 00:58:11,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 32] total 67 [2022-01-31 00:58:11,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171461803] [2022-01-31 00:58:11,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 00:58:11,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-01-31 00:58:11,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 00:58:11,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-01-31 00:58:11,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1794, Unknown=43, NotChecked=2268, Total=4422 [2022-01-31 00:58:11,365 INFO L87 Difference]: Start difference. First operand 241 states and 253 transitions. Second operand has 67 states, 66 states have (on average 2.015151515151515) internal successors, (133), 64 states have internal predecessors, (133), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:58:13,401 WARN L838 $PredicateComparison]: unable to prove that (and (= c_main_~i~0 0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_474 Int)) (or (forall ((v_main_~i~0_472 Int) (v_main_~i~0_473 Int) (v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_ArrVal_1445 Int) (v_ArrVal_1448 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_474 1) v_main_~i~0_473)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_474)) v_ArrVal_1445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_473)) v_ArrVal_1448) (+ (* 4 v_main_~i~0_472) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_472 1) v_main_~i~0_471)) (not (<= 1 v_main_~i~0_460)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)) (not (<= (+ v_main_~i~0_473 1) v_main_~i~0_472)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_474)))) (= (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 00:58:15,466 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_main_~a~0.base))) (and (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (forall ((v_main_~i~0_473 Int)) (or (forall ((v_main_~i~0_472 Int) (v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_ArrVal_1448 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_472 1) v_main_~i~0_471)) (not (<= 1 v_main_~i~0_460)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_473)) v_ArrVal_1448) (+ (* 4 v_main_~i~0_472) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)) (not (<= (+ v_main_~i~0_473 1) v_main_~i~0_472)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_473)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse1 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (= (select .cse1 0) 1))) is different from false [2022-01-31 00:58:17,502 WARN L838 $PredicateComparison]: unable to prove that (and (<= 2 c_main_~i~0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_472 Int)) (or (forall ((v_main_~i~0_470 Int) (v_main_~i~0_471 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1450 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_472 1) v_main_~i~0_471)) (not (<= 1 v_main_~i~0_460)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_472) c_main_~a~0.offset) v_ArrVal_1450) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_472))))) is different from false [2022-01-31 00:58:19,540 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_471 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_471)) (forall ((v_main_~i~0_470 Int) (v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1452 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_471)) v_ArrVal_1452) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_471 1) v_main_~i~0_470)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= 1 v_main_~i~0_460)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))))) (<= 3 c_main_~i~0)) is different from false [2022-01-31 00:58:21,588 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_470 Int)) (or (forall ((v_main_~i~0_460 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1453 Int) (v_ArrVal_1464 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= 1 v_main_~i~0_460)) (= (select (store (store (store (store (store (let ((.cse0 (select (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_470)) v_ArrVal_1453)) |c_main_~#sum~0.base| v_ArrVal_1460) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ (- 1) (select .cse0 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_470)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (<= 4 c_main_~i~0) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0)) is different from false [2022-01-31 00:58:23,766 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 0) (= c_main_~i~0 0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_460 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_460)) (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1464 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_459 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (= (select (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_460)) v_ArrVal_1464) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (not (<= (+ v_main_~i~0_460 1) v_main_~i~0_459))))))) is different from false [2022-01-31 00:58:25,805 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (= (select (select |c_#memory_int| c_main_~a~0.base) 0) 0) (forall ((v_main_~i~0_459 Int)) (or (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1466 Int) (v_ArrVal_1468 Int) (v_main_~i~0_458 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_459 1) v_main_~i~0_458)) (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_459) c_main_~a~0.offset) v_ArrVal_1466) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_459)))) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_456 Int)) (or (forall ((v_ArrVal_1471 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_456))))) is different from false [2022-01-31 00:58:27,842 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) 0) 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_458 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_458)) (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_ArrVal_1468 Int) (v_main_~i~0_456 Int) (v_main_~i~0_457 Int)) (or (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (not (<= (+ v_main_~i~0_458 1) v_main_~i~0_457)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_458)) v_ArrVal_1468) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0))))) (forall ((v_main_~i~0_456 Int)) (or (forall ((v_ArrVal_1471 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_456)))) (<= (+ 2 (div (* (- 1) c_main_~a~0.offset) 4)) c_main_~i~0)) is different from false [2022-01-31 00:58:29,885 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) 0) 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (<= (+ 3 (div (* (- 1) c_main_~a~0.offset) 4)) c_main_~i~0) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_457 Int)) (or (forall ((v_ArrVal_1471 Int) (v_ArrVal_1470 Int) (v_main_~i~0_456 Int)) (or (not (<= (+ v_main_~i~0_457 1) v_main_~i~0_456)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_457)) v_ArrVal_1470) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_457)))) (forall ((v_main_~i~0_456 Int)) (or (forall ((v_ArrVal_1471 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_456))))) is different from false [2022-01-31 00:58:32,002 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_main_~a~0.base) 0) 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (<= (+ 4 (div (* (- 1) c_main_~a~0.offset) 4)) c_main_~i~0) (forall ((v_main_~i~0_456 Int)) (or (forall ((v_ArrVal_1471 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_456)) v_ArrVal_1471) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_456))))) is different from false [2022-01-31 00:58:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 00:58:32,134 INFO L93 Difference]: Finished difference Result 249 states and 261 transitions. [2022-01-31 00:58:32,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-31 00:58:32,135 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.015151515151515) internal successors, (133), 64 states have internal predecessors, (133), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 66 [2022-01-31 00:58:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 00:58:32,136 INFO L225 Difference]: With dead ends: 249 [2022-01-31 00:58:32,136 INFO L226 Difference]: Without dead ends: 247 [2022-01-31 00:58:32,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 106 SyntacticMatches, 18 SemanticMatches, 81 ConstructedPredicates, 31 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 51.2s TimeCoverageRelationStatistics Valid=390, Invalid=2333, Unknown=53, NotChecked=4030, Total=6806 [2022-01-31 00:58:32,137 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 54 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1158 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 00:58:32,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 342 Invalid, 1793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 608 Invalid, 0 Unknown, 1158 Unchecked, 0.3s Time] [2022-01-31 00:58:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-01-31 00:58:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 235. [2022-01-31 00:58:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 205 states have (on average 1.053658536585366) internal successors, (216), 207 states have internal predecessors, (216), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-01-31 00:58:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 245 transitions. [2022-01-31 00:58:32,164 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 245 transitions. Word has length 66 [2022-01-31 00:58:32,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 00:58:32,165 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 245 transitions. [2022-01-31 00:58:32,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.015151515151515) internal successors, (133), 64 states have internal predecessors, (133), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 00:58:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 245 transitions. [2022-01-31 00:58:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 00:58:32,165 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 00:58:32,165 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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 00:58:32,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-01-31 00:58:32,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-31 00:58:32,380 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 00:58:32,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 00:58:32,380 INFO L85 PathProgramCache]: Analyzing trace with hash 106781068, now seen corresponding path program 12 times [2022-01-31 00:58:32,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 00:58:32,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342551871] [2022-01-31 00:58:32,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 00:58:32,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 00:58:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:58:33,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 00:58:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:58:33,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 00:58:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 00:58:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 11 proven. 72 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-31 00:58:34,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 00:58:34,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342551871] [2022-01-31 00:58:34,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342551871] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 00:58:34,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798993431] [2022-01-31 00:58:34,001 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 00:58:34,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 00:58:34,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 00:58:34,003 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 00:58:34,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-01-31 00:58:34,340 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-01-31 00:58:34,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 00:58:34,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 107 conjunts are in the unsatisfiable core [2022-01-31 00:58:34,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 00:58:34,376 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 00:58:34,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,425 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 23 treesize of output 22 [2022-01-31 00:58:34,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 00:58:34,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,630 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2022-01-31 00:58:34,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2022-01-31 00:58:34,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:34,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-01-31 00:58:35,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,084 INFO L353 Elim1Store]: treesize reduction 144, result has 23.4 percent of original size [2022-01-31 00:58:35,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, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 80 [2022-01-31 00:58:35,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:35,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,529 INFO L353 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-01-31 00:58:35,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 89 [2022-01-31 00:58:35,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:35,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:35,761 INFO L353 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-01-31 00:58:35,762 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 87 [2022-01-31 00:58:36,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:36,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,045 INFO L353 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-01-31 00:58:36,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 94 [2022-01-31 00:58:36,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:36,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,246 INFO L353 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-01-31 00:58:36,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 97 [2022-01-31 00:58:36,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:36,483 INFO L353 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2022-01-31 00:58:36,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 98 [2022-01-31 00:58:36,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:36,733 INFO L353 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-01-31 00:58:36,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 95 treesize of output 98 [2022-01-31 00:58:37,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,365 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:37,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 00:58:37,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,374 INFO L353 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-01-31 00:58:37,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 89 [2022-01-31 00:58:37,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:37,701 INFO L353 Elim1Store]: treesize reduction 94, result has 42.7 percent of original size [2022-01-31 00:58:37,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 66 treesize of output 106 [2022-01-31 00:58:38,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:38,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:38,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 00:58:38,196 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 00:58:38,196 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 87 [2022-01-31 00:58:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 22 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 00:58:38,592 INFO L328 TraceCheckSpWp]: Computing backward predicates...