./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/mods.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/mods.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:15:41,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:15:41,157 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:15:41,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:15:41,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:15:41,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:15:41,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:15:41,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:15:41,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:15:41,198 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:15:41,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:15:41,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:15:41,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:15:41,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:15:41,200 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:15:41,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:15:41,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:15:41,201 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:15:41,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:15:41,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:15:41,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:15:41,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:15:41,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:15:41,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:15:41,206 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:15:41,206 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:15:41,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:15:41,207 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:15:41,207 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:15:41,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:15:41,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:15:41,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:15:41,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:15:41,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:15:41,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:15:41,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:15:41,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:15:41,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:15:41,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:15:41,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:15:41,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:15:41,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:15:41,210 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba [2024-11-08 10:15:41,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:15:41,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:15:41,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:15:41,462 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:15:41,462 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:15:41,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/mods.c [2024-11-08 10:15:42,941 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:15:43,110 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:15:43,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c [2024-11-08 10:15:43,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/074964d4b/605ab159b1904457a87d2d4731b0964c/FLAG700e8850c [2024-11-08 10:15:43,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/074964d4b/605ab159b1904457a87d2d4731b0964c [2024-11-08 10:15:43,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:15:43,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:15:43,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:15:43,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:15:43,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:15:43,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:15:43" (1/1) ... [2024-11-08 10:15:43,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fce138f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:15:43, skipping insertion in model container [2024-11-08 10:15:43,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:15:43" (1/1) ... [2024-11-08 10:15:43,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:15:43,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c[587,600] [2024-11-08 10:15:43,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:15:43,424 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:15:43,436 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c[587,600] [2024-11-08 10:15:43,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:15:43,503 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:15:43,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:15:43 WrapperNode [2024-11-08 10:15:43,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:15:43,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:15:43,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:15:43,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:15:43,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:15:43" (1/1) ... [2024-11-08 10:15:43,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:15:43" (1/1) ... [2024-11-08 10:15:43,551 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2024-11-08 10:15:43,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:15:43,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:15:43,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:15:43,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:15:43,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:15:43" (1/1) ... [2024-11-08 10:15:43,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:15:43" (1/1) ... [2024-11-08 10:15:43,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:15:43" (1/1) ... [2024-11-08 10:15:43,583 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 7, 7, 5]. 33 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 5 writes are split as follows [0, 0, 3, 2]. [2024-11-08 10:15:43,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:15:43" (1/1) ... [2024-11-08 10:15:43,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:15:43" (1/1) ... [2024-11-08 10:15:43,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:15:43" (1/1) ... [2024-11-08 10:15:43,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:15:43" (1/1) ... [2024-11-08 10:15:43,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:15:43" (1/1) ... [2024-11-08 10:15:43,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:15:43" (1/1) ... [2024-11-08 10:15:43,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:15:43,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:15:43,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:15:43,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:15:43,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:15:43" (1/1) ... [2024-11-08 10:15:43,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:15:43,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:15:43,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:15:43,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:15:43,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:15:43,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:15:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 10:15:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 10:15:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 10:15:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 10:15:43,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 10:15:43,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 10:15:43,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 10:15:43,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 10:15:43,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 10:15:43,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:15:43,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:15:43,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 10:15:43,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 10:15:43,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 10:15:43,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 10:15:43,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 10:15:43,760 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:15:43,763 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:15:43,938 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-08 10:15:43,938 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:15:43,951 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:15:43,952 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-08 10:15:43,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:15:43 BoogieIcfgContainer [2024-11-08 10:15:43,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:15:43,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:15:43,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:15:43,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:15:43,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:15:43" (1/3) ... [2024-11-08 10:15:43,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b80c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:15:43, skipping insertion in model container [2024-11-08 10:15:43,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:15:43" (2/3) ... [2024-11-08 10:15:43,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b80c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:15:43, skipping insertion in model container [2024-11-08 10:15:43,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:15:43" (3/3) ... [2024-11-08 10:15:43,960 INFO L112 eAbstractionObserver]: Analyzing ICFG mods.c [2024-11-08 10:15:43,977 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:15:43,978 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:15:44,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:15:44,036 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@38c55a07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:15:44,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:15:44,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:44,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 10:15:44,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:15:44,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:15:44,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:15:44,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:15:44,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2024-11-08 10:15:44,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:15:44,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221558174] [2024-11-08 10:15:44,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:15:44,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:15:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:15:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:15:44,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:15:44,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221558174] [2024-11-08 10:15:44,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221558174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:15:44,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:15:44,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:15:44,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100604408] [2024-11-08 10:15:44,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:15:44,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 10:15:44,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:15:44,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 10:15:44,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 10:15:44,300 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:15:44,315 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2024-11-08 10:15:44,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 10:15:44,317 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-08 10:15:44,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:15:44,323 INFO L225 Difference]: With dead ends: 50 [2024-11-08 10:15:44,323 INFO L226 Difference]: Without dead ends: 23 [2024-11-08 10:15:44,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 10:15:44,331 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:15:44,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:15:44,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-08 10:15:44,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-08 10:15:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-08 10:15:44,361 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2024-11-08 10:15:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:15:44,362 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-08 10:15:44,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-08 10:15:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 10:15:44,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:15:44,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:15:44,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:15:44,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:15:44,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:15:44,366 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2024-11-08 10:15:44,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:15:44,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830995292] [2024-11-08 10:15:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:15:44,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:15:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:15:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:15:44,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:15:44,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830995292] [2024-11-08 10:15:44,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830995292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:15:44,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:15:44,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:15:44,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642424665] [2024-11-08 10:15:44,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:15:44,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:15:44,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:15:44,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:15:44,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:15:44,581 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:44,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:15:44,654 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2024-11-08 10:15:44,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:15:44,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-08 10:15:44,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:15:44,656 INFO L225 Difference]: With dead ends: 53 [2024-11-08 10:15:44,656 INFO L226 Difference]: Without dead ends: 37 [2024-11-08 10:15:44,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:15:44,658 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:15:44,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 17 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:15:44,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-08 10:15:44,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2024-11-08 10:15:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-08 10:15:44,665 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2024-11-08 10:15:44,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:15:44,665 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-08 10:15:44,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:44,666 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-08 10:15:44,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 10:15:44,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:15:44,667 INFO L215 NwaCegarLoop]: 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] [2024-11-08 10:15:44,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:15:44,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:15:44,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:15:44,668 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2024-11-08 10:15:44,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:15:44,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162607736] [2024-11-08 10:15:44,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:15:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:15:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 10:15:44,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [480168401] [2024-11-08 10:15:44,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:15:44,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:15:44,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:15:44,802 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) [2024-11-08 10:15:44,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 10:15:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:15:44,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 10:15:44,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:15:44,957 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 10:15:44,991 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 10:15:45,092 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 11 [2024-11-08 10:15:45,203 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 11 [2024-11-08 10:15:45,332 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 11 [2024-11-08 10:15:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:15:45,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:15:45,833 INFO L378 Elim1Store]: Elim1 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 42 treesize of output 38 [2024-11-08 10:15:45,837 INFO L378 Elim1Store]: Elim1 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 51 treesize of output 47 [2024-11-08 10:15:45,864 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse0 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (and (forall ((v_arrayElimCell_5 Int)) (= (mod (+ .cse0 (* 2 v_arrayElimCell_5)) (+ .cse0 v_arrayElimCell_5 1)) 0)) (not .cse1)) (and .cse1 (= (let ((.cse2 (+ .cse0 2))) (mod .cse2 .cse2)) 0)))) is different from false [2024-11-08 10:15:45,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-08 10:15:45,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:15:45,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162607736] [2024-11-08 10:15:45,870 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 10:15:45,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480168401] [2024-11-08 10:15:45,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480168401] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:15:45,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:15:45,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2024-11-08 10:15:45,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117085121] [2024-11-08 10:15:45,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:15:45,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 10:15:45,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:15:45,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 10:15:45,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=350, Unknown=1, NotChecked=38, Total=462 [2024-11-08 10:15:45,880 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:15:46,549 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2024-11-08 10:15:46,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 10:15:46,551 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-08 10:15:46,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:15:46,552 INFO L225 Difference]: With dead ends: 63 [2024-11-08 10:15:46,552 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 10:15:46,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=583, Unknown=1, NotChecked=50, Total=756 [2024-11-08 10:15:46,555 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:15:46,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 176 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 252 Invalid, 0 Unknown, 60 Unchecked, 0.5s Time] [2024-11-08 10:15:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 10:15:46,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2024-11-08 10:15:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:46,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-11-08 10:15:46,571 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 24 [2024-11-08 10:15:46,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:15:46,571 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-08 10:15:46,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:46,572 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2024-11-08 10:15:46,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 10:15:46,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:15:46,573 INFO L215 NwaCegarLoop]: 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] [2024-11-08 10:15:46,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 10:15:46,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:15:46,778 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:15:46,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:15:46,779 INFO L85 PathProgramCache]: Analyzing trace with hash 775449632, now seen corresponding path program 2 times [2024-11-08 10:15:46,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:15:46,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125219451] [2024-11-08 10:15:46,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:15:46,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:15:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:15:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 10:15:46,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:15:46,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125219451] [2024-11-08 10:15:46,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125219451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:15:46,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111072330] [2024-11-08 10:15:46,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 10:15:46,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:15:46,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:15:46,980 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) [2024-11-08 10:15:46,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 10:15:47,052 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 10:15:47,052 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:15:47,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 10:15:47,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:15:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 10:15:47,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:15:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 10:15:47,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111072330] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:15:47,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:15:47,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-08 10:15:47,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138135587] [2024-11-08 10:15:47,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:15:47,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 10:15:47,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:15:47,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 10:15:47,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-08 10:15:47,179 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:47,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:15:47,456 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2024-11-08 10:15:47,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 10:15:47,457 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-08 10:15:47,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:15:47,457 INFO L225 Difference]: With dead ends: 99 [2024-11-08 10:15:47,457 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 10:15:47,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-11-08 10:15:47,459 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 153 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:15:47,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 88 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:15:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 10:15:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2024-11-08 10:15:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-08 10:15:47,472 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2024-11-08 10:15:47,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:15:47,472 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-08 10:15:47,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-08 10:15:47,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 10:15:47,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:15:47,474 INFO L215 NwaCegarLoop]: 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] [2024-11-08 10:15:47,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 10:15:47,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 10:15:47,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:15:47,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:15:47,675 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 3 times [2024-11-08 10:15:47,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:15:47,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73561444] [2024-11-08 10:15:47,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:15:47,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:15:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 10:15:47,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [346461004] [2024-11-08 10:15:47,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 10:15:47,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:15:47,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:15:47,723 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) [2024-11-08 10:15:47,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 10:15:47,807 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-08 10:15:47,808 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:15:47,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-08 10:15:47,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:15:47,849 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 10:15:47,872 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 10:15:47,942 INFO L378 Elim1Store]: Elim1 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 18 [2024-11-08 10:15:48,022 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 11 [2024-11-08 10:15:48,098 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 11 [2024-11-08 10:15:48,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:15:48,203 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 26 treesize of output 21 [2024-11-08 10:15:48,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:15:48,287 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 26 treesize of output 21 [2024-11-08 10:15:48,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:15:48,401 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 26 treesize of output 21 [2024-11-08 10:15:48,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:15:48,481 INFO L378 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 26 treesize of output 21 [2024-11-08 10:15:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:15:48,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:15:50,053 INFO L378 Elim1Store]: Elim1 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 102 treesize of output 94 [2024-11-08 10:15:50,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:15:50,059 INFO L378 Elim1Store]: Elim1 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 501 treesize of output 453 [2024-11-08 10:15:50,202 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse2 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (and .cse0 (= (let ((.cse1 (+ .cse2 3))) (mod .cse1 .cse1)) 0)) (let ((.cse10 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse5 (forall ((v_arrayElimCell_18 Int)) (= (let ((.cse12 (+ .cse2 2 v_arrayElimCell_18))) (mod .cse12 .cse12)) 0))) (.cse6 (forall ((v_arrayElimCell_19 Int)) (= (mod (+ .cse2 (* 2 v_arrayElimCell_19) 1) (+ .cse2 2 v_arrayElimCell_19)) 0))) (.cse7 (not .cse10)) (.cse8 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0))) (and (forall ((v_arrayElimCell_18 Int)) (or (forall ((v_arrayElimCell_19 Int)) (let ((.cse3 (* 2 v_arrayElimCell_19))) (or (= (mod (+ .cse2 .cse3 1) (+ .cse2 2 v_arrayElimCell_19)) 0) (= (mod (+ .cse2 .cse3 v_arrayElimCell_18) (+ .cse2 v_arrayElimCell_19 v_arrayElimCell_18 1)) 0)))) (= (let ((.cse4 (+ .cse2 2 v_arrayElimCell_18))) (mod .cse4 .cse4)) 0))) (or .cse5 .cse6 .cse7) (or .cse5 (not .cse8)) (not .cse0) (or (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_19 Int)) (or (= (mod (+ .cse2 (* 2 v_arrayElimCell_19) v_arrayElimCell_18) (+ .cse2 v_arrayElimCell_19 v_arrayElimCell_18 1)) 0) (= (let ((.cse9 (+ .cse2 2 v_arrayElimCell_18))) (mod .cse9 .cse9)) 0))) .cse10) (or (and (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_19 Int)) (let ((.cse11 (* 2 v_arrayElimCell_19))) (or (= (mod (+ .cse2 .cse11 1) (+ .cse2 2 v_arrayElimCell_19)) 0) (= (mod (+ .cse2 .cse11 v_arrayElimCell_18) (+ .cse2 v_arrayElimCell_19 v_arrayElimCell_18 1)) 0)))) (or .cse6 .cse7) (or (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_19 Int)) (= (mod (+ .cse2 (* 2 v_arrayElimCell_19) v_arrayElimCell_18) (+ .cse2 v_arrayElimCell_19 v_arrayElimCell_18 1)) 0)) .cse10)) .cse8)))))) is different from false [2024-11-08 10:15:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-08 10:15:50,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:15:50,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73561444] [2024-11-08 10:15:50,233 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 10:15:50,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346461004] [2024-11-08 10:15:50,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346461004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:15:50,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:15:50,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 39 [2024-11-08 10:15:50,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923112498] [2024-11-08 10:15:50,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:15:50,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-08 10:15:50,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:15:50,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-08 10:15:50,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1221, Unknown=1, NotChecked=72, Total=1482 [2024-11-08 10:15:50,236 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 39 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:15:52,214 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2024-11-08 10:15:52,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-08 10:15:52,217 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 39 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-08 10:15:52,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:15:52,218 INFO L225 Difference]: With dead ends: 102 [2024-11-08 10:15:52,218 INFO L226 Difference]: Without dead ends: 100 [2024-11-08 10:15:52,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=396, Invalid=2577, Unknown=1, NotChecked=106, Total=3080 [2024-11-08 10:15:52,219 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 141 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:15:52,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 281 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 710 Invalid, 0 Unknown, 97 Unchecked, 0.8s Time] [2024-11-08 10:15:52,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-08 10:15:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 65. [2024-11-08 10:15:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.15625) internal successors, (74), 64 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2024-11-08 10:15:52,241 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 32 [2024-11-08 10:15:52,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:15:52,241 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2024-11-08 10:15:52,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 39 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2024-11-08 10:15:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 10:15:52,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:15:52,242 INFO L215 NwaCegarLoop]: 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] [2024-11-08 10:15:52,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 10:15:52,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:15:52,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:15:52,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:15:52,444 INFO L85 PathProgramCache]: Analyzing trace with hash 332676504, now seen corresponding path program 4 times [2024-11-08 10:15:52,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:15:52,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995804271] [2024-11-08 10:15:52,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:15:52,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:15:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:15:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 10:15:52,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:15:52,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995804271] [2024-11-08 10:15:52,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995804271] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:15:52,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651963919] [2024-11-08 10:15:52,615 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 10:15:52,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:15:52,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:15:52,617 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) [2024-11-08 10:15:52,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 10:15:52,685 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 10:15:52,685 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:15:52,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 10:15:52,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:15:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 10:15:52,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:15:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 10:15:52,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651963919] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:15:52,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:15:52,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-11-08 10:15:52,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861396855] [2024-11-08 10:15:52,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:15:52,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 10:15:52,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:15:52,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 10:15:52,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-08 10:15:52,879 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:15:53,260 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2024-11-08 10:15:53,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 10:15:53,261 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-08 10:15:53,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:15:53,262 INFO L225 Difference]: With dead ends: 142 [2024-11-08 10:15:53,262 INFO L226 Difference]: Without dead ends: 65 [2024-11-08 10:15:53,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=803, Unknown=0, NotChecked=0, Total=992 [2024-11-08 10:15:53,264 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 264 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:15:53,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 131 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:15:53,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-08 10:15:53,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2024-11-08 10:15:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-11-08 10:15:53,270 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 34 [2024-11-08 10:15:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:15:53,270 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-11-08 10:15:53,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:15:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-11-08 10:15:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 10:15:53,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:15:53,272 INFO L215 NwaCegarLoop]: 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] [2024-11-08 10:15:53,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 10:15:53,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:15:53,472 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:15:53,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:15:53,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221586, now seen corresponding path program 5 times [2024-11-08 10:15:53,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:15:53,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43037741] [2024-11-08 10:15:53,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:15:53,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:15:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 10:15:53,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819949923] [2024-11-08 10:15:53,563 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 10:15:53,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:15:53,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:15:53,566 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) [2024-11-08 10:15:53,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 10:15:53,859 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-08 10:15:53,859 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:15:53,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-08 10:15:53,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:15:53,875 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 10:15:53,890 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 10:15:53,926 INFO L378 Elim1Store]: Elim1 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 18 [2024-11-08 10:15:53,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:15:53,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 10:15:54,061 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 11 [2024-11-08 10:15:54,125 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 11 [2024-11-08 10:15:54,195 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 11 [2024-11-08 10:15:54,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:15:54,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-11-08 10:15:54,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:15:54,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-11-08 10:15:54,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:15:54,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-11-08 10:15:54,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:15:54,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-11-08 10:15:54,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:15:54,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-11-08 10:15:54,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:15:54,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-11-08 10:15:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:15:54,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:15:57,175 INFO L378 Elim1Store]: Elim1 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 194 treesize of output 182 [2024-11-08 10:15:57,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:15:57,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16653 treesize of output 15373 [2024-11-08 10:15:58,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 0))) (or (let ((.cse6 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (= 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse7 (forall ((v_arrayElimCell_47 Int)) (= (mod (+ .cse3 2 (* 2 v_arrayElimCell_47)) (+ .cse3 3 v_arrayElimCell_47)) 0))) (.cse17 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0)) (.cse1 (= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 0)) (.cse25 (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_45 Int)) (= (mod (+ .cse3 (* 2 v_arrayElimCell_47) v_arrayElimCell_45 1) (+ .cse3 2 v_arrayElimCell_47 v_arrayElimCell_45)) 0))) (.cse26 (not .cse0)) (.cse8 (forall ((v_arrayElimCell_46 Int)) (= (let ((.cse39 (+ .cse3 3 v_arrayElimCell_46))) (mod .cse39 .cse39)) 0))) (.cse24 (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_45 Int)) (let ((.cse38 (* 2 v_arrayElimCell_47))) (or (= (mod (+ .cse3 .cse38 v_arrayElimCell_45 1) (+ .cse3 2 v_arrayElimCell_47 v_arrayElimCell_45)) 0) (= (mod (+ .cse3 2 .cse38) (+ .cse3 3 v_arrayElimCell_47)) 0))))) (.cse9 (not .cse6))) (and (or .cse0 (and (or (and (or .cse1 (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (or (= (let ((.cse2 (+ .cse3 3 v_arrayElimCell_46))) (mod .cse2 .cse2)) 0) (= (mod (+ .cse3 (* 2 v_arrayElimCell_47) v_arrayElimCell_46 v_arrayElimCell_45) (+ .cse3 v_arrayElimCell_47 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))) (forall ((v_arrayElimCell_46 Int)) (or (= (let ((.cse4 (+ .cse3 3 v_arrayElimCell_46))) (mod .cse4 .cse4)) 0) (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_45 Int)) (or (= (let ((.cse5 (+ .cse3 2 v_arrayElimCell_46 v_arrayElimCell_45))) (mod .cse5 .cse5)) 0) (= (mod (+ .cse3 (* 2 v_arrayElimCell_47) v_arrayElimCell_46 v_arrayElimCell_45) (+ .cse3 v_arrayElimCell_47 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))))) .cse6) (or .cse7 .cse8 .cse9) (or (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse10 (* 2 v_arrayElimCell_47))) (or (= (mod (+ .cse3 2 .cse10) (+ .cse3 3 v_arrayElimCell_47)) 0) (= (let ((.cse11 (+ .cse3 3 v_arrayElimCell_46))) (mod .cse11 .cse11)) 0) (= (mod (+ .cse3 .cse10 v_arrayElimCell_46 v_arrayElimCell_45) (+ .cse3 v_arrayElimCell_47 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))) .cse1))) (or (and (or .cse1 (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse12 (* 2 v_arrayElimCell_47))) (or (= (mod (+ .cse3 .cse12 v_arrayElimCell_45 1) (+ .cse3 2 v_arrayElimCell_47 v_arrayElimCell_45)) 0) (= (let ((.cse13 (+ .cse3 3 v_arrayElimCell_46))) (mod .cse13 .cse13)) 0) (= (mod (+ .cse3 .cse12 v_arrayElimCell_46 v_arrayElimCell_45) (+ .cse3 v_arrayElimCell_47 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0))))) (forall ((v_arrayElimCell_46 Int)) (or (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_45 Int)) (let ((.cse14 (* 2 v_arrayElimCell_47))) (or (= (mod (+ .cse3 .cse14 v_arrayElimCell_45 1) (+ .cse3 2 v_arrayElimCell_47 v_arrayElimCell_45)) 0) (= (let ((.cse15 (+ .cse3 2 v_arrayElimCell_46 v_arrayElimCell_45))) (mod .cse15 .cse15)) 0) (= (mod (+ .cse3 .cse14 v_arrayElimCell_46 v_arrayElimCell_45) (+ .cse3 v_arrayElimCell_47 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))) (= (let ((.cse16 (+ .cse3 3 v_arrayElimCell_46))) (mod .cse16 .cse16)) 0)))) .cse6) (or (not .cse17) .cse8) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (= (let ((.cse18 (+ .cse3 2 v_arrayElimCell_46 v_arrayElimCell_45))) (mod .cse18 .cse18)) 0)) (not .cse1)) (not .cse19) (or (and (or (and (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int)) (let ((.cse20 (* 2 v_arrayElimCell_47))) (or (= (mod (+ .cse3 2 .cse20) (+ .cse3 3 v_arrayElimCell_47)) 0) (forall ((v_arrayElimCell_45 Int)) (or (= (let ((.cse21 (+ .cse3 2 v_arrayElimCell_46 v_arrayElimCell_45))) (mod .cse21 .cse21)) 0) (= (mod (+ .cse3 .cse20 v_arrayElimCell_46 v_arrayElimCell_45) (+ .cse3 v_arrayElimCell_47 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))))) (or .cse1 (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse22 (* 2 v_arrayElimCell_47))) (or (= (mod (+ .cse3 2 .cse22) (+ .cse3 3 v_arrayElimCell_47)) 0) (= (mod (+ .cse3 .cse22 v_arrayElimCell_46 v_arrayElimCell_45) (+ .cse3 v_arrayElimCell_47 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0))))) (or (and (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (or (= (let ((.cse23 (+ .cse3 2 v_arrayElimCell_46 v_arrayElimCell_45))) (mod .cse23 .cse23)) 0) (= (mod (+ .cse3 (* 2 v_arrayElimCell_47) v_arrayElimCell_46 v_arrayElimCell_45) (+ .cse3 v_arrayElimCell_47 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0))) (or .cse1 (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (= (mod (+ .cse3 (* 2 v_arrayElimCell_47) v_arrayElimCell_46 v_arrayElimCell_45) (+ .cse3 v_arrayElimCell_47 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))) .cse6) (or .cse7 .cse9)) .cse0) (or .cse24 .cse9) (or .cse25 .cse26) (or .cse1 (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse27 (* 2 v_arrayElimCell_47))) (or (= (mod (+ .cse3 .cse27 v_arrayElimCell_45 1) (+ .cse3 2 v_arrayElimCell_47 v_arrayElimCell_45)) 0) (= (mod (+ .cse3 2 .cse27) (+ .cse3 3 v_arrayElimCell_47)) 0) (= (mod (+ .cse3 .cse27 v_arrayElimCell_46 v_arrayElimCell_45) (+ .cse3 v_arrayElimCell_47 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0))))) (or (and (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse28 (* 2 v_arrayElimCell_47))) (or (= (mod (+ .cse3 .cse28 v_arrayElimCell_45 1) (+ .cse3 2 v_arrayElimCell_47 v_arrayElimCell_45)) 0) (= (let ((.cse29 (+ .cse3 2 v_arrayElimCell_46 v_arrayElimCell_45))) (mod .cse29 .cse29)) 0) (= (mod (+ .cse3 .cse28 v_arrayElimCell_46 v_arrayElimCell_45) (+ .cse3 v_arrayElimCell_47 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))) (or .cse1 (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse30 (* 2 v_arrayElimCell_47))) (or (= (mod (+ .cse3 .cse30 v_arrayElimCell_45 1) (+ .cse3 2 v_arrayElimCell_47 v_arrayElimCell_45)) 0) (= (mod (+ .cse3 .cse30 v_arrayElimCell_46 v_arrayElimCell_45) (+ .cse3 v_arrayElimCell_47 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))))) .cse6) (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int)) (let ((.cse31 (* 2 v_arrayElimCell_47))) (or (= (mod (+ .cse3 2 .cse31) (+ .cse3 3 v_arrayElimCell_47)) 0) (forall ((v_arrayElimCell_45 Int)) (or (= (mod (+ .cse3 .cse31 v_arrayElimCell_45 1) (+ .cse3 2 v_arrayElimCell_47 v_arrayElimCell_45)) 0) (= (let ((.cse32 (+ .cse3 2 v_arrayElimCell_46 v_arrayElimCell_45))) (mod .cse32 .cse32)) 0) (= (mod (+ .cse3 .cse31 v_arrayElimCell_46 v_arrayElimCell_45) (+ .cse3 v_arrayElimCell_47 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0))))))) .cse17) (forall ((v_arrayElimCell_46 Int)) (or (forall ((v_arrayElimCell_47 Int)) (let ((.cse33 (* 2 v_arrayElimCell_47))) (or (= (mod (+ .cse3 2 .cse33) (+ .cse3 3 v_arrayElimCell_47)) 0) (forall ((v_arrayElimCell_45 Int)) (or (= (let ((.cse34 (+ .cse3 2 v_arrayElimCell_46 v_arrayElimCell_45))) (mod .cse34 .cse34)) 0) (= (mod (+ .cse3 .cse33 v_arrayElimCell_46 v_arrayElimCell_45) (+ .cse3 v_arrayElimCell_47 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))))) (= (let ((.cse35 (+ .cse3 3 v_arrayElimCell_46))) (mod .cse35 .cse35)) 0))) (or .cse1 (forall ((v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse36 (* 2 v_arrayElimCell_47))) (or (= (mod (+ .cse3 .cse36 v_arrayElimCell_45 1) (+ .cse3 2 v_arrayElimCell_47 v_arrayElimCell_45)) 0) (= (mod (+ .cse3 2 .cse36) (+ .cse3 3 v_arrayElimCell_47)) 0) (= (let ((.cse37 (+ .cse3 3 v_arrayElimCell_46))) (mod .cse37 .cse37)) 0) (= (mod (+ .cse3 .cse36 v_arrayElimCell_46 v_arrayElimCell_45) (+ .cse3 v_arrayElimCell_47 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0))))) (or .cse25 .cse8 .cse26) (or .cse8 .cse24 .cse9)))) (and (= (let ((.cse40 (+ .cse3 4))) (mod .cse40 .cse40)) 0) .cse19))) is different from false [2024-11-08 10:15:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-08 10:15:58,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:15:58,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43037741] [2024-11-08 10:15:58,391 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 10:15:58,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819949923] [2024-11-08 10:15:58,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819949923] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:15:58,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:15:58,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 53 [2024-11-08 10:15:58,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138318396] [2024-11-08 10:15:58,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:15:58,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-08 10:15:58,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:15:58,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-08 10:15:58,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2314, Unknown=1, NotChecked=100, Total=2756 [2024-11-08 10:15:58,394 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 53 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:16:01,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:16:01,930 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2024-11-08 10:16:01,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-08 10:16:01,931 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-08 10:16:01,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:16:01,932 INFO L225 Difference]: With dead ends: 131 [2024-11-08 10:16:01,932 INFO L226 Difference]: Without dead ends: 129 [2024-11-08 10:16:01,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=661, Invalid=4454, Unknown=1, NotChecked=140, Total=5256 [2024-11-08 10:16:01,935 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 222 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:16:01,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 398 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1175 Invalid, 0 Unknown, 123 Unchecked, 1.5s Time] [2024-11-08 10:16:01,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-08 10:16:01,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 81. [2024-11-08 10:16:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.1375) internal successors, (91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:16:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2024-11-08 10:16:01,948 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 40 [2024-11-08 10:16:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:16:01,949 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2024-11-08 10:16:01,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:16:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2024-11-08 10:16:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 10:16:01,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:16:01,950 INFO L215 NwaCegarLoop]: 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] [2024-11-08 10:16:01,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 10:16:02,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:16:02,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:16:02,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:16:02,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1012369648, now seen corresponding path program 6 times [2024-11-08 10:16:02,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:16:02,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913436138] [2024-11-08 10:16:02,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:16:02,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:16:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:16:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:16:02,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:16:02,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913436138] [2024-11-08 10:16:02,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913436138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:16:02,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667596465] [2024-11-08 10:16:02,419 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 10:16:02,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:16:02,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:16:02,421 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) [2024-11-08 10:16:02,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 10:16:02,608 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-08 10:16:02,609 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:16:02,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 10:16:02,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:16:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:16:02,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:16:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:16:02,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667596465] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:16:02,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:16:02,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-08 10:16:02,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819391838] [2024-11-08 10:16:02,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:16:02,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 10:16:02,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:16:02,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 10:16:02,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2024-11-08 10:16:02,828 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:16:03,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:16:03,259 INFO L93 Difference]: Finished difference Result 180 states and 199 transitions. [2024-11-08 10:16:03,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 10:16:03,259 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-08 10:16:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:16:03,260 INFO L225 Difference]: With dead ends: 180 [2024-11-08 10:16:03,260 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 10:16:03,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=1426, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 10:16:03,262 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 291 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:16:03,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 231 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:16:03,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 10:16:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 86. [2024-11-08 10:16:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:16:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-11-08 10:16:03,274 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 42 [2024-11-08 10:16:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:16:03,274 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-11-08 10:16:03,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:16:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-11-08 10:16:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 10:16:03,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:16:03,276 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:16:03,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 10:16:03,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:16:03,477 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:16:03,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:16:03,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1258986306, now seen corresponding path program 1 times [2024-11-08 10:16:03,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:16:03,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446907333] [2024-11-08 10:16:03,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:16:03,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:16:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:16:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:16:07,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:16:07,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446907333] [2024-11-08 10:16:07,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446907333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:16:07,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615230620] [2024-11-08 10:16:07,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:16:07,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:16:07,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:16:07,670 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) [2024-11-08 10:16:07,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 10:16:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:16:07,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-08 10:16:07,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:16:07,791 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 10:16:07,799 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 10:16:07,820 INFO L378 Elim1Store]: Elim1 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 18 [2024-11-08 10:16:07,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:16:07,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-08 10:16:07,981 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 11 [2024-11-08 10:16:08,077 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 11 [2024-11-08 10:16:08,182 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 11 [2024-11-08 10:16:08,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:16:08,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-11-08 10:16:08,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:16:08,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-11-08 10:16:08,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:16:08,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-11-08 10:16:08,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:16:08,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-11-08 10:16:08,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:16:08,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-11-08 10:16:09,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:16:09,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-11-08 10:16:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:16:09,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:16:22,567 INFO L378 Elim1Store]: Elim1 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 390 treesize of output 366 [2024-11-08 10:16:22,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 10:16:22,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33818 treesize of output 31258 [2024-11-08 10:16:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:16:23,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615230620] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:16:23,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:16:23,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 31, 32] total 89 [2024-11-08 10:16:23,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745826374] [2024-11-08 10:16:23,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:16:23,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2024-11-08 10:16:23,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:16:23,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2024-11-08 10:16:23,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=6938, Unknown=19, NotChecked=0, Total=7832 [2024-11-08 10:16:23,132 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 89 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)