/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/s22if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 01:26:41,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 01:26:41,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 01:26:41,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 01:26:41,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 01:26:41,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 01:26:41,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 01:26:41,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 01:26:41,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 01:26:41,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 01:26:41,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 01:26:41,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 01:26:41,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 01:26:41,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 01:26:41,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 01:26:41,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 01:26:41,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 01:26:41,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 01:26:41,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 01:26:41,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 01:26:41,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 01:26:41,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 01:26:41,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 01:26:41,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 01:26:41,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 01:26:41,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 01:26:41,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 01:26:41,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 01:26:41,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 01:26:41,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 01:26:41,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 01:26:41,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 01:26:41,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 01:26:41,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 01:26:41,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 01:26:41,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 01:26:41,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 01:26:41,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 01:26:41,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 01:26:41,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 01:26:41,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 01:26:41,247 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-01-31 01:26:41,271 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 01:26:41,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 01:26:41,271 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 01:26:41,271 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 01:26:41,272 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 01:26:41,272 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 01:26:41,272 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 01:26:41,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 01:26:41,273 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 01:26:41,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 01:26:41,273 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 01:26:41,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 01:26:41,274 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 01:26:41,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 01:26:41,274 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 01:26:41,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 01:26:41,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 01:26:41,274 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 01:26:41,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 01:26:41,274 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 01:26:41,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 01:26:41,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 01:26:41,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 01:26:41,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 01:26:41,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 01:26:41,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 01:26:41,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 01:26:41,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 01:26:41,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 01:26:41,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 01:26:41,275 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 01:26:41,275 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 01:26:41,275 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 01:26:41,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 01:26:41,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 01:26:41,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 01:26:41,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 01:26:41,472 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 01:26:41,473 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 01:26:41,474 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s22if.c [2022-01-31 01:26:41,533 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100636b36/f8afc6289e9b48ccbb2ba47235f99600/FLAG3f67b12d4 [2022-01-31 01:26:41,815 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 01:26:41,816 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s22if.c [2022-01-31 01:26:41,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100636b36/f8afc6289e9b48ccbb2ba47235f99600/FLAG3f67b12d4 [2022-01-31 01:26:42,260 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100636b36/f8afc6289e9b48ccbb2ba47235f99600 [2022-01-31 01:26:42,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 01:26:42,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 01:26:42,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 01:26:42,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 01:26:42,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 01:26:42,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:26:42" (1/1) ... [2022-01-31 01:26:42,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fec3dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:26:42, skipping insertion in model container [2022-01-31 01:26:42,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:26:42" (1/1) ... [2022-01-31 01:26:42,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 01:26:42,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 01:26:42,387 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/s22if.c[588,601] [2022-01-31 01:26:42,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 01:26:42,406 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 01:26:42,446 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/s22if.c[588,601] [2022-01-31 01:26:42,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 01:26:42,460 INFO L208 MainTranslator]: Completed translation [2022-01-31 01:26:42,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:26:42 WrapperNode [2022-01-31 01:26:42,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 01:26:42,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 01:26:42,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 01:26:42,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 01:26:42,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:26:42" (1/1) ... [2022-01-31 01:26:42,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:26:42" (1/1) ... [2022-01-31 01:26:42,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:26:42" (1/1) ... [2022-01-31 01:26:42,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:26:42" (1/1) ... [2022-01-31 01:26:42,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:26:42" (1/1) ... [2022-01-31 01:26:42,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:26:42" (1/1) ... [2022-01-31 01:26:42,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:26:42" (1/1) ... [2022-01-31 01:26:42,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 01:26:42,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 01:26:42,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 01:26:42,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 01:26:42,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:26:42" (1/1) ... [2022-01-31 01:26:42,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 01:26:42,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:42,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 01:26:42,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 01:26:42,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 01:26:42,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 01:26:42,560 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 01:26:42,560 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 01:26:42,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 01:26:42,560 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 01:26:42,560 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 01:26:42,560 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 01:26:42,561 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 01:26:42,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 01:26:42,561 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 01:26:42,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 01:26:42,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 01:26:42,561 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 01:26:42,561 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 01:26:42,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 01:26:42,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 01:26:42,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 01:26:42,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 01:26:42,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 01:26:42,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 01:26:42,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 01:26:42,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 01:26:42,617 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 01:26:42,618 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 01:26:42,802 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 01:26:42,806 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 01:26:42,806 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 01:26:42,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:26:42 BoogieIcfgContainer [2022-01-31 01:26:42,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 01:26:42,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 01:26:42,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 01:26:42,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 01:26:42,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 01:26:42" (1/3) ... [2022-01-31 01:26:42,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58522037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:26:42, skipping insertion in model container [2022-01-31 01:26:42,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:26:42" (2/3) ... [2022-01-31 01:26:42,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58522037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:26:42, skipping insertion in model container [2022-01-31 01:26:42,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:26:42" (3/3) ... [2022-01-31 01:26:42,821 INFO L111 eAbstractionObserver]: Analyzing ICFG s22if.c [2022-01-31 01:26:42,825 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 01:26:42,825 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 01:26:42,856 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 01:26:42,861 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 01:26:42,861 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 01:26:42,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 01:26:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 01:26:42,882 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:42,883 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:26:42,883 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:42,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1742232210, now seen corresponding path program 1 times [2022-01-31 01:26:42,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:42,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973446452] [2022-01-31 01:26:42,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:42,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:43,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:43,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:43,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:43,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973446452] [2022-01-31 01:26:43,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973446452] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 01:26:43,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 01:26:43,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 01:26:43,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333768583] [2022-01-31 01:26:43,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 01:26:43,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 01:26:43,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:43,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 01:26:43,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 01:26:43,147 INFO L87 Difference]: Start difference. First operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:43,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:43,217 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2022-01-31 01:26:43,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 01:26:43,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-01-31 01:26:43,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:43,225 INFO L225 Difference]: With dead ends: 62 [2022-01-31 01:26:43,226 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 01:26:43,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 01:26:43,232 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:43,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 01:26:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 01:26:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-31 01:26:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-01-31 01:26:43,262 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2022-01-31 01:26:43,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:43,262 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-01-31 01:26:43,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-01-31 01:26:43,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 01:26:43,264 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:43,264 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:26:43,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 01:26:43,265 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:43,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:43,266 INFO L85 PathProgramCache]: Analyzing trace with hash 416194299, now seen corresponding path program 1 times [2022-01-31 01:26:43,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:43,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020632155] [2022-01-31 01:26:43,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:43,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:43,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:43,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:26:43,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:43,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020632155] [2022-01-31 01:26:43,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020632155] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 01:26:43,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 01:26:43,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 01:26:43,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349138600] [2022-01-31 01:26:43,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 01:26:43,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 01:26:43,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:43,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 01:26:43,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 01:26:43,388 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:43,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:43,494 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-01-31 01:26:43,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 01:26:43,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-01-31 01:26:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:43,496 INFO L225 Difference]: With dead ends: 51 [2022-01-31 01:26:43,496 INFO L226 Difference]: Without dead ends: 37 [2022-01-31 01:26:43,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 01:26:43,501 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:43,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 29 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:26:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-31 01:26:43,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-01-31 01:26:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 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), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-01-31 01:26:43,520 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-01-31 01:26:43,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:43,520 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-01-31 01:26:43,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:43,521 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-01-31 01:26:43,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 01:26:43,521 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:43,521 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 01:26:43,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 01:26:43,522 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:43,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:43,522 INFO L85 PathProgramCache]: Analyzing trace with hash -708797194, now seen corresponding path program 1 times [2022-01-31 01:26:43,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:43,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565882569] [2022-01-31 01:26:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:43,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:43,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:43,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:26:43,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:43,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565882569] [2022-01-31 01:26:43,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565882569] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:43,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298425039] [2022-01-31 01:26:43,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:43,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:43,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:43,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:26:43,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 01:26:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:43,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 01:26:43,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:43,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 01:26:44,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:26:44,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:44,136 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:44,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:26:44,264 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 10 [2022-01-31 01:26:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:26:44,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:44,420 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_45 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse0 (select v_ArrVal_45 (+ main_~a~0.offset (* main_~i~0 4))))) (or (= (+ (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_45) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) .cse0) (* c_~N~0 3)) (not (= 3 .cse0))))) is different from false [2022-01-31 01:26:44,536 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:26:44,537 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 28 treesize of output 29 [2022-01-31 01:26:44,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:26:44,541 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 26 treesize of output 18 [2022-01-31 01:26:44,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-31 01:26:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-31 01:26:44,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298425039] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:44,575 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:26:44,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 24 [2022-01-31 01:26:44,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111319165] [2022-01-31 01:26:44,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:44,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 01:26:44,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:44,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 01:26:44,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=426, Unknown=2, NotChecked=42, Total=552 [2022-01-31 01:26:44,577 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 24 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:26:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:44,919 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-01-31 01:26:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 01:26:44,920 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-01-31 01:26:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:44,922 INFO L225 Difference]: With dead ends: 59 [2022-01-31 01:26:44,922 INFO L226 Difference]: Without dead ends: 53 [2022-01-31 01:26:44,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=721, Unknown=2, NotChecked=56, Total=930 [2022-01-31 01:26:44,923 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 64 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:44,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 125 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 334 Invalid, 0 Unknown, 197 Unchecked, 0.2s Time] [2022-01-31 01:26:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-31 01:26:44,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2022-01-31 01:26:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2022-01-31 01:26:44,929 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 31 [2022-01-31 01:26:44,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:44,929 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-01-31 01:26:44,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:26:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-01-31 01:26:44,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 01:26:44,930 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:44,930 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 01:26:44,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 01:26:45,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:45,162 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:45,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:45,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1518143820, now seen corresponding path program 1 times [2022-01-31 01:26:45,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:45,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396546832] [2022-01-31 01:26:45,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:45,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:45,175 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:26:45,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646265396] [2022-01-31 01:26:45,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:45,176 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:45,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:45,187 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:26:45,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 01:26:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:45,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-31 01:26:45,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:45,315 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 01:26:45,362 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 01:26:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:26:45,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:45,440 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 37 treesize of output 31 [2022-01-31 01:26:45,444 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 01:26:45,444 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 44 treesize of output 30 [2022-01-31 01:26:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:26:45,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:45,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396546832] [2022-01-31 01:26:45,470 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:26:45,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646265396] [2022-01-31 01:26:45,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646265396] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:45,470 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:26:45,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2022-01-31 01:26:45,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950939355] [2022-01-31 01:26:45,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:45,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 01:26:45,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:45,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 01:26:45,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:26:45,484 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:45,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:45,617 INFO L93 Difference]: Finished difference Result 87 states and 111 transitions. [2022-01-31 01:26:45,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 01:26:45,617 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 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 01:26:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:45,621 INFO L225 Difference]: With dead ends: 87 [2022-01-31 01:26:45,622 INFO L226 Difference]: Without dead ends: 73 [2022-01-31 01:26:45,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:26:45,625 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 34 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:45,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 162 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:26:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-31 01:26:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2022-01-31 01:26:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-01-31 01:26:45,636 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 31 [2022-01-31 01:26:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:45,636 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-01-31 01:26:45,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-01-31 01:26:45,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 01:26:45,637 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:45,637 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 01:26:45,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 01:26:45,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-31 01:26:45,858 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:45,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:45,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2104949834, now seen corresponding path program 1 times [2022-01-31 01:26:45,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:45,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431166948] [2022-01-31 01:26:45,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:45,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:45,882 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:26:45,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2098792275] [2022-01-31 01:26:45,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:45,882 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:45,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:45,904 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:26:45,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 01:26:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:45,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 01:26:45,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:45,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:26:46,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 01:26:46,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:26:46,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:46,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-01-31 01:26:46,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-01-31 01:26:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:26:46,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:46,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431166948] [2022-01-31 01:26:46,102 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:26:46,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098792275] [2022-01-31 01:26:46,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098792275] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:46,102 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:26:46,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-01-31 01:26:46,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481406911] [2022-01-31 01:26:46,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:46,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 01:26:46,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:46,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 01:26:46,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-31 01:26:46,104 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:46,151 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-01-31 01:26:46,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 01:26:46,153 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 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 01:26:46,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:46,154 INFO L225 Difference]: With dead ends: 90 [2022-01-31 01:26:46,154 INFO L226 Difference]: Without dead ends: 67 [2022-01-31 01:26:46,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-31 01:26:46,155 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:46,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 99 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 01:26:46,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-31 01:26:46,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2022-01-31 01:26:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-01-31 01:26:46,160 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 31 [2022-01-31 01:26:46,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:46,160 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-01-31 01:26:46,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:46,160 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-01-31 01:26:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 01:26:46,161 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:46,161 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 01:26:46,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 01:26:46,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:46,375 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:46,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:46,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1233490552, now seen corresponding path program 2 times [2022-01-31 01:26:46,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:46,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763943445] [2022-01-31 01:26:46,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:46,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:46,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:46,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:26:46,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:46,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763943445] [2022-01-31 01:26:46,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763943445] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:46,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87310303] [2022-01-31 01:26:46,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:26:46,448 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:46,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:46,453 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:26:46,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-31 01:26:46,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:26:46,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:26:46,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 01:26:46,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:26:46,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:26:46,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87310303] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:46,648 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:26:46,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 01:26:46,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734780025] [2022-01-31 01:26:46,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:46,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 01:26:46,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:46,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 01:26:46,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:26:46,649 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:46,868 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2022-01-31 01:26:46,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 01:26:46,869 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 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 01:26:46,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:46,869 INFO L225 Difference]: With dead ends: 97 [2022-01-31 01:26:46,870 INFO L226 Difference]: Without dead ends: 85 [2022-01-31 01:26:46,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-01-31 01:26:46,870 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:46,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 66 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:26:46,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-31 01:26:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2022-01-31 01:26:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 56 states have internal predecessors, (72), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2022-01-31 01:26:46,876 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 33 [2022-01-31 01:26:46,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:46,877 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2022-01-31 01:26:46,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:46,877 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2022-01-31 01:26:46,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 01:26:46,877 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:46,877 INFO L514 BasicCegarLoop]: trace histogram [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 01:26:46,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-31 01:26:47,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:47,094 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:47,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:47,094 INFO L85 PathProgramCache]: Analyzing trace with hash -41402357, now seen corresponding path program 3 times [2022-01-31 01:26:47,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:47,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547203083] [2022-01-31 01:26:47,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:47,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:47,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:47,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:26:47,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:47,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547203083] [2022-01-31 01:26:47,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547203083] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:47,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903758847] [2022-01-31 01:26:47,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:26:47,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:47,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:47,154 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:26:47,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-31 01:26:47,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 01:26:47,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:26:47,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 01:26:47,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:26:47,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 01:26:47,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903758847] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:47,357 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:26:47,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-01-31 01:26:47,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239512871] [2022-01-31 01:26:47,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:47,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 01:26:47,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:47,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 01:26:47,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:26:47,359 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:47,498 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2022-01-31 01:26:47,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 01:26:47,499 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-01-31 01:26:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:47,499 INFO L225 Difference]: With dead ends: 90 [2022-01-31 01:26:47,499 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 01:26:47,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:26:47,500 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 43 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:47,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 50 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:26:47,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 01:26:47,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-01-31 01:26:47,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-01-31 01:26:47,504 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 34 [2022-01-31 01:26:47,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:47,504 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-01-31 01:26:47,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:47,504 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-01-31 01:26:47,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 01:26:47,505 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:47,505 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:26:47,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 01:26:47,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:47,706 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:47,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:47,706 INFO L85 PathProgramCache]: Analyzing trace with hash 854203999, now seen corresponding path program 4 times [2022-01-31 01:26:47,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:47,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372348993] [2022-01-31 01:26:47,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:47,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:48,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:48,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 01:26:48,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:48,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372348993] [2022-01-31 01:26:48,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372348993] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:48,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140528124] [2022-01-31 01:26:48,013 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:26:48,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:48,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:48,014 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:26:48,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-31 01:26:48,059 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:26:48,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:26:48,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-31 01:26:48,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:48,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:26:48,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:48,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:48,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:48,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:48,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:48,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:48,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:48,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:48,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:48,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:26:48,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:48,454 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:26:48,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 43 [2022-01-31 01:26:48,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:48,573 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:26:48,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2022-01-31 01:26:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 01:26:48,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:49,054 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_207 (Array Int Int)) (main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_61 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_207))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_207 (+ main_~a~0.offset (* main_~i~0 4)))) (.cse2 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))))) (or (not (= .cse0 3)) (not (= .cse1 3)) (= (+ .cse0 .cse1 .cse2) (* c_~N~0 3)))))))) is different from false [2022-01-31 01:26:49,395 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_207 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_67 Int) (v_main_~i~0_61 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_207))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_207 (+ main_~a~0.offset (* v_main_~i~0_67 4)))) (.cse2 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))))) (or (not (= 3 .cse0)) (not (= .cse1 3)) (and (<= (+ c_main_~i~0 1) (div (+ .cse1 .cse2 .cse0) 3)) (<= (div (+ (- 1) .cse1 .cse2 .cse0) 3) c_main_~i~0)))))))) is different from false [2022-01-31 01:26:49,462 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_207 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_67 Int) (v_main_~i~0_61 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_207))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_207 (+ main_~a~0.offset (* v_main_~i~0_67 4)))) (.cse2 (select .cse4 |c_main_~#sum~0.offset|))) (let ((.cse0 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))))) (or (not (= 3 .cse0)) (not (= .cse1 3)) (and (<= (+ c_main_~i~0 2) (div (+ .cse1 .cse2 .cse0) 3)) (<= (div (+ (- 1) .cse1 .cse2 .cse0) 3) (+ c_main_~i~0 1))))))))) is different from false [2022-01-31 01:26:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2022-01-31 01:26:49,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140528124] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:49,562 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:26:49,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 38 [2022-01-31 01:26:49,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445093345] [2022-01-31 01:26:49,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:49,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-31 01:26:49,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:49,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-31 01:26:49,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1071, Unknown=4, NotChecked=204, Total=1406 [2022-01-31 01:26:49,563 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 38 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:50,450 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2022-01-31 01:26:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-31 01:26:50,450 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-01-31 01:26:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:50,451 INFO L225 Difference]: With dead ends: 108 [2022-01-31 01:26:50,451 INFO L226 Difference]: Without dead ends: 100 [2022-01-31 01:26:50,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=338, Invalid=2322, Unknown=4, NotChecked=306, Total=2970 [2022-01-31 01:26:50,452 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 54 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 571 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:50,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 187 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 578 Invalid, 0 Unknown, 571 Unchecked, 0.3s Time] [2022-01-31 01:26:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-01-31 01:26:50,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 78. [2022-01-31 01:26:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 71 states have internal predecessors, (91), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2022-01-31 01:26:50,459 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 39 [2022-01-31 01:26:50,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:50,459 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2022-01-31 01:26:50,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:50,459 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2022-01-31 01:26:50,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 01:26:50,460 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:50,460 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, 1] [2022-01-31 01:26:50,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-31 01:26:50,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:50,677 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:50,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:50,677 INFO L85 PathProgramCache]: Analyzing trace with hash 44857373, now seen corresponding path program 1 times [2022-01-31 01:26:50,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:50,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517161180] [2022-01-31 01:26:50,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:50,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:50,688 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:26:50,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2133383626] [2022-01-31 01:26:50,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:50,688 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:50,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:50,689 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:26:50,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-31 01:26:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:50,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-31 01:26:50,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:50,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 01:26:50,803 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 31 treesize of output 15 [2022-01-31 01:26:50,840 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 01:26:50,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 01:26:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 01:26:50,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:50,899 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_253) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 3)) is different from false [2022-01-31 01:26:50,904 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_253) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:26:50,929 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:26:50,929 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-01-31 01:26:50,933 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:26:50,933 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 01:26:50,935 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 01:26:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2022-01-31 01:26:50,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:50,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517161180] [2022-01-31 01:26:50,982 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:26:50,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133383626] [2022-01-31 01:26:50,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133383626] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:50,982 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:26:50,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2022-01-31 01:26:50,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072407705] [2022-01-31 01:26:50,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:50,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 01:26:50,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:50,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 01:26:50,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=145, Unknown=2, NotChecked=50, Total=240 [2022-01-31 01:26:50,983 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:51,149 INFO L93 Difference]: Finished difference Result 125 states and 157 transitions. [2022-01-31 01:26:51,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 01:26:51,149 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-01-31 01:26:51,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:51,150 INFO L225 Difference]: With dead ends: 125 [2022-01-31 01:26:51,150 INFO L226 Difference]: Without dead ends: 116 [2022-01-31 01:26:51,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=187, Unknown=2, NotChecked=58, Total=306 [2022-01-31 01:26:51,151 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 53 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:51,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 160 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 249 Invalid, 0 Unknown, 116 Unchecked, 0.1s Time] [2022-01-31 01:26:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-01-31 01:26:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 93. [2022-01-31 01:26:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.2674418604651163) internal successors, (109), 86 states have internal predecessors, (109), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2022-01-31 01:26:51,159 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 39 [2022-01-31 01:26:51,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:51,159 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2022-01-31 01:26:51,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-01-31 01:26:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 01:26:51,160 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:51,160 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, 1] [2022-01-31 01:26:51,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 01:26:51,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:51,380 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:51,381 INFO L85 PathProgramCache]: Analyzing trace with hash -976210981, now seen corresponding path program 1 times [2022-01-31 01:26:51,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:51,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736180178] [2022-01-31 01:26:51,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:51,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:51,391 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:26:51,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1651408149] [2022-01-31 01:26:51,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:51,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:51,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:51,396 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:26:51,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 01:26:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:51,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-31 01:26:51,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:51,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 01:26:51,504 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 01:26:51,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 01:26:51,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 01:26:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 01:26:51,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:51,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-01-31 01:26:51,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-01-31 01:26:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 01:26:51,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:51,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736180178] [2022-01-31 01:26:51,650 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:26:51,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651408149] [2022-01-31 01:26:51,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651408149] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:51,650 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:26:51,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-01-31 01:26:51,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759852161] [2022-01-31 01:26:51,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:51,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 01:26:51,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:51,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 01:26:51,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-31 01:26:51,651 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:51,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:51,760 INFO L93 Difference]: Finished difference Result 136 states and 171 transitions. [2022-01-31 01:26:51,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 01:26:51,760 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2022-01-31 01:26:51,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:51,761 INFO L225 Difference]: With dead ends: 136 [2022-01-31 01:26:51,761 INFO L226 Difference]: Without dead ends: 101 [2022-01-31 01:26:51,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-01-31 01:26:51,762 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:51,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 144 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:26:51,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-01-31 01:26:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2022-01-31 01:26:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 83 states have internal predecessors, (102), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-01-31 01:26:51,771 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 39 [2022-01-31 01:26:51,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:51,771 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-01-31 01:26:51,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-01-31 01:26:51,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 01:26:51,772 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:51,772 INFO L514 BasicCegarLoop]: trace histogram [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, 1] [2022-01-31 01:26:51,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-31 01:26:51,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 01:26:51,988 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:51,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:51,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1806332385, now seen corresponding path program 5 times [2022-01-31 01:26:51,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:51,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307263131] [2022-01-31 01:26:51,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:51,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:52,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:52,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 01:26:52,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:52,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307263131] [2022-01-31 01:26:52,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307263131] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:52,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011882266] [2022-01-31 01:26:52,084 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:26:52,084 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:52,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:52,085 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:26:52,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 01:26:52,149 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 01:26:52,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:26:52,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 01:26:52,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 01:26:52,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 01:26:52,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011882266] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:52,319 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:26:52,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 01:26:52,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369777114] [2022-01-31 01:26:52,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:52,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:26:52,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:52,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:26:52,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:26:52,320 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:52,520 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2022-01-31 01:26:52,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 01:26:52,521 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 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 01:26:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:52,522 INFO L225 Difference]: With dead ends: 126 [2022-01-31 01:26:52,522 INFO L226 Difference]: Without dead ends: 111 [2022-01-31 01:26:52,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 79 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 01:26:52,525 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 75 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:52,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 66 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:26:52,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-01-31 01:26:52,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 89. [2022-01-31 01:26:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:52,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2022-01-31 01:26:52,542 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 41 [2022-01-31 01:26:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:52,542 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2022-01-31 01:26:52,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-01-31 01:26:52,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 01:26:52,550 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:52,550 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:26:52,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-31 01:26:52,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:52,773 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:52,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1586682370, now seen corresponding path program 6 times [2022-01-31 01:26:52,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:52,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377704568] [2022-01-31 01:26:52,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:52,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:52,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:52,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 01:26:52,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:52,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377704568] [2022-01-31 01:26:52,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377704568] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:52,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800543555] [2022-01-31 01:26:52,835 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:26:52,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:52,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:52,836 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:26:52,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 01:26:52,894 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 01:26:52,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:26:52,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 01:26:52,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 01:26:52,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 01:26:53,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800543555] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:26:53,037 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:26:53,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 01:26:53,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769251815] [2022-01-31 01:26:53,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:26:53,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:26:53,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:26:53,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:26:53,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:26:53,038 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:53,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:26:53,192 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-01-31 01:26:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 01:26:53,192 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 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 42 [2022-01-31 01:26:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:26:53,193 INFO L225 Difference]: With dead ends: 120 [2022-01-31 01:26:53,193 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 01:26:53,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 82 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 01:26:53,193 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 68 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:26:53,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 53 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:26:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 01:26:53,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-01-31 01:26:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 47 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:26:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-01-31 01:26:53,198 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 42 [2022-01-31 01:26:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:26:53,198 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-01-31 01:26:53,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:26:53,198 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-01-31 01:26:53,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 01:26:53,198 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:26:53,198 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:26:53,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 01:26:53,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 01:26:53,415 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:26:53,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:26:53,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1783122278, now seen corresponding path program 7 times [2022-01-31 01:26:53,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:26:53,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603143686] [2022-01-31 01:26:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:26:53,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:26:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:53,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:26:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:53,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:26:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 01:26:53,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:26:53,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603143686] [2022-01-31 01:26:53,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603143686] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:26:53,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017034620] [2022-01-31 01:26:53,890 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:26:53,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:26:53,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:26:53,891 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:26:53,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 01:26:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:26:53,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-31 01:26:53,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:26:53,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:26:54,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:54,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:54,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:54,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:54,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:54,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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:54,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:54,221 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:54,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:54,251 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:54,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:54,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:26:54,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:54,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:26:54,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:54,481 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:26:54,482 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 45 [2022-01-31 01:26:54,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:54,620 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:26:54,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:26:54,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:26:54,784 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:26:54,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 15 [2022-01-31 01:26:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 01:26:54,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:26:59,837 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_124 Int) (v_ArrVal_437 (Array Int Int)) (main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_126 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_437))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse1 (select v_ArrVal_437 (+ main_~a~0.offset (* main_~i~0 4)))) (.cse2 (select .cse5 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_126))))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_124))))) (or (not (= 3 .cse0)) (not (= .cse1 3)) (= (* c_~N~0 3) (+ .cse1 .cse2 .cse3 .cse0)) (not (= 3 .cse3))))))))) is different from false [2022-01-31 01:27:00,620 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (< (+ c_main_~i~0 1) ~N~0) (forall ((v_main_~i~0_124 Int) (v_main_~i~0_133 Int) (v_ArrVal_437 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_126 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_437))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse5 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_437 (+ (* 4 v_main_~i~0_133) main_~a~0.offset)))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_126))))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_124))))) (or (= (+ .cse0 .cse1 .cse2 .cse3) (* 3 ~N~0)) (not (= 3 .cse3)) (not (= .cse0 3)) (not (= 3 .cse2))))))))) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:27:00,749 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_124 Int) (v_main_~i~0_133 Int) (v_ArrVal_437 (Array Int Int)) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_126 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_437))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse5 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_437 (+ (* 4 v_main_~i~0_133) main_~a~0.offset)))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_126))))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_124))))) (or (= (+ .cse0 .cse1 .cse2 .cse3) (* 3 ~N~0)) (not (= 3 .cse3)) (not (< (+ c_main_~i~0 1) ~N~0)) (not (= .cse0 3)) (not (= 3 .cse2)) (< (+ c_main_~i~0 2) ~N~0)))))))) is different from false [2022-01-31 01:27:01,010 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_124 Int) (v_main_~i~0_133 Int) (v_ArrVal_437 (Array Int Int)) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_126 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_437))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse5 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_437 (+ (* 4 v_main_~i~0_133) main_~a~0.offset)))) (let ((.cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_126))))) (let ((.cse0 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_124))))) (or (= (+ .cse0 .cse1 .cse2 .cse3) (* 3 ~N~0)) (< (+ c_main_~i~0 3) ~N~0) (not (= 3 .cse3)) (not (< (+ c_main_~i~0 2) ~N~0)) (not (= .cse0 3)) (not (= 3 .cse2))))))))) is different from false [2022-01-31 01:27:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 14 not checked. [2022-01-31 01:27:01,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017034620] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:27:01,164 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:27:01,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 18] total 48 [2022-01-31 01:27:01,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748031564] [2022-01-31 01:27:01,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:27:01,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-31 01:27:01,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:27:01,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-31 01:27:01,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1744, Unknown=8, NotChecked=348, Total=2256 [2022-01-31 01:27:01,166 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 48 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 states have internal predecessors, (87), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:27:02,793 INFO L93 Difference]: Finished difference Result 112 states and 136 transitions. [2022-01-31 01:27:02,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-31 01:27:02,794 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 states have internal predecessors, (87), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-01-31 01:27:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:27:02,794 INFO L225 Difference]: With dead ends: 112 [2022-01-31 01:27:02,794 INFO L226 Difference]: Without dead ends: 106 [2022-01-31 01:27:02,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=438, Invalid=3602, Unknown=8, NotChecked=508, Total=4556 [2022-01-31 01:27:02,796 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 577 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 01:27:02,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 233 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 686 Invalid, 0 Unknown, 577 Unchecked, 0.4s Time] [2022-01-31 01:27:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-01-31 01:27:02,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2022-01-31 01:27:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 90 states have internal predecessors, (113), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:27:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2022-01-31 01:27:02,804 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 47 [2022-01-31 01:27:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:27:02,804 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2022-01-31 01:27:02,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.891304347826087) internal successors, (87), 45 states have internal predecessors, (87), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-01-31 01:27:02,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 01:27:02,805 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:27:02,805 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:27:02,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-31 01:27:03,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 01:27:03,016 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:27:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:27:03,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1702498392, now seen corresponding path program 2 times [2022-01-31 01:27:03,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:27:03,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947777995] [2022-01-31 01:27:03,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:27:03,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:27:03,026 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:27:03,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409074466] [2022-01-31 01:27:03,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:27:03,026 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:27:03,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:27:03,027 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:27:03,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-31 01:27:03,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:27:03,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:27:03,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 01:27:03,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:27:03,195 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 31 treesize of output 15 [2022-01-31 01:27:03,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:03,243 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 01:27:03,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:03,307 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 01:27:03,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-31 01:27:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-31 01:27:03,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:27:03,413 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_497 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_497) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:27:03,421 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_497 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_497) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 3)) is different from false [2022-01-31 01:27:03,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_497 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_497) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) is different from false [2022-01-31 01:27:03,486 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:27:03,487 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-01-31 01:27:03,490 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:27:03,490 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 40 treesize of output 40 [2022-01-31 01:27:03,493 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 01:27:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2022-01-31 01:27:03,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:27:03,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947777995] [2022-01-31 01:27:03,567 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:27:03,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409074466] [2022-01-31 01:27:03,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409074466] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:27:03,568 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:27:03,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-01-31 01:27:03,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180201962] [2022-01-31 01:27:03,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:27:03,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 01:27:03,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:27:03,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 01:27:03,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=310, Unknown=3, NotChecked=114, Total=506 [2022-01-31 01:27:03,569 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:27:03,773 INFO L93 Difference]: Finished difference Result 153 states and 192 transitions. [2022-01-31 01:27:03,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 01:27:03,773 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 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 01:27:03,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:27:03,774 INFO L225 Difference]: With dead ends: 153 [2022-01-31 01:27:03,774 INFO L226 Difference]: Without dead ends: 144 [2022-01-31 01:27:03,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=372, Unknown=3, NotChecked=126, Total=600 [2022-01-31 01:27:03,775 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 76 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:27:03,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 213 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 421 Invalid, 0 Unknown, 197 Unchecked, 0.1s Time] [2022-01-31 01:27:03,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-01-31 01:27:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 121. [2022-01-31 01:27:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 114 states have (on average 1.2543859649122806) internal successors, (143), 114 states have internal predecessors, (143), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:27:03,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 149 transitions. [2022-01-31 01:27:03,786 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 149 transitions. Word has length 47 [2022-01-31 01:27:03,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:27:03,787 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 149 transitions. [2022-01-31 01:27:03,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:03,787 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 149 transitions. [2022-01-31 01:27:03,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 01:27:03,788 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:27:03,788 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:27:03,819 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 01:27:04,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-31 01:27:04,005 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:27:04,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:27:04,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1082057700, now seen corresponding path program 3 times [2022-01-31 01:27:04,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:27:04,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366489592] [2022-01-31 01:27:04,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:27:04,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:27:04,029 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:27:04,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2133149539] [2022-01-31 01:27:04,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:27:04,029 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:27:04,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:27:04,030 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:27:04,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-31 01:27:04,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-31 01:27:04,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:27:04,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-31 01:27:04,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:27:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-01-31 01:27:04,260 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-01-31 01:27:04,261 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 28 treesize of output 27 [2022-01-31 01:27:04,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:04,347 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 19 treesize of output 21 [2022-01-31 01:27:04,379 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:27:04,380 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 24 treesize of output 24 [2022-01-31 01:27:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 01:27:04,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:27:04,568 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_552 (Array Int Int))) (let ((.cse0 (+ main_~i~0 2))) (or (< .cse0 c_~N~0) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_552) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)))) (< c_~N~0 .cse0)))) is different from false [2022-01-31 01:27:04,893 INFO L353 Elim1Store]: treesize reduction 39, result has 41.8 percent of original size [2022-01-31 01:27:04,893 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 46 [2022-01-31 01:27:04,902 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-01-31 01:27:04,903 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 42 treesize of output 30 [2022-01-31 01:27:04,908 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 9 treesize of output 3 [2022-01-31 01:27:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 5 not checked. [2022-01-31 01:27:04,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:27:04,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366489592] [2022-01-31 01:27:04,985 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:27:04,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133149539] [2022-01-31 01:27:04,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133149539] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:27:04,985 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:27:04,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 28 [2022-01-31 01:27:04,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780372737] [2022-01-31 01:27:04,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:27:04,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 01:27:04,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:27:04,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 01:27:04,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=553, Unknown=18, NotChecked=50, Total=756 [2022-01-31 01:27:04,986 INFO L87 Difference]: Start difference. First operand 121 states and 149 transitions. Second operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:27:07,292 INFO L93 Difference]: Finished difference Result 184 states and 232 transitions. [2022-01-31 01:27:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 01:27:07,293 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 2 states have call successors, (4), 2 states have call predecessors, (4), 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 01:27:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:27:07,293 INFO L225 Difference]: With dead ends: 184 [2022-01-31 01:27:07,293 INFO L226 Difference]: Without dead ends: 178 [2022-01-31 01:27:07,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=272, Invalid=1046, Unknown=18, NotChecked=70, Total=1406 [2022-01-31 01:27:07,294 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:27:07,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 184 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 170 Invalid, 0 Unknown, 156 Unchecked, 0.1s Time] [2022-01-31 01:27:07,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-01-31 01:27:07,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 149. [2022-01-31 01:27:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 142 states have (on average 1.3028169014084507) internal successors, (185), 142 states have internal predecessors, (185), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:27:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 191 transitions. [2022-01-31 01:27:07,324 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 191 transitions. Word has length 47 [2022-01-31 01:27:07,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:27:07,324 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 191 transitions. [2022-01-31 01:27:07,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:07,324 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 191 transitions. [2022-01-31 01:27:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 01:27:07,325 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:27:07,325 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:27:07,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-31 01:27:07,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-31 01:27:07,526 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:27:07,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:27:07,526 INFO L85 PathProgramCache]: Analyzing trace with hash 13554650, now seen corresponding path program 2 times [2022-01-31 01:27:07,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:27:07,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234155235] [2022-01-31 01:27:07,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:27:07,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:27:07,535 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:27:07,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189183382] [2022-01-31 01:27:07,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:27:07,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:27:07,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:27:07,546 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:27:07,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-31 01:27:07,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:27:07,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:27:07,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 01:27:07,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:27:07,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-31 01:27:07,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:07,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 01:27:07,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:07,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 01:27:07,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-31 01:27:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 01:27:07,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:27:07,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-01-31 01:27:07,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-01-31 01:27:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 01:27:07,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:27:07,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234155235] [2022-01-31 01:27:07,933 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:27:07,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189183382] [2022-01-31 01:27:07,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189183382] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:27:07,933 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:27:07,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-01-31 01:27:07,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561903937] [2022-01-31 01:27:07,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:27:07,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 01:27:07,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:27:07,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 01:27:07,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-01-31 01:27:07,934 INFO L87 Difference]: Start difference. First operand 149 states and 191 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:08,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:27:08,114 INFO L93 Difference]: Finished difference Result 238 states and 315 transitions. [2022-01-31 01:27:08,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 01:27:08,114 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 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 01:27:08,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:27:08,115 INFO L225 Difference]: With dead ends: 238 [2022-01-31 01:27:08,115 INFO L226 Difference]: Without dead ends: 163 [2022-01-31 01:27:08,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-01-31 01:27:08,115 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:27:08,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 178 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:27:08,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-01-31 01:27:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2022-01-31 01:27:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 142 states have internal predecessors, (183), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:27:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 189 transitions. [2022-01-31 01:27:08,129 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 189 transitions. Word has length 47 [2022-01-31 01:27:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:27:08,129 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 189 transitions. [2022-01-31 01:27:08,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 189 transitions. [2022-01-31 01:27:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 01:27:08,130 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:27:08,130 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:27:08,146 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 01:27:08,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:27:08,337 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:27:08,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:27:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1992988644, now seen corresponding path program 8 times [2022-01-31 01:27:08,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:27:08,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655751942] [2022-01-31 01:27:08,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:27:08,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:27:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:08,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:27:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:08,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:27:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 01:27:08,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:27:08,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655751942] [2022-01-31 01:27:08,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655751942] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:27:08,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799598342] [2022-01-31 01:27:08,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:27:08,456 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:27:08,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:27:08,468 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:27:08,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-31 01:27:08,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:27:08,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:27:08,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 01:27:08,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:27:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 01:27:08,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:27:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 01:27:08,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799598342] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:27:08,766 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:27:08,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 01:27:08,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358571429] [2022-01-31 01:27:08,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:27:08,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 01:27:08,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:27:08,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 01:27:08,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 01:27:08,767 INFO L87 Difference]: Start difference. First operand 149 states and 189 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 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 01:27:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:27:09,036 INFO L93 Difference]: Finished difference Result 196 states and 251 transitions. [2022-01-31 01:27:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:27:09,037 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 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 49 [2022-01-31 01:27:09,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:27:09,037 INFO L225 Difference]: With dead ends: 196 [2022-01-31 01:27:09,037 INFO L226 Difference]: Without dead ends: 173 [2022-01-31 01:27:09,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2022-01-31 01:27:09,039 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 96 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:27:09,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 68 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:27:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-01-31 01:27:09,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 115. [2022-01-31 01:27:09,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 108 states have (on average 1.25) internal successors, (135), 108 states have internal predecessors, (135), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:27:09,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2022-01-31 01:27:09,053 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 49 [2022-01-31 01:27:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:27:09,053 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2022-01-31 01:27:09,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 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 01:27:09,053 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2022-01-31 01:27:09,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 01:27:09,054 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:27:09,054 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:27:09,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-31 01:27:09,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-31 01:27:09,255 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:27:09,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:27:09,256 INFO L85 PathProgramCache]: Analyzing trace with hash 836309991, now seen corresponding path program 9 times [2022-01-31 01:27:09,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:27:09,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530375912] [2022-01-31 01:27:09,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:27:09,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:27:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:09,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:27:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:09,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:27:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 01:27:09,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:27:09,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530375912] [2022-01-31 01:27:09,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530375912] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:27:09,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418718662] [2022-01-31 01:27:09,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:27:09,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:27:09,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:27:09,380 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:27:09,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-31 01:27:09,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 01:27:09,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:27:09,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 01:27:09,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:27:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 01:27:09,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:27:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 01:27:09,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418718662] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:27:09,718 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:27:09,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-01-31 01:27:09,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305148107] [2022-01-31 01:27:09,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:27:09,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 01:27:09,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:27:09,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 01:27:09,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 01:27:09,719 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:27:09,905 INFO L93 Difference]: Finished difference Result 143 states and 174 transitions. [2022-01-31 01:27:09,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 01:27:09,905 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 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 50 [2022-01-31 01:27:09,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:27:09,906 INFO L225 Difference]: With dead ends: 143 [2022-01-31 01:27:09,906 INFO L226 Difference]: Without dead ends: 68 [2022-01-31 01:27:09,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-31 01:27:09,907 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 101 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:27:09,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 49 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:27:09,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-31 01:27:09,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2022-01-31 01:27:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:27:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2022-01-31 01:27:09,912 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 50 [2022-01-31 01:27:09,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:27:09,913 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-01-31 01:27:09,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:09,913 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-01-31 01:27:09,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 01:27:09,913 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:27:09,913 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:27:09,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-01-31 01:27:10,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-31 01:27:10,131 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:27:10,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:27:10,132 INFO L85 PathProgramCache]: Analyzing trace with hash -217929789, now seen corresponding path program 10 times [2022-01-31 01:27:10,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:27:10,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271731771] [2022-01-31 01:27:10,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:27:10,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:27:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:10,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:27:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:10,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:27:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:27:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 01:27:10,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:27:10,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271731771] [2022-01-31 01:27:10,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271731771] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:27:10,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327253943] [2022-01-31 01:27:10,917 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:27:10,917 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:27:10,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:27:10,918 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:27:10,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-31 01:27:10,995 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:27:10,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:27:10,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 62 conjunts are in the unsatisfiable core [2022-01-31 01:27:10,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:27:11,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:27:11,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:11,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:27:11,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:11,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:27:11,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:11,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 14 treesize of output 16 [2022-01-31 01:27:11,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:11,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:27:11,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:11,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:27:11,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:11,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:27:11,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:11,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:27:11,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:11,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 14 treesize of output 16 [2022-01-31 01:27:11,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:11,564 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:27:11,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:11,718 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:27:11,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-01-31 01:27:11,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:11,873 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:27:11,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:27:12,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:12,012 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:27:12,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2022-01-31 01:27:12,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:12,117 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:27:12,117 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2022-01-31 01:27:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 01:27:12,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:27:30,240 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_788 (Array Int Int)) (v_main_~i~0_234 Int) (v_main_~i~0_232 Int) (main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_236 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_788))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse6 |c_main_~#sum~0.offset|)) (.cse4 (select v_ArrVal_788 (+ main_~a~0.offset (* main_~i~0 4))))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_236))))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_234) main_~a~0.offset)))) (let ((.cse0 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_232))))) (or (not (= .cse0 3)) (= (+ .cse0 .cse1 .cse2 .cse3 .cse4) (* c_~N~0 3)) (not (= 3 .cse4)) (not (= 3 .cse3)) (not (= .cse1 3)))))))))) is different from false [2022-01-31 01:27:34,044 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_ArrVal_788 (Array Int Int)) (v_main_~i~0_234 Int) (v_main_~i~0_232 Int) (v_main_~i~0_244 Int) (main_~a~0.offset Int) (v_main_~i~0_236 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_788))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse6 |c_main_~#sum~0.offset|)) (.cse4 (select v_ArrVal_788 (+ main_~a~0.offset (* 4 v_main_~i~0_244))))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_236))))) (let ((.cse0 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse4))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_234) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse0 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_232))))) (or (not (= 3 .cse0)) (not (= .cse1 3)) (not (= .cse2 3)) (= (+ .cse2 .cse1 .cse3 .cse0 .cse4) (* 3 ~N~0)) (not (= 3 .cse4)))))))))) (< (+ c_main_~i~0 1) ~N~0) (not (< c_main_~i~0 ~N~0)))) is different from false [2022-01-31 01:27:34,536 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_788 (Array Int Int)) (v_main_~i~0_234 Int) (v_main_~i~0_232 Int) (v_main_~i~0_244 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_236 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_788))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse6 |c_main_~#sum~0.offset|)) (.cse4 (select v_ArrVal_788 (+ main_~a~0.offset (* 4 v_main_~i~0_244))))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_236))))) (let ((.cse0 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse4))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_234) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse0 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_232))))) (or (not (= 3 .cse0)) (not (= .cse1 3)) (not (= .cse2 3)) (= (+ .cse2 .cse1 .cse3 .cse0 .cse4) (* 3 ~N~0)) (not (= 3 .cse4)) (not (< (+ c_main_~i~0 1) ~N~0)) (< (+ c_main_~i~0 2) ~N~0))))))))) is different from false [2022-01-31 01:27:35,445 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_788 (Array Int Int)) (v_main_~i~0_234 Int) (v_main_~i~0_232 Int) (v_main_~i~0_244 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_236 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_788))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse6 |c_main_~#sum~0.offset|)) (.cse4 (select v_ArrVal_788 (+ main_~a~0.offset (* 4 v_main_~i~0_244))))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_236))))) (let ((.cse0 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse4))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_234) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse0 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_232))))) (or (not (= 3 .cse0)) (< (+ c_main_~i~0 3) ~N~0) (not (= .cse1 3)) (not (= .cse2 3)) (not (< (+ c_main_~i~0 2) ~N~0)) (= (+ .cse2 .cse1 .cse3 .cse0 .cse4) (* 3 ~N~0)) (not (= 3 .cse4)))))))))) is different from false [2022-01-31 01:27:36,255 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_788 (Array Int Int)) (v_main_~i~0_234 Int) (v_main_~i~0_232 Int) (v_main_~i~0_244 Int) (~N~0 Int) (main_~a~0.offset Int) (v_main_~i~0_236 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_788))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse6 |c_main_~#sum~0.offset|)) (.cse4 (select v_ArrVal_788 (+ main_~a~0.offset (* 4 v_main_~i~0_244))))) (let ((.cse1 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_236))))) (let ((.cse0 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse4))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_234) main_~a~0.offset)))) (let ((.cse2 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse0 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_232))))) (or (< (+ c_main_~i~0 4) ~N~0) (not (= 3 .cse0)) (not (= .cse1 3)) (not (= .cse2 3)) (not (< (+ c_main_~i~0 3) ~N~0)) (= (+ .cse2 .cse1 .cse3 .cse0 .cse4) (* 3 ~N~0)) (not (= 3 .cse4)))))))))) is different from false [2022-01-31 01:27:36,728 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 23 not checked. [2022-01-31 01:27:36,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327253943] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:27:36,728 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:27:36,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 21] total 60 [2022-01-31 01:27:36,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362759850] [2022-01-31 01:27:36,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:27:36,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-01-31 01:27:36,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:27:36,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-01-31 01:27:36,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2760, Unknown=13, NotChecked=550, Total=3540 [2022-01-31 01:27:36,730 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 60 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 57 states have internal predecessors, (107), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:27:39,764 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2022-01-31 01:27:39,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-31 01:27:39,765 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 57 states have internal predecessors, (107), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-01-31 01:27:39,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:27:39,766 INFO L225 Difference]: With dead ends: 135 [2022-01-31 01:27:39,766 INFO L226 Difference]: Without dead ends: 129 [2022-01-31 01:27:39,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 86 SyntacticMatches, 10 SemanticMatches, 81 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=593, Invalid=5420, Unknown=13, NotChecked=780, Total=6806 [2022-01-31 01:27:39,768 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 66 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 721 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 01:27:39,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 288 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 676 Invalid, 0 Unknown, 721 Unchecked, 0.4s Time] [2022-01-31 01:27:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-01-31 01:27:39,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2022-01-31 01:27:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 115 states have (on average 1.2521739130434784) internal successors, (144), 115 states have internal predecessors, (144), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:27:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 150 transitions. [2022-01-31 01:27:39,786 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 150 transitions. Word has length 55 [2022-01-31 01:27:39,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:27:39,786 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 150 transitions. [2022-01-31 01:27:39,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 58 states have (on average 1.8448275862068966) internal successors, (107), 57 states have internal predecessors, (107), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 150 transitions. [2022-01-31 01:27:39,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 01:27:39,786 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:27:39,786 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:27:39,803 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 01:27:39,991 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 01:27:39,992 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:27:39,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:27:39,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1027276415, now seen corresponding path program 4 times [2022-01-31 01:27:39,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:27:39,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656870763] [2022-01-31 01:27:39,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:27:39,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:27:40,003 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:27:40,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016612883] [2022-01-31 01:27:40,004 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:27:40,004 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:27:40,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:27:40,005 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 01:27:40,006 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 01:27:40,090 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:27:40,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:27:40,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-31 01:27:40,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:27:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-31 01:27:40,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:40,285 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 18 treesize of output 20 [2022-01-31 01:27:40,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:40,328 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 18 treesize of output 20 [2022-01-31 01:27:40,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:40,367 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 18 treesize of output 20 [2022-01-31 01:27:40,400 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 01:27:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 01:27:40,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:27:40,459 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_863 (Array Int Int))) (= (+ (- 2) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_863) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4))) 1)) is different from false [2022-01-31 01:27:40,464 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_863 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_863) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) (- 2)) 1)) is different from false [2022-01-31 01:27:40,473 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_863 (Array Int Int))) (= (+ (- 2) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_863) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12))) 1)) is different from false [2022-01-31 01:27:40,481 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_863 (Array Int Int))) (= (+ (- 2) (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_863) c_main_~a~0.base) (+ c_main_~a~0.offset 12))) 1)) is different from false [2022-01-31 01:27:40,508 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:27:40,509 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-01-31 01:27:40,512 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:27:40,512 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 42 treesize of output 42 [2022-01-31 01:27:40,515 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 13 treesize of output 9 [2022-01-31 01:27:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 22 not checked. [2022-01-31 01:27:40,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:27:40,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656870763] [2022-01-31 01:27:40,646 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:27:40,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016612883] [2022-01-31 01:27:40,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016612883] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:27:40,646 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:27:40,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2022-01-31 01:27:40,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354822835] [2022-01-31 01:27:40,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:27:40,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 01:27:40,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:27:40,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 01:27:40,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=421, Unknown=4, NotChecked=180, Total=702 [2022-01-31 01:27:40,647 INFO L87 Difference]: Start difference. First operand 122 states and 150 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:27:41,117 INFO L93 Difference]: Finished difference Result 246 states and 317 transitions. [2022-01-31 01:27:41,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 01:27:41,117 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-01-31 01:27:41,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:27:41,118 INFO L225 Difference]: With dead ends: 246 [2022-01-31 01:27:41,118 INFO L226 Difference]: Without dead ends: 237 [2022-01-31 01:27:41,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 83 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=533, Unknown=4, NotChecked=204, Total=870 [2022-01-31 01:27:41,119 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 109 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:27:41,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 223 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 610 Invalid, 0 Unknown, 308 Unchecked, 0.3s Time] [2022-01-31 01:27:41,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-01-31 01:27:41,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 152. [2022-01-31 01:27:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 145 states have internal predecessors, (182), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:27:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 188 transitions. [2022-01-31 01:27:41,140 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 188 transitions. Word has length 55 [2022-01-31 01:27:41,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:27:41,140 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 188 transitions. [2022-01-31 01:27:41,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 27 states have internal predecessors, (72), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2022-01-31 01:27:41,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 01:27:41,140 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:27:41,141 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:27:41,166 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 01:27:41,366 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 01:27:41,366 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:27:41,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:27:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash 483134789, now seen corresponding path program 5 times [2022-01-31 01:27:41,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:27:41,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579211778] [2022-01-31 01:27:41,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:27:41,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:27:41,379 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:27:41,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [693165136] [2022-01-31 01:27:41,379 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:27:41,380 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:27:41,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:27:41,381 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 01:27:41,410 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 01:27:41,494 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-01-31 01:27:41,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:27:41,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-31 01:27:41,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:27:41,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 01:27:41,588 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 37 treesize of output 17 [2022-01-31 01:27:41,635 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 01:27:41,635 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 01:27:41,678 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 01:27:41,710 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 01:27:41,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 19 treesize of output 7 [2022-01-31 01:27:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-31 01:27:41,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:27:41,796 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_932 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_932) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:27:41,802 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_932 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_932) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)))) is different from false [2022-01-31 01:27:41,811 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_932 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_932) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 3)) is different from false [2022-01-31 01:27:41,820 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_932 (Array Int Int)) (v_ArrVal_929 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_929)) |c_main_~#sum~0.base| v_ArrVal_932) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 3)) is different from false [2022-01-31 01:27:41,835 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_281 Int)) (or (forall ((v_ArrVal_932 (Array Int Int)) (v_ArrVal_929 Int)) (= 3 (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_281)) v_ArrVal_929)) |c_main_~#sum~0.base| v_ArrVal_932) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_281)))) is different from false [2022-01-31 01:27:42,654 INFO L353 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2022-01-31 01:27:42,654 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-01-31 01:27:42,660 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:27:42,660 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 01:27:42,663 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 01:27:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 22 not checked. [2022-01-31 01:27:42,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:27:42,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579211778] [2022-01-31 01:27:42,735 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:27:42,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693165136] [2022-01-31 01:27:42,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693165136] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:27:42,735 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:27:42,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2022-01-31 01:27:42,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12044722] [2022-01-31 01:27:42,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:27:42,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 01:27:42,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:27:42,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 01:27:42,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=253, Unknown=5, NotChecked=180, Total=506 [2022-01-31 01:27:42,736 INFO L87 Difference]: Start difference. First operand 152 states and 188 transitions. Second operand has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:44,800 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_281 Int)) (or (forall ((v_ArrVal_932 (Array Int Int)) (v_ArrVal_929 Int)) (= 3 (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_281)) v_ArrVal_929)) |c_main_~#sum~0.base| v_ArrVal_932) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_281)))) (= 3 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (= c_main_~i~0 2) (not (= |c_main_~#sum~0.base| c_main_~a~0.base))) is different from false [2022-01-31 01:27:46,820 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_281 Int)) (or (forall ((v_ArrVal_932 (Array Int Int)) (v_ArrVal_929 Int)) (= 3 (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_281)) v_ArrVal_929)) |c_main_~#sum~0.base| v_ArrVal_932) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_281)))) (forall ((v_ArrVal_932 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_932) c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 3)) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)) 3)) is different from false [2022-01-31 01:27:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:27:46,959 INFO L93 Difference]: Finished difference Result 190 states and 235 transitions. [2022-01-31 01:27:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 01:27:46,960 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-01-31 01:27:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:27:46,960 INFO L225 Difference]: With dead ends: 190 [2022-01-31 01:27:46,961 INFO L226 Difference]: Without dead ends: 176 [2022-01-31 01:27:46,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 86 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=89, Invalid=352, Unknown=7, NotChecked=308, Total=756 [2022-01-31 01:27:46,962 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 319 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:27:46,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 232 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 207 Invalid, 0 Unknown, 319 Unchecked, 0.1s Time] [2022-01-31 01:27:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-01-31 01:27:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2022-01-31 01:27:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 166 states have (on average 1.2469879518072289) internal successors, (207), 166 states have internal predecessors, (207), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:27:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 213 transitions. [2022-01-31 01:27:46,986 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 213 transitions. Word has length 55 [2022-01-31 01:27:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:27:46,986 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 213 transitions. [2022-01-31 01:27:46,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 213 transitions. [2022-01-31 01:27:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 01:27:46,987 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:27:46,987 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:27:47,034 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 01:27:47,220 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 01:27:47,220 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:27:47,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:27:47,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1229047039, now seen corresponding path program 6 times [2022-01-31 01:27:47,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:27:47,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730967734] [2022-01-31 01:27:47,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:27:47,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:27:47,232 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:27:47,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492748548] [2022-01-31 01:27:47,232 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:27:47,232 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:27:47,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:27:47,240 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 01:27:47,257 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 01:27:47,378 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-31 01:27:47,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:27:47,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-31 01:27:47,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:27:47,486 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 37 treesize of output 17 [2022-01-31 01:27:47,545 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 01:27:47,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 01:27:47,586 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-31 01:27:47,586 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-31 01:27:47,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:27:47,643 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 01:27:47,674 INFO L353 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-01-31 01:27:47,675 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 21 treesize of output 10 [2022-01-31 01:27:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-01-31 01:27:47,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:27:47,772 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1001) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:27:47,778 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1001) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:27:47,788 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1000 Int) (v_ArrVal_1001 (Array Int Int))) (= 3 (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_1000)) |c_main_~#sum~0.base| v_ArrVal_1001) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) is different from false [2022-01-31 01:27:47,803 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_300 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_300)) (forall ((v_ArrVal_1000 Int) (v_ArrVal_1001 (Array Int Int))) (= 3 (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_300)) v_ArrVal_1000)) |c_main_~#sum~0.base| v_ArrVal_1001) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))))) is different from false [2022-01-31 01:27:47,823 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_300 Int) (v_ArrVal_1000 Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_997 Int)) (or (= 3 (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_997) (+ c_main_~a~0.offset (* 4 v_main_~i~0_300)) v_ArrVal_1000)) |c_main_~#sum~0.base| v_ArrVal_1001) c_main_~a~0.base) (+ c_main_~a~0.offset 4))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_300)))) is different from false [2022-01-31 01:27:47,863 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_301 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_301)) (forall ((v_main_~i~0_300 Int) (v_ArrVal_1000 Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_997 Int)) (or (not (<= (+ v_main_~i~0_301 1) v_main_~i~0_300)) (= 3 (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_~a~0.offset (* 4 v_main_~i~0_301)) v_ArrVal_997) (+ c_main_~a~0.offset (* 4 v_main_~i~0_300)) v_ArrVal_1000)) |c_main_~#sum~0.base| v_ArrVal_1001) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))))) is different from false [2022-01-31 01:27:47,944 INFO L353 Elim1Store]: treesize reduction 122, result has 24.2 percent of original size [2022-01-31 01:27:47,944 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 55 [2022-01-31 01:27:47,949 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:27:47,949 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 40 treesize of output 40 [2022-01-31 01:27:47,951 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 01:27:48,020 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 22 not checked. [2022-01-31 01:27:48,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:27:48,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730967734] [2022-01-31 01:27:48,021 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:27:48,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492748548] [2022-01-31 01:27:48,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492748548] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:27:48,021 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:27:48,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2022-01-31 01:27:48,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903022466] [2022-01-31 01:27:48,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:27:48,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-31 01:27:48,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:27:48,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-31 01:27:48,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=345, Unknown=6, NotChecked=258, Total=702 [2022-01-31 01:27:48,022 INFO L87 Difference]: Start difference. First operand 173 states and 213 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:50,085 WARN L838 $PredicateComparison]: unable to prove that (and (= 3 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (forall ((v_main_~i~0_301 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_301)) (forall ((v_main_~i~0_300 Int) (v_ArrVal_1000 Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_997 Int)) (or (not (<= (+ v_main_~i~0_301 1) v_main_~i~0_300)) (= 3 (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_~a~0.offset (* 4 v_main_~i~0_301)) v_ArrVal_997) (+ c_main_~a~0.offset (* 4 v_main_~i~0_300)) v_ArrVal_1000)) |c_main_~#sum~0.base| v_ArrVal_1001) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= c_main_~i~0 1)) is different from false [2022-01-31 01:27:52,110 WARN L838 $PredicateComparison]: unable to prove that (and (<= 2 c_main_~i~0) (forall ((v_main_~i~0_301 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_301)) (forall ((v_main_~i~0_300 Int) (v_ArrVal_1000 Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_997 Int)) (or (not (<= (+ v_main_~i~0_301 1) v_main_~i~0_300)) (= 3 (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_~a~0.offset (* 4 v_main_~i~0_301)) v_ArrVal_997) (+ c_main_~a~0.offset (* 4 v_main_~i~0_300)) v_ArrVal_1000)) |c_main_~#sum~0.base| v_ArrVal_1001) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_300 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_300)) (forall ((v_ArrVal_1000 Int) (v_ArrVal_1001 (Array Int Int))) (= 3 (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_300)) v_ArrVal_1000)) |c_main_~#sum~0.base| v_ArrVal_1001) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 3)) is different from false [2022-01-31 01:27:54,142 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_301 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_301)) (forall ((v_main_~i~0_300 Int) (v_ArrVal_1000 Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_997 Int)) (or (not (<= (+ v_main_~i~0_301 1) v_main_~i~0_300)) (= 3 (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_~a~0.offset (* 4 v_main_~i~0_301)) v_ArrVal_997) (+ c_main_~a~0.offset (* 4 v_main_~i~0_300)) v_ArrVal_1000)) |c_main_~#sum~0.base| v_ArrVal_1001) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (forall ((v_main_~i~0_300 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_300)) (forall ((v_ArrVal_1000 Int) (v_ArrVal_1001 (Array Int Int))) (= 3 (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_300)) v_ArrVal_1000)) |c_main_~#sum~0.base| v_ArrVal_1001) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))))) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 4)) 3) (<= 3 c_main_~i~0) (forall ((v_ArrVal_1001 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1001) c_main_~a~0.base) (+ c_main_~a~0.offset 4))))) is different from false [2022-01-31 01:27:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:27:54,334 INFO L93 Difference]: Finished difference Result 203 states and 248 transitions. [2022-01-31 01:27:54,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 01:27:54,337 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-01-31 01:27:54,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:27:54,337 INFO L225 Difference]: With dead ends: 203 [2022-01-31 01:27:54,337 INFO L226 Difference]: Without dead ends: 164 [2022-01-31 01:27:54,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 84 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=111, Invalid=378, Unknown=9, NotChecked=432, Total=930 [2022-01-31 01:27:54,338 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 245 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:27:54,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 260 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 285 Invalid, 0 Unknown, 245 Unchecked, 0.2s Time] [2022-01-31 01:27:54,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-01-31 01:27:54,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 153. [2022-01-31 01:27:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 146 states have (on average 1.1917808219178083) internal successors, (174), 146 states have internal predecessors, (174), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:27:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 180 transitions. [2022-01-31 01:27:54,363 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 180 transitions. Word has length 55 [2022-01-31 01:27:54,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:27:54,363 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 180 transitions. [2022-01-31 01:27:54,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:27:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 180 transitions. [2022-01-31 01:27:54,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 01:27:54,364 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:27:54,364 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:27:54,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-01-31 01:27:54,581 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 01:27:54,582 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:27:54,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:27:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash -808421697, now seen corresponding path program 3 times [2022-01-31 01:27:54,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:27:54,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831102610] [2022-01-31 01:27:54,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:27:54,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:27:54,591 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:27:54,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [640585193] [2022-01-31 01:27:54,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:27:54,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:27:54,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:27:54,596 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 01:27:54,597 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 01:27:54,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-31 01:27:54,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:27:54,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-31 01:27:54,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:27:54,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-31 01:27:54,910 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 01:27:54,910 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 01:27:54,972 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-31 01:27:54,973 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 01:27:55,024 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-01-31 01:27:55,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-01-31 01:27:55,160 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:27:55,161 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 29 treesize of output 29 [2022-01-31 01:27:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 01:27:55,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:27:56,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_322 Int) (main_~i~0 Int) (v_ArrVal_1070 Int)) (or (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_1070) (+ c_main_~a~0.offset (* 4 v_main_~i~0_322))) 1) (< (+ v_main_~i~0_322 1) c_~N~0) (not (< v_main_~i~0_322 c_~N~0)) (not (<= (+ main_~i~0 1) v_main_~i~0_322)))) is different from false [2022-01-31 01:27:58,207 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_322 Int) (v_ArrVal_1068 Int) (v_main_~i~0_324 Int) (v_ArrVal_1070 Int)) (or (not (<= (+ v_main_~i~0_324 1) v_main_~i~0_322)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1068) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324)) v_ArrVal_1070) (+ c_main_~a~0.offset (* 4 v_main_~i~0_322))) 1) (< (+ v_main_~i~0_322 1) c_~N~0) (not (< v_main_~i~0_322 c_~N~0)))) is different from false [2022-01-31 01:28:00,323 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_325 Int)) (or (not (<= v_main_~i~0_325 (+ c_main_~i~0 1))) (forall ((v_main_~i~0_322 Int) (v_ArrVal_1068 Int) (v_main_~i~0_324 Int) (v_ArrVal_1070 Int)) (or (not (<= (+ v_main_~i~0_324 1) v_main_~i~0_322)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_325)) v_ArrVal_1068) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324)) v_ArrVal_1070) (+ c_main_~a~0.offset (* 4 v_main_~i~0_322))) 1) (< (+ v_main_~i~0_322 1) c_~N~0) (not (< v_main_~i~0_322 c_~N~0)))))) is different from false [2022-01-31 01:28:01,173 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_322 Int) (v_ArrVal_1068 Int) (v_ArrVal_1067 Int) (v_main_~i~0_324 Int) (v_main_~i~0_325 Int) (v_ArrVal_1070 Int)) (or (not (<= (+ v_main_~i~0_324 1) v_main_~i~0_322)) (not (<= v_main_~i~0_325 (+ c_main_~i~0 1))) (< (+ v_main_~i~0_322 1) c_~N~0) (= (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_1067) (+ c_main_~a~0.offset (* 4 v_main_~i~0_325)) v_ArrVal_1068) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324)) v_ArrVal_1070) (+ c_main_~a~0.offset (* 4 v_main_~i~0_322))) 1) (not (< v_main_~i~0_322 c_~N~0)))) is different from false [2022-01-31 01:28:03,366 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_326 Int)) (or (forall ((v_main_~i~0_322 Int) (v_ArrVal_1068 Int) (v_ArrVal_1067 Int) (v_main_~i~0_324 Int) (v_main_~i~0_325 Int) (v_ArrVal_1070 Int)) (or (not (<= v_main_~i~0_325 (+ v_main_~i~0_326 1))) (not (<= (+ v_main_~i~0_324 1) v_main_~i~0_322)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_326)) v_ArrVal_1067) (+ c_main_~a~0.offset (* 4 v_main_~i~0_325)) v_ArrVal_1068) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324)) v_ArrVal_1070) (+ c_main_~a~0.offset (* 4 v_main_~i~0_322))) 1) (< (+ v_main_~i~0_322 1) c_~N~0) (not (< v_main_~i~0_322 c_~N~0)))) (not (<= v_main_~i~0_326 0)))) is different from false [2022-01-31 01:28:14,337 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 39 treesize of output 37 [2022-01-31 01:28:14,344 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 7430 treesize of output 7334 [2022-01-31 01:28:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 20 not checked. [2022-01-31 01:28:40,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:28:40,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831102610] [2022-01-31 01:28:40,084 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:28:40,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640585193] [2022-01-31 01:28:40,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640585193] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:28:40,084 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:28:40,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2022-01-31 01:28:40,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451454641] [2022-01-31 01:28:40,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:28:40,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-31 01:28:40,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:28:40,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-31 01:28:40,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=571, Unknown=10, NotChecked=280, Total=1056 [2022-01-31 01:28:40,085 INFO L87 Difference]: Start difference. First operand 153 states and 180 transitions. Second operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:28:49,240 WARN L228 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 58 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:29:03,344 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_312 Int)) (and (<= c_~N~0 (+ v_main_~i~0_312 1)) (<= 3 v_main_~i~0_312) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_312))) 1) (< v_main_~i~0_312 c_~N~0))) (forall ((v_main_~i~0_326 Int)) (or (forall ((v_main_~i~0_322 Int) (v_ArrVal_1068 Int) (v_ArrVal_1067 Int) (v_main_~i~0_324 Int) (v_main_~i~0_325 Int) (v_ArrVal_1070 Int)) (or (not (<= v_main_~i~0_325 (+ v_main_~i~0_326 1))) (not (<= (+ v_main_~i~0_324 1) v_main_~i~0_322)) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_326)) v_ArrVal_1067) (+ c_main_~a~0.offset (* 4 v_main_~i~0_325)) v_ArrVal_1068) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324)) v_ArrVal_1070) (+ c_main_~a~0.offset (* 4 v_main_~i~0_322))) 1) (< (+ v_main_~i~0_322 1) c_~N~0) (not (< v_main_~i~0_322 c_~N~0)))) (not (<= v_main_~i~0_326 0))))) is different from false [2022-01-31 01:29:04,165 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_312 Int)) (and (<= c_~N~0 (+ v_main_~i~0_312 1)) (<= 3 v_main_~i~0_312) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_312))) 1) (< v_main_~i~0_312 c_~N~0))) (forall ((v_main_~i~0_322 Int) (v_ArrVal_1068 Int) (v_ArrVal_1067 Int) (v_main_~i~0_324 Int) (v_main_~i~0_325 Int) (v_ArrVal_1070 Int)) (or (not (<= (+ v_main_~i~0_324 1) v_main_~i~0_322)) (not (<= v_main_~i~0_325 (+ c_main_~i~0 1))) (< (+ v_main_~i~0_322 1) c_~N~0) (= (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_1067) (+ c_main_~a~0.offset (* 4 v_main_~i~0_325)) v_ArrVal_1068) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324)) v_ArrVal_1070) (+ c_main_~a~0.offset (* 4 v_main_~i~0_322))) 1) (not (< v_main_~i~0_322 c_~N~0)))) (<= c_main_~i~0 0)) is different from false [2022-01-31 01:29:06,171 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_312 Int)) (and (<= c_~N~0 (+ v_main_~i~0_312 1)) (<= 3 v_main_~i~0_312) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_312))) 1) (< v_main_~i~0_312 c_~N~0))) (forall ((v_main_~i~0_325 Int)) (or (not (<= v_main_~i~0_325 (+ c_main_~i~0 1))) (forall ((v_main_~i~0_322 Int) (v_ArrVal_1068 Int) (v_main_~i~0_324 Int) (v_ArrVal_1070 Int)) (or (not (<= (+ v_main_~i~0_324 1) v_main_~i~0_322)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_325)) v_ArrVal_1068) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324)) v_ArrVal_1070) (+ c_main_~a~0.offset (* 4 v_main_~i~0_322))) 1) (< (+ v_main_~i~0_322 1) c_~N~0) (not (< v_main_~i~0_322 c_~N~0)))))) (<= c_main_~i~0 0)) is different from false [2022-01-31 01:29:06,622 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_312 Int)) (and (<= c_~N~0 (+ v_main_~i~0_312 1)) (<= 3 v_main_~i~0_312) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_312))) 1) (< v_main_~i~0_312 c_~N~0))) (<= c_main_~i~0 1) (forall ((v_main_~i~0_322 Int) (v_ArrVal_1068 Int) (v_main_~i~0_324 Int) (v_ArrVal_1070 Int)) (or (not (<= (+ v_main_~i~0_324 1) v_main_~i~0_322)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1068) (+ c_main_~a~0.offset (* 4 v_main_~i~0_324)) v_ArrVal_1070) (+ c_main_~a~0.offset (* 4 v_main_~i~0_322))) 1) (< (+ v_main_~i~0_322 1) c_~N~0) (not (< v_main_~i~0_322 c_~N~0))))) is different from false [2022-01-31 01:29:07,058 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_main_~i~0_312 Int)) (and (<= c_~N~0 (+ v_main_~i~0_312 1)) (<= 3 v_main_~i~0_312) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_312))) 1) (< v_main_~i~0_312 c_~N~0))) (forall ((v_main_~i~0_322 Int) (main_~i~0 Int) (v_ArrVal_1070 Int)) (or (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_1070) (+ c_main_~a~0.offset (* 4 v_main_~i~0_322))) 1) (< (+ v_main_~i~0_322 1) c_~N~0) (not (< v_main_~i~0_322 c_~N~0)) (not (<= (+ main_~i~0 1) v_main_~i~0_322))))) is different from false [2022-01-31 01:29:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:29:13,405 INFO L93 Difference]: Finished difference Result 209 states and 247 transitions. [2022-01-31 01:29:13,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 01:29:13,406 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-01-31 01:29:13,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:29:13,407 INFO L225 Difference]: With dead ends: 209 [2022-01-31 01:29:13,407 INFO L226 Difference]: Without dead ends: 166 [2022-01-31 01:29:13,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 51.8s TimeCoverageRelationStatistics Valid=363, Invalid=1132, Unknown=27, NotChecked=830, Total=2352 [2022-01-31 01:29:13,408 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 37 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:29:13,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 231 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 236 Unchecked, 0.1s Time] [2022-01-31 01:29:13,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-01-31 01:29:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2022-01-31 01:29:13,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 150 states have (on average 1.1866666666666668) internal successors, (178), 150 states have internal predecessors, (178), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:29:13,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 184 transitions. [2022-01-31 01:29:13,431 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 184 transitions. Word has length 55 [2022-01-31 01:29:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:29:13,431 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 184 transitions. [2022-01-31 01:29:13,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:29:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 184 transitions. [2022-01-31 01:29:13,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 01:29:13,433 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:29:13,434 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:29:13,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-01-31 01:29:13,640 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 01:29:13,641 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:29:13,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:29:13,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1258309819, now seen corresponding path program 11 times [2022-01-31 01:29:13,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:29:13,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059737047] [2022-01-31 01:29:13,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:29:13,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:29:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:13,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:29:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:13,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:29:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 01:29:13,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:29:13,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059737047] [2022-01-31 01:29:13,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059737047] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:29:13,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387200084] [2022-01-31 01:29:13,830 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:29:13,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:29:13,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:29:13,831 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 01:29:13,832 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 01:29:14,003 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-01-31 01:29:14,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:29:14,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 01:29:14,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:29:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 01:29:14,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:29:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 01:29:14,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387200084] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:29:14,323 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:29:14,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 01:29:14,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732395729] [2022-01-31 01:29:14,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:29:14,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 01:29:14,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:29:14,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 01:29:14,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 01:29:14,324 INFO L87 Difference]: Start difference. First operand 157 states and 184 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:29:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:29:14,897 INFO L93 Difference]: Finished difference Result 188 states and 221 transitions. [2022-01-31 01:29:14,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 01:29:14,897 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 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 57 [2022-01-31 01:29:14,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:29:14,898 INFO L225 Difference]: With dead ends: 188 [2022-01-31 01:29:14,898 INFO L226 Difference]: Without dead ends: 167 [2022-01-31 01:29:14,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2022-01-31 01:29:14,899 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 115 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 01:29:14,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 68 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 01:29:14,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-01-31 01:29:14,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 136. [2022-01-31 01:29:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 129 states have internal predecessors, (155), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:29:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 161 transitions. [2022-01-31 01:29:14,926 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 161 transitions. Word has length 57 [2022-01-31 01:29:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:29:14,926 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 161 transitions. [2022-01-31 01:29:14,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:29:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 161 transitions. [2022-01-31 01:29:14,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 01:29:14,927 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:29:14,927 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:29:14,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-01-31 01:29:15,144 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 01:29:15,145 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:29:15,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:29:15,145 INFO L85 PathProgramCache]: Analyzing trace with hash -974182882, now seen corresponding path program 12 times [2022-01-31 01:29:15,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:29:15,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442233483] [2022-01-31 01:29:15,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:29:15,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:29:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:15,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:29:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:15,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:29:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 01:29:15,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:29:15,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442233483] [2022-01-31 01:29:15,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442233483] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:29:15,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115955545] [2022-01-31 01:29:15,273 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:29:15,274 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:29:15,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:29:15,275 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 01:29:15,277 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 01:29:15,414 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-01-31 01:29:15,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:29:15,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 01:29:15,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:29:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 01:29:15,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:29:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-31 01:29:15,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115955545] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:29:15,728 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 01:29:15,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-01-31 01:29:15,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563904171] [2022-01-31 01:29:15,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 01:29:15,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 01:29:15,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:29:15,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 01:29:15,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-01-31 01:29:15,729 INFO L87 Difference]: Start difference. First operand 136 states and 161 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:29:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:29:16,044 INFO L93 Difference]: Finished difference Result 175 states and 205 transitions. [2022-01-31 01:29:16,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:29:16,044 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 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 58 [2022-01-31 01:29:16,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:29:16,059 INFO L225 Difference]: With dead ends: 175 [2022-01-31 01:29:16,059 INFO L226 Difference]: Without dead ends: 89 [2022-01-31 01:29:16,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-01-31 01:29:16,060 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 125 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:29:16,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 62 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 01:29:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-31 01:29:16,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2022-01-31 01:29:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 77 states have internal predecessors, (90), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:29:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2022-01-31 01:29:16,073 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 58 [2022-01-31 01:29:16,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:29:16,073 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2022-01-31 01:29:16,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:29:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2022-01-31 01:29:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 01:29:16,074 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:29:16,074 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:29:16,091 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 01:29:16,291 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 01:29:16,291 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:29:16,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:29:16,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1530161726, now seen corresponding path program 13 times [2022-01-31 01:29:16,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:29:16,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106700667] [2022-01-31 01:29:16,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:29:16,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:29:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:17,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:29:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:17,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:29:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-31 01:29:17,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:29:17,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106700667] [2022-01-31 01:29:17,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106700667] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:29:17,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199071622] [2022-01-31 01:29:17,180 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:29:17,180 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:29:17,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:29:17,192 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 01:29:17,232 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 01:29:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:29:17,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-31 01:29:17,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:29:17,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 01:29:17,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:29:17,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:29:17,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:29:17,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:29:17,433 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:29:17,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:29:17,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:29:17,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:29:17,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:29:17,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:29:17,671 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-31 01:29:17,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-31 01:29:17,911 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:29:17,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 45 [2022-01-31 01:29:18,105 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 01:29:18,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 57 [2022-01-31 01:29:18,310 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-01-31 01:29:18,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 60 [2022-01-31 01:29:18,494 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:29:18,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-01-31 01:29:18,626 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-31 01:29:18,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 17 [2022-01-31 01:29:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-31 01:29:18,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:31:13,611 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1291 (Array Int Int)) (v_main_~i~0_397 Int) (main_~i~0 Int) (v_main_~i~0_395 Int) (v_main_~i~0_393 Int) (main_~a~0.offset Int) (v_main_~i~0_391 Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1291))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse9 |c_main_~#sum~0.offset|)) (.cse3 (select v_ArrVal_1291 (+ main_~a~0.offset (* main_~i~0 4))))) (let ((.cse7 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse6 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_397))))) (let ((.cse2 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse6 .cse7 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_395))))) (let ((.cse1 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse6 .cse7 .cse3 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_393))))) (let ((.cse0 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse6 .cse7 .cse3 .cse2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_391))))) (or (not (= .cse0 3)) (not (= 3 .cse1)) (not (= 3 .cse2)) (not (= 3 .cse3)) (let ((.cse5 (* c_~N~0 3)) (.cse4 (+ .cse0 .cse6 .cse7 .cse3 .cse2 .cse1))) (and (<= .cse4 .cse5) (<= .cse5 .cse4))) (not (= 3 .cse7))))))))))) is different from false