./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-10 22:22:34,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:22:34,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:22:34,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:22:34,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:22:34,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:22:34,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:22:34,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:22:34,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:22:34,688 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:22:34,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:22:34,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:22:34,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:22:34,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:22:34,689 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:22:34,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:22:34,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:22:34,690 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:22:34,690 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:22:34,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:22:34,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:22:34,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:22:34,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:22:34,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:22:34,692 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:22:34,692 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:22:34,692 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:22:34,692 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:22:34,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:22:34,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:22:34,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:22:34,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:22:34,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:22:34,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:22:34,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:22:34,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:22:34,694 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:22:34,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:22:34,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:22:34,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:22:34,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:22:34,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:22:34,696 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-clean/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-clean/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-10-10 22:22:34,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:22:34,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:22:34,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:22:34,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:22:34,913 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:22:34,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c [2024-10-10 22:22:36,115 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:22:36,270 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:22:36,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c [2024-10-10 22:22:36,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e3fd08c3e/f4bab4c979674b9a979925eaa1d54234/FLAGa7f1cff21 [2024-10-10 22:22:36,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e3fd08c3e/f4bab4c979674b9a979925eaa1d54234 [2024-10-10 22:22:36,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:22:36,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:22:36,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:22:36,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:22:36,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:22:36,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:22:36" (1/1) ... [2024-10-10 22:22:36,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7b1cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:22:36, skipping insertion in model container [2024-10-10 22:22:36,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:22:36" (1/1) ... [2024-10-10 22:22:36,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:22:36,851 WARN L248 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-10-10 22:22:36,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:22:36,878 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:22:36,887 WARN L248 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-10-10 22:22:36,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:22:36,906 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:22:36,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:22:36 WrapperNode [2024-10-10 22:22:36,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:22:36,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:22:36,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:22:36,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:22:36,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:22:36" (1/1) ... [2024-10-10 22:22:36,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:22:36" (1/1) ... [2024-10-10 22:22:36,950 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2024-10-10 22:22:36,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:22:36,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:22:36,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:22:36,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:22:36,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:22:36" (1/1) ... [2024-10-10 22:22:36,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:22:36" (1/1) ... [2024-10-10 22:22:36,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:22:36" (1/1) ... [2024-10-10 22:22:36,973 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, 0, 7, 0]. The 5 writes are split as follows [0, 3, 0, 2]. [2024-10-10 22:22:36,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:22:36" (1/1) ... [2024-10-10 22:22:36,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:22:36" (1/1) ... [2024-10-10 22:22:36,977 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:22:36" (1/1) ... [2024-10-10 22:22:36,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:22:36" (1/1) ... [2024-10-10 22:22:36,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:22:36" (1/1) ... [2024-10-10 22:22:36,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:22:36" (1/1) ... [2024-10-10 22:22:36,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:22:36,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:22:36,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:22:36,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:22:36,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:22:36" (1/1) ... [2024-10-10 22:22:36,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:22:36,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:22:37,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:22:37,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:22:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:22:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:22:37,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 22:22:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-10 22:22:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-10 22:22:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 22:22:37,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 22:22:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 22:22:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-10 22:22:37,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-10 22:22:37,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-10 22:22:37,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:22:37,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:22:37,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 22:22:37,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 22:22:37,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-10 22:22:37,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-10 22:22:37,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 22:22:37,131 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:22:37,133 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:22:37,299 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-10 22:22:37,299 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:22:37,325 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:22:37,325 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-10 22:22:37,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:22:37 BoogieIcfgContainer [2024-10-10 22:22:37,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:22:37,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:22:37,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:22:37,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:22:37,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:22:36" (1/3) ... [2024-10-10 22:22:37,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2698cb6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:22:37, skipping insertion in model container [2024-10-10 22:22:37,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:22:36" (2/3) ... [2024-10-10 22:22:37,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2698cb6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:22:37, skipping insertion in model container [2024-10-10 22:22:37,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:22:37" (3/3) ... [2024-10-10 22:22:37,334 INFO L112 eAbstractionObserver]: Analyzing ICFG mods.c [2024-10-10 22:22:37,347 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:22:37,347 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:22:37,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:22:37,405 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;@66e4747f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:22:37,405 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:22:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 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-10-10 22:22:37,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-10 22:22:37,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:22:37,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:22:37,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:22:37,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:22:37,421 INFO L85 PathProgramCache]: Analyzing trace with hash -270928915, now seen corresponding path program 1 times [2024-10-10 22:22:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:22:37,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492440616] [2024-10-10 22:22:37,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:22:37,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:22:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:22:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:22:37,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:22:37,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492440616] [2024-10-10 22:22:37,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492440616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:22:37,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:22:37,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:22:37,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260914568] [2024-10-10 22:22:37,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:22:37,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:22:37,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:22:37,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:22:37,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:22:37,576 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-10-10 22:22:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:22:37,602 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. [2024-10-10 22:22:37,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:22:37,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2024-10-10 22:22:37,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:22:37,615 INFO L225 Difference]: With dead ends: 37 [2024-10-10 22:22:37,615 INFO L226 Difference]: Without dead ends: 17 [2024-10-10 22:22:37,617 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-10-10 22:22:37,619 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:22:37,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:22:37,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-10 22:22:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-10 22:22:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-10-10 22:22:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-10 22:22:37,644 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 15 [2024-10-10 22:22:37,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:22:37,644 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-10 22:22:37,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-10-10 22:22:37,645 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-10 22:22:37,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-10 22:22:37,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:22:37,645 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:22:37,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:22:37,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:22:37,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:22:37,646 INFO L85 PathProgramCache]: Analyzing trace with hash -863276055, now seen corresponding path program 1 times [2024-10-10 22:22:37,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:22:37,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069637254] [2024-10-10 22:22:37,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:22:37,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:22:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:22:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:22:37,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:22:37,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069637254] [2024-10-10 22:22:37,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069637254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:22:37,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:22:37,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:22:37,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535253742] [2024-10-10 22:22:37,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:22:37,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:22:37,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:22:37,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:22:37,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:22:37,788 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-10-10 22:22:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:22:37,835 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-10-10 22:22:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:22:37,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2024-10-10 22:22:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:22:37,836 INFO L225 Difference]: With dead ends: 38 [2024-10-10 22:22:37,836 INFO L226 Difference]: Without dead ends: 26 [2024-10-10 22:22:37,836 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-10-10 22:22:37,837 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:22:37,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:22:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-10 22:22:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2024-10-10 22:22:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-10-10 22:22:37,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-10-10 22:22:37,842 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2024-10-10 22:22:37,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:22:37,842 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-10 22:22:37,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-10-10 22:22:37,842 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-10-10 22:22:37,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-10 22:22:37,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:22:37,843 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:22:37,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:22:37,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:22:37,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:22:37,843 INFO L85 PathProgramCache]: Analyzing trace with hash 405160390, now seen corresponding path program 1 times [2024-10-10 22:22:37,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:22:37,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672630731] [2024-10-10 22:22:37,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:22:37,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:22:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-10 22:22:37,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1833146670] [2024-10-10 22:22:37,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:22:37,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:22:37,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:22:37,960 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:22:37,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:22:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:22:38,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-10 22:22:38,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:22:38,078 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-10-10 22:22:38,099 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-10-10 22:22:38,168 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-10-10 22:22:38,229 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-10-10 22:22:38,322 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-10-10 22:22:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:22:38,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:22:38,798 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-10-10 22:22:38,807 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-10-10 22:22:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:22:38,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:22:38,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672630731] [2024-10-10 22:22:38,873 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-10 22:22:38,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833146670] [2024-10-10 22:22:38,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833146670] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:22:38,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:22:38,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2024-10-10 22:22:38,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444173536] [2024-10-10 22:22:38,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:22:38,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-10 22:22:38,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:22:38,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-10 22:22:38,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=382, Unknown=3, NotChecked=0, Total=462 [2024-10-10 22:22:38,877 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 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-10-10 22:22:39,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:22:39,346 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-10-10 22:22:39,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-10 22:22:39,347 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 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 19 [2024-10-10 22:22:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:22:39,347 INFO L225 Difference]: With dead ends: 46 [2024-10-10 22:22:39,347 INFO L226 Difference]: Without dead ends: 44 [2024-10-10 22:22:39,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=582, Unknown=3, NotChecked=0, Total=702 [2024-10-10 22:22:39,349 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 57 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:22:39,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 126 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:22:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-10 22:22:39,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2024-10-10 22:22:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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-10-10 22:22:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-10-10 22:22:39,354 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 19 [2024-10-10 22:22:39,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:22:39,354 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-10 22:22:39,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 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-10-10 22:22:39,355 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-10-10 22:22:39,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-10 22:22:39,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:22:39,355 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:22:39,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:22:39,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:22:39,559 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:22:39,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:22:39,560 INFO L85 PathProgramCache]: Analyzing trace with hash 316854210, now seen corresponding path program 2 times [2024-10-10 22:22:39,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:22:39,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492428714] [2024-10-10 22:22:39,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:22:39,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:22:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:22:39,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-10 22:22:39,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:22:39,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492428714] [2024-10-10 22:22:39,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492428714] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:22:39,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176502470] [2024-10-10 22:22:39,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:22:39,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:22:39,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:22:39,699 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:22:39,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:22:39,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:22:39,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:22:39,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:22:39,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:22:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-10 22:22:39,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:22:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-10 22:22:39,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176502470] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:22:39,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:22:39,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-10 22:22:39,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164035846] [2024-10-10 22:22:39,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:22:39,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 22:22:39,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:22:39,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 22:22:39,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:22:39,819 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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-10-10 22:22:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:22:39,908 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2024-10-10 22:22:39,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:22:39,908 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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) Word has length 20 [2024-10-10 22:22:39,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:22:39,909 INFO L225 Difference]: With dead ends: 77 [2024-10-10 22:22:39,909 INFO L226 Difference]: Without dead ends: 43 [2024-10-10 22:22:39,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:22:39,910 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:22:39,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 48 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:22:39,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-10 22:22:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2024-10-10 22:22:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 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-10-10 22:22:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-10 22:22:39,918 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2024-10-10 22:22:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:22:39,918 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-10 22:22:39,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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-10-10 22:22:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-10 22:22:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-10 22:22:39,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:22:39,919 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:22:39,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 22:22:40,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:22:40,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:22:40,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:22:40,120 INFO L85 PathProgramCache]: Analyzing trace with hash -732578568, now seen corresponding path program 3 times [2024-10-10 22:22:40,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:22:40,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390727311] [2024-10-10 22:22:40,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:22:40,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:22:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:22:40,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:22:40,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:22:40,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390727311] [2024-10-10 22:22:40,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390727311] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:22:40,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471152556] [2024-10-10 22:22:40,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 22:22:40,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:22:40,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:22:40,253 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:22:40,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:22:40,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-10 22:22:40,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:22:40,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:22:40,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:22:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:22:40,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:22:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:22:40,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471152556] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:22:40,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:22:40,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-10 22:22:40,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133480830] [2024-10-10 22:22:40,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:22:40,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 22:22:40,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:22:40,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 22:22:40,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:22:40,369 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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-10-10 22:22:40,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:22:40,451 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2024-10-10 22:22:40,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:22:40,452 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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) Word has length 21 [2024-10-10 22:22:40,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:22:40,452 INFO L225 Difference]: With dead ends: 43 [2024-10-10 22:22:40,452 INFO L226 Difference]: Without dead ends: 35 [2024-10-10 22:22:40,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:22:40,453 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 47 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:22:40,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 34 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:22:40,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-10 22:22:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2024-10-10 22:22:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-10-10 22:22:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-10 22:22:40,457 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 21 [2024-10-10 22:22:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:22:40,457 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-10 22:22:40,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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-10-10 22:22:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-10-10 22:22:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 22:22:40,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:22:40,457 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:22:40,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:22:40,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:22:40,662 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:22:40,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:22:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1546241993, now seen corresponding path program 4 times [2024-10-10 22:22:40,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:22:40,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834164459] [2024-10-10 22:22:40,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:22:40,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:22:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-10 22:22:40,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1015055069] [2024-10-10 22:22:40,728 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-10 22:22:40,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:22:40,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:22:40,730 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:22:40,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:22:40,795 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-10 22:22:40,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:22:40,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-10 22:22:40,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:22:40,803 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-10-10 22:22:40,811 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 15 treesize of output 11 [2024-10-10 22:22:40,829 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 25 treesize of output 24 [2024-10-10 22:22:40,915 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 23 treesize of output 15 [2024-10-10 22:22:40,942 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 33 treesize of output 21 [2024-10-10 22:22:41,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:22:41,025 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-10-10 22:22:41,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:22:41,067 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-10-10 22:22:41,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:22:41,132 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-10-10 22:22:41,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:22:41,157 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 30 treesize of output 14 [2024-10-10 22:22:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:22:41,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:22:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:22:42,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:22:42,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834164459] [2024-10-10 22:22:42,056 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-10 22:22:42,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015055069] [2024-10-10 22:22:42,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015055069] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:22:42,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:22:42,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2024-10-10 22:22:42,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845989001] [2024-10-10 22:22:42,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:22:42,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-10 22:22:42,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:22:42,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-10 22:22:42,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=898, Unknown=0, NotChecked=0, Total=1056 [2024-10-10 22:22:42,058 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 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-10-10 22:22:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:22:46,439 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2024-10-10 22:22:46,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-10 22:22:46,439 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 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 23 [2024-10-10 22:22:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:22:46,441 INFO L225 Difference]: With dead ends: 95 [2024-10-10 22:22:46,441 INFO L226 Difference]: Without dead ends: 93 [2024-10-10 22:22:46,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=652, Invalid=3904, Unknown=0, NotChecked=0, Total=4556 [2024-10-10 22:22:46,442 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 154 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:22:46,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 285 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 22:22:46,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-10 22:22:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 39. [2024-10-10 22:22:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:22:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-10-10 22:22:46,454 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 23 [2024-10-10 22:22:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:22:46,454 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-10-10 22:22:46,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 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-10-10 22:22:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-10-10 22:22:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-10 22:22:46,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:22:46,455 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:22:46,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 22:22:46,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-10 22:22:46,655 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:22:46,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:22:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2060537951, now seen corresponding path program 5 times [2024-10-10 22:22:46,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:22:46,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012210715] [2024-10-10 22:22:46,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:22:46,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:22:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:22:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:22:46,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:22:46,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012210715] [2024-10-10 22:22:46,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012210715] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:22:46,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573184449] [2024-10-10 22:22:46,761 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-10 22:22:46,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:22:46,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:22:46,763 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:22:46,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 22:22:46,839 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-10 22:22:46,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:22:46,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-10 22:22:46,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:22:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:22:46,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:22:46,910 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:22:46,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573184449] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:22:46,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:22:46,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-10-10 22:22:46,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934001131] [2024-10-10 22:22:46,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:22:46,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-10 22:22:46,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:22:46,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-10 22:22:46,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:22:46,912 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 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-10-10 22:22:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:22:47,036 INFO L93 Difference]: Finished difference Result 99 states and 117 transitions. [2024-10-10 22:22:47,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:22:47,037 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 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-10-10 22:22:47,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:22:47,037 INFO L225 Difference]: With dead ends: 99 [2024-10-10 22:22:47,037 INFO L226 Difference]: Without dead ends: 73 [2024-10-10 22:22:47,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:22:47,038 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 55 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:22:47,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 52 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:22:47,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-10 22:22:47,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 54. [2024-10-10 22:22:47,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:22:47,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2024-10-10 22:22:47,049 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 24 [2024-10-10 22:22:47,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:22:47,049 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2024-10-10 22:22:47,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 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-10-10 22:22:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-10-10 22:22:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-10 22:22:47,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:22:47,050 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:22:47,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 22:22:47,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:22:47,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:22:47,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:22:47,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1281102295, now seen corresponding path program 6 times [2024-10-10 22:22:47,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:22:47,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827566799] [2024-10-10 22:22:47,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:22:47,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:22:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:22:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:22:47,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:22:47,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827566799] [2024-10-10 22:22:47,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827566799] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:22:47,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072809620] [2024-10-10 22:22:47,360 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-10 22:22:47,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:22:47,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:22:47,361 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:22:47,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 22:22:47,419 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-10-10 22:22:47,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:22:47,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-10 22:22:47,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:22:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:22:47,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:22:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:22:47,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072809620] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:22:47,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:22:47,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-10-10 22:22:47,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633936827] [2024-10-10 22:22:47,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:22:47,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-10 22:22:47,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:22:47,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-10 22:22:47,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:22:47,513 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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-10-10 22:22:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:22:47,659 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2024-10-10 22:22:47,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:22:47,660 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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 25 [2024-10-10 22:22:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:22:47,660 INFO L225 Difference]: With dead ends: 87 [2024-10-10 22:22:47,660 INFO L226 Difference]: Without dead ends: 64 [2024-10-10 22:22:47,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2024-10-10 22:22:47,661 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 51 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:22:47,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 88 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:22:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-10 22:22:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2024-10-10 22:22:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:22:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-10-10 22:22:47,671 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 25 [2024-10-10 22:22:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:22:47,671 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-10-10 22:22:47,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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-10-10 22:22:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-10-10 22:22:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-10 22:22:47,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:22:47,672 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:22:47,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-10 22:22:47,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-10 22:22:47,872 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:22:47,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:22:47,872 INFO L85 PathProgramCache]: Analyzing trace with hash 576105885, now seen corresponding path program 1 times [2024-10-10 22:22:47,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:22:47,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119530105] [2024-10-10 22:22:47,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:22:47,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:22:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:22:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:22:49,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:22:49,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119530105] [2024-10-10 22:22:49,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119530105] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:22:49,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275888528] [2024-10-10 22:22:49,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:22:49,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:22:49,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:22:49,166 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:22:49,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 22:22:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:22:49,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-10 22:22:49,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:22:49,237 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-10-10 22:22:49,273 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-10-10 22:22:49,293 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-10-10 22:22:49,353 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-10-10 22:22:49,382 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-10-10 22:22:49,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:22:49,444 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-10-10 22:22:49,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:22:49,478 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-10-10 22:22:49,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:22:49,547 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-10-10 22:22:49,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:22:49,580 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-10-10 22:22:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:22:49,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:22:50,881 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 206 treesize of output 190 [2024-10-10 22:22:50,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:22:50,888 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 1066 treesize of output 970 [2024-10-10 22:22:51,044 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (= |c_ULTIMATE.start_main_~i~0#1| 0) (let ((.cse3 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0))) (let ((.cse6 (not .cse3))) (and (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_29 Int)) (let ((.cse1 (* 2 v_arrayElimCell_29)) (.cse2 (+ .cse0 v_arrayElimCell_29 v_arrayElimCell_30 1))) (or (= (mod (+ .cse0 .cse1 v_arrayElimCell_30) .cse2) 0) (= (mod (+ .cse0 .cse1 1) (+ .cse0 2 v_arrayElimCell_29)) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_30) v_arrayElimCell_29) .cse2) 0))))) .cse3) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_29 Int)) (let ((.cse4 (* 2 v_arrayElimCell_29)) (.cse5 (+ .cse0 2 v_arrayElimCell_29))) (or (= (mod (+ .cse0 .cse4 v_arrayElimCell_30) (+ .cse0 v_arrayElimCell_29 v_arrayElimCell_30 1)) 0) (= (mod (+ .cse0 .cse4 1) .cse5) 0) (not (= (mod .cse5 .cse5) 0))))) .cse6) (or (forall ((v_arrayElimCell_29 Int)) (let ((.cse7 (+ .cse0 2 v_arrayElimCell_29))) (or (= (mod (+ .cse0 (* 2 v_arrayElimCell_29) 1) .cse7) 0) (not (= (mod .cse7 .cse7) 0))))) .cse6) (or (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_29 Int)) (let ((.cse8 (+ .cse0 v_arrayElimCell_29 v_arrayElimCell_30 1))) (or (= (mod (+ .cse0 (* 2 v_arrayElimCell_29) v_arrayElimCell_30) .cse8) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_30) v_arrayElimCell_29) .cse8) 0))))) .cse3)))) .cse9) (or (forall ((v_arrayElimCell_30 Int)) (let ((.cse10 (+ .cse0 2 v_arrayElimCell_30))) (or (= (mod .cse10 .cse10) 0) (not (= (mod (+ .cse0 (* 2 v_arrayElimCell_30) 1) .cse10) 0))))) (not .cse9)))) is different from false [2024-10-10 22:22:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-10 22:22:51,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275888528] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:22:51,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:22:51,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 19] total 49 [2024-10-10 22:22:51,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252438539] [2024-10-10 22:22:51,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:22:51,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-10 22:22:51,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:22:51,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-10 22:22:51,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=1915, Unknown=1, NotChecked=92, Total=2352 [2024-10-10 22:22:51,052 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 49 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 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-10-10 22:23:24,763 WARN L286 SmtUtils]: Spent 32.02s on a formula simplification. DAG size of input: 117 DAG size of output: 105 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-10 22:23:28,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-10-10 22:23:31,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-10-10 22:23:33,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-10-10 22:23:36,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-10-10 22:23:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:23:38,190 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2024-10-10 22:23:38,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-10 22:23:38,191 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 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 26 [2024-10-10 22:23:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:23:38,191 INFO L225 Difference]: With dead ends: 64 [2024-10-10 22:23:38,191 INFO L226 Difference]: Without dead ends: 44 [2024-10-10 22:23:38,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 37.9s TimeCoverageRelationStatistics Valid=820, Invalid=4585, Unknown=1, NotChecked=144, Total=5550 [2024-10-10 22:23:38,193 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:23:38,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 152 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 548 Invalid, 0 Unknown, 59 Unchecked, 10.5s Time] [2024-10-10 22:23:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-10 22:23:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 29. [2024-10-10 22:23:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:23:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-10-10 22:23:38,200 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 26 [2024-10-10 22:23:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:23:38,200 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-10-10 22:23:38,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 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-10-10 22:23:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-10-10 22:23:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-10 22:23:38,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:23:38,201 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:23:38,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-10 22:23:38,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:23:38,406 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:23:38,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:23:38,406 INFO L85 PathProgramCache]: Analyzing trace with hash 444924774, now seen corresponding path program 7 times [2024-10-10 22:23:38,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:23:38,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903047001] [2024-10-10 22:23:38,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:23:38,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:23:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-10 22:23:38,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [938938358] [2024-10-10 22:23:38,455 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-10 22:23:38,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:23:38,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:23:38,456 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:23:38,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 22:23:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:23:38,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-10 22:23:38,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:23:38,547 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-10-10 22:23:38,559 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-10-10 22:23:38,577 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-10-10 22:23:38,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:23:38,594 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-10-10 22:23:38,638 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-10-10 22:23:38,661 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-10-10 22:23:38,681 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-10-10 22:23:38,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:23:38,730 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-10-10 22:23:38,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:23:38,762 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-10-10 22:23:38,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:23:38,788 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-10-10 22:23:38,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:23:38,843 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-10-10 22:23:38,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:23:38,870 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 37 treesize of output 24 [2024-10-10 22:23:38,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:23:38,895 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 30 treesize of output 14 [2024-10-10 22:23:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:23:38,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:23:40,127 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-10-10 22:23:40,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:23:40,141 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 16501 treesize of output 15221 [2024-10-10 22:23:50,238 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:23:50,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:23:50,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903047001] [2024-10-10 22:23:50,238 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-10 22:23:50,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938938358] [2024-10-10 22:23:50,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938938358] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:23:50,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:23:50,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2024-10-10 22:23:50,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554998022] [2024-10-10 22:23:50,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:23:50,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-10 22:23:50,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:23:50,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-10 22:23:50,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1221, Unknown=9, NotChecked=0, Total=1406 [2024-10-10 22:23:50,240 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 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-10-10 22:23:53,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-10-10 22:23:56,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-10-10 22:23:58,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-10-10 22:24:00,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:24:00,840 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2024-10-10 22:24:00,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-10 22:24:00,841 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 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) Word has length 27 [2024-10-10 22:24:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:24:00,841 INFO L225 Difference]: With dead ends: 86 [2024-10-10 22:24:00,841 INFO L226 Difference]: Without dead ends: 84 [2024-10-10 22:24:00,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=336, Invalid=2306, Unknown=10, NotChecked=0, Total=2652 [2024-10-10 22:24:00,842 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 119 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:24:00,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 218 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2024-10-10 22:24:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-10 22:24:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 51. [2024-10-10 22:24:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 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-10-10 22:24:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-10-10 22:24:00,856 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 27 [2024-10-10 22:24:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:24:00,856 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-10-10 22:24:00,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 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-10-10 22:24:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-10-10 22:24:00,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-10 22:24:00,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:24:00,856 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:24:00,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-10 22:24:01,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-10 22:24:01,057 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:24:01,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:24:01,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1432300002, now seen corresponding path program 8 times [2024-10-10 22:24:01,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:24:01,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380688634] [2024-10-10 22:24:01,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:24:01,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:24:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:24:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:24:01,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:24:01,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380688634] [2024-10-10 22:24:01,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380688634] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:24:01,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951984691] [2024-10-10 22:24:01,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:24:01,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:24:01,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:24:01,178 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:24:01,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-10 22:24:01,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:24:01,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:24:01,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-10 22:24:01,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:24:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:24:01,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:24:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:24:01,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951984691] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:24:01,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:24:01,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2024-10-10 22:24:01,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011239350] [2024-10-10 22:24:01,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:24:01,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-10 22:24:01,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:24:01,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-10 22:24:01,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-10 22:24:01,355 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:24:01,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:24:01,510 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2024-10-10 22:24:01,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-10 22:24:01,510 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-10 22:24:01,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:24:01,511 INFO L225 Difference]: With dead ends: 122 [2024-10-10 22:24:01,511 INFO L226 Difference]: Without dead ends: 91 [2024-10-10 22:24:01,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2024-10-10 22:24:01,512 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 66 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:24:01,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 73 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:24:01,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-10 22:24:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2024-10-10 22:24:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.171875) internal successors, (75), 64 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:24:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2024-10-10 22:24:01,531 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 28 [2024-10-10 22:24:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:24:01,531 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2024-10-10 22:24:01,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:24:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2024-10-10 22:24:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-10 22:24:01,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:24:01,532 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:24:01,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-10 22:24:01,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:24:01,733 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:24:01,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:24:01,733 INFO L85 PathProgramCache]: Analyzing trace with hash 637829400, now seen corresponding path program 9 times [2024-10-10 22:24:01,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:24:01,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895840710] [2024-10-10 22:24:01,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:24:01,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:24:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:24:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:24:01,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:24:01,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895840710] [2024-10-10 22:24:01,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895840710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:24:01,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970590481] [2024-10-10 22:24:01,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 22:24:01,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:24:01,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:24:01,855 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:24:01,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-10 22:24:01,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-10 22:24:01,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:24:01,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-10 22:24:01,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:24:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:24:02,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:24:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:24:02,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970590481] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:24:02,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:24:02,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2024-10-10 22:24:02,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373973546] [2024-10-10 22:24:02,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:24:02,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-10 22:24:02,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:24:02,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-10 22:24:02,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-10 22:24:02,093 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:24:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:24:02,356 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2024-10-10 22:24:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-10 22:24:02,357 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-10 22:24:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:24:02,357 INFO L225 Difference]: With dead ends: 110 [2024-10-10 22:24:02,357 INFO L226 Difference]: Without dead ends: 81 [2024-10-10 22:24:02,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2024-10-10 22:24:02,358 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 70 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:24:02,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 135 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:24:02,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-10 22:24:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2024-10-10 22:24:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:24:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-10-10 22:24:02,372 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 29 [2024-10-10 22:24:02,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:24:02,373 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-10-10 22:24:02,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:24:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2024-10-10 22:24:02,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-10 22:24:02,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:24:02,373 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:24:02,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-10 22:24:02,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-10 22:24:02,574 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:24:02,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:24:02,574 INFO L85 PathProgramCache]: Analyzing trace with hash 490008800, now seen corresponding path program 2 times [2024-10-10 22:24:02,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:24:02,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989987688] [2024-10-10 22:24:02,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:24:02,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:24:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:24:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:24:04,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:24:04,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989987688] [2024-10-10 22:24:04,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989987688] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:24:04,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276092574] [2024-10-10 22:24:04,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:24:04,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:24:04,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:24:04,211 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:24:04,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-10 22:24:04,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:24:04,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:24:04,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-10 22:24:04,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:24:04,294 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-10-10 22:24:04,299 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-10-10 22:24:04,327 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-10-10 22:24:04,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:24:04,359 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-10-10 22:24:04,440 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-10-10 22:24:04,481 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-10-10 22:24:04,517 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-10-10 22:24:04,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:24:04,597 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-10-10 22:24:04,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:24:04,637 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-10-10 22:24:04,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:24:04,681 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-10-10 22:24:04,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:24:04,787 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-10-10 22:24:04,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:24:04,835 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-10-10 22:24:04,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:24:04,888 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 37 treesize of output 24 [2024-10-10 22:24:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:24:05,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:24:08,156 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-10-10 22:24:08,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-10 22:24:08,177 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 31834 treesize of output 29274 [2024-10-10 22:24:09,138 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse4 (= 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse16 (not .cse8)) (.cse17 (forall ((v_arrayElimCell_85 Int)) (let ((.cse32 (+ .cse1 3 v_arrayElimCell_85))) (or (= (mod .cse32 .cse32) 0) (not (= (mod (+ .cse1 2 (* 2 v_arrayElimCell_85)) .cse32) 0)))))) (.cse6 (not .cse4)) (.cse18 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0)) (.cse0 (= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 0))) (and (or .cse0 (and (or (and (or (forall ((v_arrayElimCell_83 Int) (v_arrayElimCell_85 Int) (v_arrayElimCell_84 Int)) (let ((.cse3 (* 2 v_arrayElimCell_84)) (.cse2 (+ .cse1 v_arrayElimCell_85 v_arrayElimCell_84 v_arrayElimCell_83 1))) (or (not (= (mod (+ .cse1 (* 2 v_arrayElimCell_85) v_arrayElimCell_84 v_arrayElimCell_83) .cse2) 0)) (= (mod (+ .cse1 .cse3 v_arrayElimCell_85 1) (+ .cse1 2 v_arrayElimCell_85 v_arrayElimCell_84)) 0) (= (mod (+ .cse1 .cse3 v_arrayElimCell_85 v_arrayElimCell_83) .cse2) 0)))) .cse4) (or (forall ((v_arrayElimCell_85 Int) (v_arrayElimCell_84 Int)) (let ((.cse5 (+ .cse1 2 v_arrayElimCell_85 v_arrayElimCell_84))) (or (= (mod (+ .cse1 (* 2 v_arrayElimCell_84) v_arrayElimCell_85 1) .cse5) 0) (not (= (mod (+ .cse1 (* 2 v_arrayElimCell_85) v_arrayElimCell_84 1) .cse5) 0))))) .cse6) (or (forall ((v_arrayElimCell_83 Int) (v_arrayElimCell_85 Int) (v_arrayElimCell_84 Int)) (let ((.cse7 (+ .cse1 v_arrayElimCell_85 v_arrayElimCell_84 v_arrayElimCell_83 1))) (or (not (= (mod (+ .cse1 (* 2 v_arrayElimCell_85) v_arrayElimCell_84 v_arrayElimCell_83) .cse7) 0)) (= (mod (+ .cse1 (* 2 v_arrayElimCell_84) v_arrayElimCell_85 v_arrayElimCell_83) .cse7) 0)))) .cse4)) .cse8) (or (and (or .cse4 (forall ((v_arrayElimCell_83 Int) (v_arrayElimCell_85 Int) (v_arrayElimCell_84 Int)) (let ((.cse9 (+ .cse1 v_arrayElimCell_85 v_arrayElimCell_84 v_arrayElimCell_83 1))) (or (not (= (mod (+ .cse1 (* 2 v_arrayElimCell_85) v_arrayElimCell_84 v_arrayElimCell_83) .cse9) 0)) (= (let ((.cse10 (+ .cse1 3 v_arrayElimCell_85))) (mod .cse10 .cse10)) 0) (= (mod (+ .cse1 (* 2 v_arrayElimCell_84) v_arrayElimCell_85 v_arrayElimCell_83) .cse9) 0))))) (or (forall ((v_arrayElimCell_83 Int) (v_arrayElimCell_85 Int) (v_arrayElimCell_84 Int)) (let ((.cse12 (* 2 v_arrayElimCell_84)) (.cse11 (+ .cse1 v_arrayElimCell_85 v_arrayElimCell_84 v_arrayElimCell_83 1))) (or (not (= (mod (+ .cse1 (* 2 v_arrayElimCell_85) v_arrayElimCell_84 v_arrayElimCell_83) .cse11) 0)) (= (mod (+ .cse1 .cse12 v_arrayElimCell_85 1) (+ .cse1 2 v_arrayElimCell_85 v_arrayElimCell_84)) 0) (= (let ((.cse13 (+ .cse1 3 v_arrayElimCell_85))) (mod .cse13 .cse13)) 0) (= (mod (+ .cse1 .cse12 v_arrayElimCell_85 v_arrayElimCell_83) .cse11) 0)))) .cse4) (or (forall ((v_arrayElimCell_85 Int) (v_arrayElimCell_84 Int)) (let ((.cse14 (+ .cse1 2 v_arrayElimCell_85 v_arrayElimCell_84))) (or (= (mod (+ .cse1 (* 2 v_arrayElimCell_84) v_arrayElimCell_85 1) .cse14) 0) (= (let ((.cse15 (+ .cse1 3 v_arrayElimCell_85))) (mod .cse15 .cse15)) 0) (not (= (mod (+ .cse1 (* 2 v_arrayElimCell_85) v_arrayElimCell_84 1) .cse14) 0))))) .cse6)) .cse8) (or .cse16 .cse17)) .cse18) (or (and (or (forall ((v_arrayElimCell_83 Int) (v_arrayElimCell_84 Int)) (= (mod (+ .cse1 (* 2 v_arrayElimCell_84) v_arrayElimCell_83 1) (+ .cse1 2 v_arrayElimCell_84 v_arrayElimCell_83)) 0)) .cse16 .cse17) (or (and (or (forall ((v_arrayElimCell_83 Int) (v_arrayElimCell_85 Int) (v_arrayElimCell_84 Int)) (let ((.cse19 (* 2 v_arrayElimCell_84)) (.cse20 (+ .cse1 2 v_arrayElimCell_85 v_arrayElimCell_84))) (or (= (mod (+ .cse1 .cse19 v_arrayElimCell_83 1) (+ .cse1 2 v_arrayElimCell_84 v_arrayElimCell_83)) 0) (= (mod (+ .cse1 .cse19 v_arrayElimCell_85 1) .cse20) 0) (not (= (mod (+ .cse1 (* 2 v_arrayElimCell_85) v_arrayElimCell_84 1) .cse20) 0))))) .cse6) (or (forall ((v_arrayElimCell_83 Int) (v_arrayElimCell_85 Int) (v_arrayElimCell_84 Int)) (let ((.cse22 (* 2 v_arrayElimCell_84)) (.cse21 (+ .cse1 v_arrayElimCell_85 v_arrayElimCell_84 v_arrayElimCell_83 1))) (or (not (= (mod (+ .cse1 (* 2 v_arrayElimCell_85) v_arrayElimCell_84 v_arrayElimCell_83) .cse21) 0)) (= (mod (+ .cse1 .cse22 v_arrayElimCell_83 1) (+ .cse1 2 v_arrayElimCell_84 v_arrayElimCell_83)) 0) (= (mod (+ .cse1 .cse22 v_arrayElimCell_85 v_arrayElimCell_83) .cse21) 0)))) .cse4) (or (forall ((v_arrayElimCell_83 Int) (v_arrayElimCell_85 Int) (v_arrayElimCell_84 Int)) (let ((.cse24 (* 2 v_arrayElimCell_84)) (.cse23 (+ .cse1 v_arrayElimCell_85 v_arrayElimCell_84 v_arrayElimCell_83 1))) (or (not (= (mod (+ .cse1 (* 2 v_arrayElimCell_85) v_arrayElimCell_84 v_arrayElimCell_83) .cse23) 0)) (= (mod (+ .cse1 .cse24 v_arrayElimCell_83 1) (+ .cse1 2 v_arrayElimCell_84 v_arrayElimCell_83)) 0) (= (mod (+ .cse1 .cse24 v_arrayElimCell_85 1) (+ .cse1 2 v_arrayElimCell_85 v_arrayElimCell_84)) 0) (= (mod (+ .cse1 .cse24 v_arrayElimCell_85 v_arrayElimCell_83) .cse23) 0)))) .cse4)) .cse8) (or (and (or .cse4 (forall ((v_arrayElimCell_83 Int) (v_arrayElimCell_85 Int) (v_arrayElimCell_84 Int)) (let ((.cse26 (* 2 v_arrayElimCell_84)) (.cse25 (+ .cse1 v_arrayElimCell_85 v_arrayElimCell_84 v_arrayElimCell_83 1))) (or (not (= (mod (+ .cse1 (* 2 v_arrayElimCell_85) v_arrayElimCell_84 v_arrayElimCell_83) .cse25) 0)) (= (mod (+ .cse1 .cse26 v_arrayElimCell_83 1) (+ .cse1 2 v_arrayElimCell_84 v_arrayElimCell_83)) 0) (= (let ((.cse27 (+ .cse1 3 v_arrayElimCell_85))) (mod .cse27 .cse27)) 0) (= (mod (+ .cse1 .cse26 v_arrayElimCell_85 v_arrayElimCell_83) .cse25) 0))))) (or (forall ((v_arrayElimCell_83 Int) (v_arrayElimCell_85 Int) (v_arrayElimCell_84 Int)) (let ((.cse28 (* 2 v_arrayElimCell_84)) (.cse29 (+ .cse1 2 v_arrayElimCell_85 v_arrayElimCell_84))) (or (= (mod (+ .cse1 .cse28 v_arrayElimCell_83 1) (+ .cse1 2 v_arrayElimCell_84 v_arrayElimCell_83)) 0) (= (mod (+ .cse1 .cse28 v_arrayElimCell_85 1) .cse29) 0) (= (let ((.cse30 (+ .cse1 3 v_arrayElimCell_85))) (mod .cse30 .cse30)) 0) (not (= (mod (+ .cse1 (* 2 v_arrayElimCell_85) v_arrayElimCell_84 1) .cse29) 0))))) .cse6)) .cse8)) .cse0 .cse18) (or (forall ((v_arrayElimCell_83 Int) (v_arrayElimCell_84 Int)) (let ((.cse31 (+ .cse1 2 v_arrayElimCell_84 v_arrayElimCell_83))) (or (= (mod (+ .cse1 (* 2 v_arrayElimCell_84) v_arrayElimCell_83 1) .cse31) 0) (not (= (mod .cse31 .cse31) 0))))) (not .cse0))))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) is different from false [2024-10-10 22:24:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-10 22:24:09,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276092574] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:24:09,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:24:09,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 23] total 64 [2024-10-10 22:24:09,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363737350] [2024-10-10 22:24:09,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:24:09,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-10-10 22:24:09,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:24:09,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-10-10 22:24:09,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=3399, Unknown=1, NotChecked=122, Total=4032 [2024-10-10 22:24:09,154 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 64 states, 64 states have (on average 1.25) internal successors, (80), 64 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)