./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/rev-2-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/rev-2-n-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf03248da0b4b82491822f692d5527664b721dbcd28594bdb518a5eab7d5a1f3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 15:43:45,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 15:43:45,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 15:43:45,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 15:43:45,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 15:43:45,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 15:43:45,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 15:43:45,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 15:43:45,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 15:43:45,210 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 15:43:45,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 15:43:45,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 15:43:45,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 15:43:45,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 15:43:45,211 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 15:43:45,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 15:43:45,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 15:43:45,212 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 15:43:45,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 15:43:45,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 15:43:45,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 15:43:45,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 15:43:45,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 15:43:45,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 15:43:45,214 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 15:43:45,214 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 15:43:45,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 15:43:45,215 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 15:43:45,215 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 15:43:45,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 15:43:45,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 15:43:45,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 15:43:45,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 15:43:45,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 15:43:45,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 15:43:45,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 15:43:45,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 15:43:45,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 15:43:45,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 15:43:45,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 15:43:45,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 15:43:45,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 15:43:45,219 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf03248da0b4b82491822f692d5527664b721dbcd28594bdb518a5eab7d5a1f3 [2024-11-11 15:43:45,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 15:43:45,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 15:43:45,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 15:43:45,441 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 15:43:45,441 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 15:43:45,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/rev-2-n-u.c [2024-11-11 15:43:46,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 15:43:46,845 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 15:43:46,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-2-n-u.c [2024-11-11 15:43:46,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49a32a8fb/145df9408ba448d199154545c6bbc82f/FLAG295c3c208 [2024-11-11 15:43:47,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49a32a8fb/145df9408ba448d199154545c6bbc82f [2024-11-11 15:43:47,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 15:43:47,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 15:43:47,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 15:43:47,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 15:43:47,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 15:43:47,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:43:47" (1/1) ... [2024-11-11 15:43:47,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3a3076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:47, skipping insertion in model container [2024-11-11 15:43:47,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:43:47" (1/1) ... [2024-11-11 15:43:47,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 15:43:47,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-2-n-u.c[321,334] [2024-11-11 15:43:47,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 15:43:47,463 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 15:43:47,472 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-2-n-u.c[321,334] [2024-11-11 15:43:47,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 15:43:47,505 INFO L204 MainTranslator]: Completed translation [2024-11-11 15:43:47,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:47 WrapperNode [2024-11-11 15:43:47,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 15:43:47,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 15:43:47,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 15:43:47,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 15:43:47,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:47" (1/1) ... [2024-11-11 15:43:47,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:47" (1/1) ... [2024-11-11 15:43:47,534 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2024-11-11 15:43:47,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 15:43:47,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 15:43:47,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 15:43:47,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 15:43:47,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:47" (1/1) ... [2024-11-11 15:43:47,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:47" (1/1) ... [2024-11-11 15:43:47,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:47" (1/1) ... [2024-11-11 15:43:47,585 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-11 15:43:47,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:47" (1/1) ... [2024-11-11 15:43:47,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:47" (1/1) ... [2024-11-11 15:43:47,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:47" (1/1) ... [2024-11-11 15:43:47,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:47" (1/1) ... [2024-11-11 15:43:47,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:47" (1/1) ... [2024-11-11 15:43:47,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:47" (1/1) ... [2024-11-11 15:43:47,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 15:43:47,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 15:43:47,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 15:43:47,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 15:43:47,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:47" (1/1) ... [2024-11-11 15:43:47,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 15:43:47,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:43:47,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 15:43:47,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 15:43:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 15:43:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 15:43:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 15:43:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 15:43:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 15:43:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 15:43:47,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 15:43:47,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-11 15:43:47,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 15:43:47,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 15:43:47,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 15:43:47,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 15:43:47,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-11 15:43:47,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 15:43:47,830 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 15:43:47,832 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 15:43:47,998 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-11 15:43:48,001 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 15:43:48,014 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 15:43:48,015 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-11 15:43:48,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:43:48 BoogieIcfgContainer [2024-11-11 15:43:48,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 15:43:48,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 15:43:48,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 15:43:48,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 15:43:48,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 03:43:47" (1/3) ... [2024-11-11 15:43:48,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a3ca1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:43:48, skipping insertion in model container [2024-11-11 15:43:48,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:47" (2/3) ... [2024-11-11 15:43:48,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a3ca1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:43:48, skipping insertion in model container [2024-11-11 15:43:48,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:43:48" (3/3) ... [2024-11-11 15:43:48,025 INFO L112 eAbstractionObserver]: Analyzing ICFG rev-2-n-u.c [2024-11-11 15:43:48,038 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 15:43:48,039 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 15:43:48,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 15:43:48,098 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;@23c7c089, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 15:43:48,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 15:43:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 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-11-11 15:43:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 15:43:48,106 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:43:48,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:43:48,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:43:48,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:43:48,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1817636276, now seen corresponding path program 1 times [2024-11-11 15:43:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:43:48,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313079481] [2024-11-11 15:43:48,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:48,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:43:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:43:48,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:43:48,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313079481] [2024-11-11 15:43:48,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313079481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:43:48,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:43:48,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 15:43:48,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190646484] [2024-11-11 15:43:48,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:43:48,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 15:43:48,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:43:48,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 15:43:48,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:43:48,373 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 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) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:43:48,418 INFO L93 Difference]: Finished difference Result 43 states and 71 transitions. [2024-11-11 15:43:48,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 15:43:48,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-11-11 15:43:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:43:48,426 INFO L225 Difference]: With dead ends: 43 [2024-11-11 15:43:48,426 INFO L226 Difference]: Without dead ends: 20 [2024-11-11 15:43:48,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:43:48,433 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:43:48,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:43:48,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-11 15:43:48,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-11 15:43:48,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2024-11-11 15:43:48,470 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 10 [2024-11-11 15:43:48,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:43:48,471 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-11-11 15:43:48,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:48,471 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2024-11-11 15:43:48,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-11 15:43:48,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:43:48,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:43:48,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 15:43:48,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:43:48,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:43:48,474 INFO L85 PathProgramCache]: Analyzing trace with hash 429030367, now seen corresponding path program 1 times [2024-11-11 15:43:48,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:43:48,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282346971] [2024-11-11 15:43:48,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:48,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:43:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:43:48,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:43:48,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282346971] [2024-11-11 15:43:48,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282346971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:43:48,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:43:48,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 15:43:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063417208] [2024-11-11 15:43:48,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:43:48,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:43:48,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:43:48,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:43:48,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:43:48,610 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:43:48,650 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2024-11-11 15:43:48,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:43:48,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-11 15:43:48,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:43:48,652 INFO L225 Difference]: With dead ends: 40 [2024-11-11 15:43:48,652 INFO L226 Difference]: Without dead ends: 25 [2024-11-11 15:43:48,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:43:48,653 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 30 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:43:48,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 26 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:43:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-11 15:43:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2024-11-11 15:43:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:48,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-11-11 15:43:48,662 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2024-11-11 15:43:48,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:43:48,662 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-11 15:43:48,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2024-11-11 15:43:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-11 15:43:48,663 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:43:48,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:43:48,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 15:43:48,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:43:48,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:43:48,664 INFO L85 PathProgramCache]: Analyzing trace with hash -270581085, now seen corresponding path program 1 times [2024-11-11 15:43:48,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:43:48,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039550601] [2024-11-11 15:43:48,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:48,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:43:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 15:43:48,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:43:48,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039550601] [2024-11-11 15:43:48,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039550601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:43:48,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:43:48,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 15:43:48,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24533065] [2024-11-11 15:43:48,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:43:48,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:43:48,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:43:48,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:43:48,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:43:48,782 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:48,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:43:48,848 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2024-11-11 15:43:48,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:43:48,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-11 15:43:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:43:48,853 INFO L225 Difference]: With dead ends: 45 [2024-11-11 15:43:48,853 INFO L226 Difference]: Without dead ends: 36 [2024-11-11 15:43:48,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:43:48,854 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 28 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:43:48,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 20 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:43:48,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-11 15:43:48,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2024-11-11 15:43:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:48,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-11-11 15:43:48,863 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 14 [2024-11-11 15:43:48,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:43:48,863 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-11 15:43:48,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2024-11-11 15:43:48,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 15:43:48,864 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:43:48,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:43:48,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 15:43:48,864 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:43:48,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:43:48,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1391394002, now seen corresponding path program 1 times [2024-11-11 15:43:48,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:43:48,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158657737] [2024-11-11 15:43:48,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:48,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:43:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:49,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 15:43:49,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:43:49,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158657737] [2024-11-11 15:43:49,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158657737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:43:49,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326514170] [2024-11-11 15:43:49,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:49,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:43:49,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:43:49,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:43:49,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 15:43:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:49,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 15:43:49,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:43:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 15:43:49,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:43:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 15:43:49,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326514170] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:43:49,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:43:49,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-11 15:43:49,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904921048] [2024-11-11 15:43:49,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:43:49,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 15:43:49,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:43:49,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 15:43:49,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-11 15:43:49,149 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 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-11-11 15:43:49,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:43:49,224 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2024-11-11 15:43:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 15:43:49,225 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 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) Word has length 18 [2024-11-11 15:43:49,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:43:49,225 INFO L225 Difference]: With dead ends: 62 [2024-11-11 15:43:49,226 INFO L226 Difference]: Without dead ends: 43 [2024-11-11 15:43:49,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-11 15:43:49,227 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 80 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:43:49,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 63 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:43:49,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-11 15:43:49,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2024-11-11 15:43:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-11-11 15:43:49,234 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 18 [2024-11-11 15:43:49,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:43:49,235 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-11-11 15:43:49,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 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-11-11 15:43:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-11-11 15:43:49,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 15:43:49,235 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:43:49,236 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:43:49,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 15:43:49,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:43:49,437 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:43:49,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:43:49,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1541106392, now seen corresponding path program 2 times [2024-11-11 15:43:49,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:43:49,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541159335] [2024-11-11 15:43:49,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:49,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:43:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:49,572 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 15:43:49,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:43:49,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541159335] [2024-11-11 15:43:49,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541159335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:43:49,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391822934] [2024-11-11 15:43:49,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 15:43:49,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:43:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:43:49,575 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:43:49,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 15:43:49,640 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 15:43:49,641 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 15:43:49,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 15:43:49,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:43:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 15:43:49,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:43:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 15:43:49,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391822934] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:43:49,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:43:49,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-11-11 15:43:49,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368320895] [2024-11-11 15:43:49,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:43:49,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-11 15:43:49,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:43:49,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-11 15:43:49,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2024-11-11 15:43:49,809 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 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-11-11 15:43:50,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:43:50,008 INFO L93 Difference]: Finished difference Result 119 states and 150 transitions. [2024-11-11 15:43:50,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 15:43:50,009 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 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 24 [2024-11-11 15:43:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:43:50,010 INFO L225 Difference]: With dead ends: 119 [2024-11-11 15:43:50,011 INFO L226 Difference]: Without dead ends: 85 [2024-11-11 15:43:50,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2024-11-11 15:43:50,013 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 238 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:43:50,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 89 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:43:50,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-11 15:43:50,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2024-11-11 15:43:50,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2024-11-11 15:43:50,031 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 24 [2024-11-11 15:43:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:43:50,032 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-11-11 15:43:50,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 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-11-11 15:43:50,032 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2024-11-11 15:43:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-11 15:43:50,033 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:43:50,034 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:43:50,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 15:43:50,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:43:50,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:43:50,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:43:50,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1220021784, now seen corresponding path program 3 times [2024-11-11 15:43:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:43:50,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442895808] [2024-11-11 15:43:50,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:43:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-11 15:43:50,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:43:50,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442895808] [2024-11-11 15:43:50,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442895808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:43:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366411955] [2024-11-11 15:43:50,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 15:43:50,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:43:50,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:43:50,503 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:43:50,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 15:43:50,565 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-11 15:43:50,565 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 15:43:50,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 15:43:50,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:43:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-11 15:43:50,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:43:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-11 15:43:50,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366411955] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:43:50,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:43:50,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 20 [2024-11-11 15:43:50,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72590752] [2024-11-11 15:43:50,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:43:50,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-11 15:43:50,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:43:50,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-11 15:43:50,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-11 15:43:50,712 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:51,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:43:51,744 INFO L93 Difference]: Finished difference Result 431 states and 477 transitions. [2024-11-11 15:43:51,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-11 15:43:51,744 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 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 36 [2024-11-11 15:43:51,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:43:51,747 INFO L225 Difference]: With dead ends: 431 [2024-11-11 15:43:51,747 INFO L226 Difference]: Without dead ends: 367 [2024-11-11 15:43:51,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1513, Invalid=3179, Unknown=0, NotChecked=0, Total=4692 [2024-11-11 15:43:51,752 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1453 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:43:51,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 69 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:43:51,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-11 15:43:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 156. [2024-11-11 15:43:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.1419354838709677) internal successors, (177), 155 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2024-11-11 15:43:51,790 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 36 [2024-11-11 15:43:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:43:51,791 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2024-11-11 15:43:51,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2024-11-11 15:43:51,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-11 15:43:51,796 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:43:51,796 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:43:51,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 15:43:51,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:43:51,997 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:43:51,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:43:51,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1520129836, now seen corresponding path program 4 times [2024-11-11 15:43:51,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:43:51,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264326208] [2024-11-11 15:43:51,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:51,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:43:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 436 proven. 66 refuted. 0 times theorem prover too weak. 1786 trivial. 0 not checked. [2024-11-11 15:43:52,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:43:52,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264326208] [2024-11-11 15:43:52,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264326208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:43:52,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431472572] [2024-11-11 15:43:52,641 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 15:43:52,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:43:52,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:43:52,643 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:43:52,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 15:43:53,803 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 15:43:53,803 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 15:43:53,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 176 conjuncts are in the unsatisfiable core [2024-11-11 15:43:53,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:43:53,900 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 27 treesize of output 23 [2024-11-11 15:43:53,935 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 53 treesize of output 52 [2024-11-11 15:43:53,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:43:53,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 80 [2024-11-11 15:43:54,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:43:54,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 103 treesize of output 108 [2024-11-11 15:43:54,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:43:54,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 136 [2024-11-11 15:43:54,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:43:54,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 153 treesize of output 164 [2024-11-11 15:43:54,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:43:54,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 178 treesize of output 192 [2024-11-11 15:43:54,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:43:54,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 203 treesize of output 220 [2024-11-11 15:43:54,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:43:54,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 228 treesize of output 248 [2024-11-11 15:43:54,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:43:54,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 253 treesize of output 276 [2024-11-11 15:43:54,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 15:43:54,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 278 treesize of output 304 [2024-11-11 15:43:55,243 INFO L349 Elim1Store]: treesize reduction 372, result has 20.9 percent of original size [2024-11-11 15:43:55,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 66 case distinctions, treesize of input 305 treesize of output 334 [2024-11-11 15:43:55,556 INFO L349 Elim1Store]: treesize reduction 576, result has 15.9 percent of original size [2024-11-11 15:43:55,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 78 case distinctions, treesize of input 338 treesize of output 370 [2024-11-11 15:43:56,020 INFO L349 Elim1Store]: treesize reduction 736, result has 14.3 percent of original size [2024-11-11 15:43:56,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 91 case distinctions, treesize of input 371 treesize of output 406 [2024-11-11 15:43:56,618 INFO L349 Elim1Store]: treesize reduction 904, result has 13.2 percent of original size [2024-11-11 15:43:56,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 105 case distinctions, treesize of input 404 treesize of output 442 [2024-11-11 15:43:57,191 INFO L349 Elim1Store]: treesize reduction 1080, result has 12.3 percent of original size [2024-11-11 15:43:57,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 120 case distinctions, treesize of input 437 treesize of output 478 [2024-11-11 15:43:57,918 INFO L349 Elim1Store]: treesize reduction 1264, result has 11.5 percent of original size [2024-11-11 15:43:57,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 136 case distinctions, treesize of input 470 treesize of output 514 [2024-11-11 15:43:58,756 INFO L349 Elim1Store]: treesize reduction 1456, result has 10.9 percent of original size [2024-11-11 15:43:58,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 153 case distinctions, treesize of input 503 treesize of output 550 [2024-11-11 15:44:00,081 INFO L349 Elim1Store]: treesize reduction 1656, result has 10.4 percent of original size [2024-11-11 15:44:00,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 171 case distinctions, treesize of input 536 treesize of output 586 [2024-11-11 15:44:08,000 INFO L349 Elim1Store]: treesize reduction 1864, result has 10.0 percent of original size [2024-11-11 15:44:08,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 190 case distinctions, treesize of input 569 treesize of output 622 [2024-11-11 15:44:32,216 INFO L349 Elim1Store]: treesize reduction 2080, result has 9.6 percent of original size [2024-11-11 15:44:32,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 210 case distinctions, treesize of input 602 treesize of output 658 [2024-11-11 15:44:51,643 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-11 15:44:51,645 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-11 15:44:51,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-11 15:44:51,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 15:44:51,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:44:51,846 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:947) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-11-11 15:44:51,849 INFO L158 Benchmark]: Toolchain (without parser) took 64586.22ms. Allocated memory was 151.0MB in the beginning and 388.0MB in the end (delta: 237.0MB). Free memory was 80.4MB in the beginning and 326.1MB in the end (delta: -245.8MB). Peak memory consumption was 195.1MB. Max. memory is 16.1GB. [2024-11-11 15:44:51,849 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 15:44:51,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.88ms. Allocated memory is still 151.0MB. Free memory was 80.0MB in the beginning and 67.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 15:44:51,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.13ms. Allocated memory is still 151.0MB. Free memory was 67.3MB in the beginning and 65.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 15:44:51,853 INFO L158 Benchmark]: Boogie Preprocessor took 119.52ms. Allocated memory is still 151.0MB. Free memory was 65.7MB in the beginning and 121.8MB in the end (delta: -56.0MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-11 15:44:51,853 INFO L158 Benchmark]: RCFGBuilder took 360.72ms. Allocated memory is still 151.0MB. Free memory was 121.8MB in the beginning and 109.1MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 15:44:51,854 INFO L158 Benchmark]: TraceAbstraction took 63830.30ms. Allocated memory was 151.0MB in the beginning and 388.0MB in the end (delta: 237.0MB). Free memory was 108.6MB in the beginning and 326.1MB in the end (delta: -217.5MB). Peak memory consumption was 222.5MB. Max. memory is 16.1GB. [2024-11-11 15:44:51,854 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 101.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.88ms. Allocated memory is still 151.0MB. Free memory was 80.0MB in the beginning and 67.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.13ms. Allocated memory is still 151.0MB. Free memory was 67.3MB in the beginning and 65.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.52ms. Allocated memory is still 151.0MB. Free memory was 65.7MB in the beginning and 121.8MB in the end (delta: -56.0MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * RCFGBuilder took 360.72ms. Allocated memory is still 151.0MB. Free memory was 121.8MB in the beginning and 109.1MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 63830.30ms. Allocated memory was 151.0MB in the beginning and 388.0MB in the end (delta: 237.0MB). Free memory was 108.6MB in the beginning and 326.1MB in the end (delta: -217.5MB). Peak memory consumption was 222.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/rev-2-n-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf03248da0b4b82491822f692d5527664b721dbcd28594bdb518a5eab7d5a1f3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 15:44:53,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 15:44:54,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-11 15:44:54,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 15:44:54,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 15:44:54,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 15:44:54,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 15:44:54,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 15:44:54,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 15:44:54,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 15:44:54,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 15:44:54,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 15:44:54,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 15:44:54,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 15:44:54,074 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 15:44:54,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 15:44:54,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 15:44:54,075 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 15:44:54,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 15:44:54,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 15:44:54,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 15:44:54,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 15:44:54,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 15:44:54,079 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-11 15:44:54,079 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-11 15:44:54,080 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 15:44:54,080 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-11 15:44:54,080 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 15:44:54,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 15:44:54,080 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 15:44:54,080 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 15:44:54,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 15:44:54,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 15:44:54,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 15:44:54,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 15:44:54,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 15:44:54,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 15:44:54,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 15:44:54,091 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-11 15:44:54,091 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-11 15:44:54,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 15:44:54,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 15:44:54,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 15:44:54,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 15:44:54,092 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf03248da0b4b82491822f692d5527664b721dbcd28594bdb518a5eab7d5a1f3 [2024-11-11 15:44:54,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 15:44:54,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 15:44:54,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 15:44:54,392 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 15:44:54,395 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 15:44:54,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/rev-2-n-u.c [2024-11-11 15:44:55,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 15:44:55,940 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 15:44:55,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-2-n-u.c [2024-11-11 15:44:55,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990d91180/b66892cc4b3b4a6b94d7a7afc9b00375/FLAG0fd287cce [2024-11-11 15:44:55,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990d91180/b66892cc4b3b4a6b94d7a7afc9b00375 [2024-11-11 15:44:55,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 15:44:55,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 15:44:55,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 15:44:55,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 15:44:55,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 15:44:55,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:44:55" (1/1) ... [2024-11-11 15:44:55,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38426f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:44:55, skipping insertion in model container [2024-11-11 15:44:55,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:44:55" (1/1) ... [2024-11-11 15:44:55,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 15:44:56,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-2-n-u.c[321,334] [2024-11-11 15:44:56,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 15:44:56,169 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 15:44:56,179 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-2-n-u.c[321,334] [2024-11-11 15:44:56,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 15:44:56,209 INFO L204 MainTranslator]: Completed translation [2024-11-11 15:44:56,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:44:56 WrapperNode [2024-11-11 15:44:56,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 15:44:56,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 15:44:56,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 15:44:56,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 15:44:56,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:44:56" (1/1) ... [2024-11-11 15:44:56,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:44:56" (1/1) ... [2024-11-11 15:44:56,246 INFO L138 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2024-11-11 15:44:56,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 15:44:56,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 15:44:56,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 15:44:56,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 15:44:56,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:44:56" (1/1) ... [2024-11-11 15:44:56,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:44:56" (1/1) ... [2024-11-11 15:44:56,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:44:56" (1/1) ... [2024-11-11 15:44:56,279 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-11 15:44:56,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:44:56" (1/1) ... [2024-11-11 15:44:56,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:44:56" (1/1) ... [2024-11-11 15:44:56,287 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:44:56" (1/1) ... [2024-11-11 15:44:56,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:44:56" (1/1) ... [2024-11-11 15:44:56,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:44:56" (1/1) ... [2024-11-11 15:44:56,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:44:56" (1/1) ... [2024-11-11 15:44:56,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 15:44:56,302 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 15:44:56,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 15:44:56,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 15:44:56,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:44:56" (1/1) ... [2024-11-11 15:44:56,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 15:44:56,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:44:56,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 15:44:56,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 15:44:56,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 15:44:56,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-11 15:44:56,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-11 15:44:56,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-11 15:44:56,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 15:44:56,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-11 15:44:56,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-11 15:44:56,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-11 15:44:56,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 15:44:56,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 15:44:56,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 15:44:56,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-11 15:44:56,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-11 15:44:56,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-11 15:44:56,445 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 15:44:56,447 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 15:44:56,701 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-11 15:44:56,701 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 15:44:56,710 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 15:44:56,711 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-11 15:44:56,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:44:56 BoogieIcfgContainer [2024-11-11 15:44:56,712 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 15:44:56,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 15:44:56,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 15:44:56,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 15:44:56,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 03:44:55" (1/3) ... [2024-11-11 15:44:56,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39af577a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:44:56, skipping insertion in model container [2024-11-11 15:44:56,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:44:56" (2/3) ... [2024-11-11 15:44:56,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39af577a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:44:56, skipping insertion in model container [2024-11-11 15:44:56,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:44:56" (3/3) ... [2024-11-11 15:44:56,720 INFO L112 eAbstractionObserver]: Analyzing ICFG rev-2-n-u.c [2024-11-11 15:44:56,734 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 15:44:56,734 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 15:44:56,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 15:44:56,797 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;@b7c9009, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 15:44:56,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 15:44:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 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-11-11 15:44:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 15:44:56,806 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:44:56,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:44:56,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:44:56,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:44:56,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1817636276, now seen corresponding path program 1 times [2024-11-11 15:44:56,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:44:56,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807275849] [2024-11-11 15:44:56,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:44:56,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:44:56,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:44:56,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 15:44:56,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-11 15:44:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:44:56,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 15:44:56,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:44:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:44:57,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:44:57,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:44:57,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807275849] [2024-11-11 15:44:57,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807275849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:44:57,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:44:57,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 15:44:57,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073725809] [2024-11-11 15:44:57,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:44:57,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 15:44:57,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:44:57,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 15:44:57,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:44:57,039 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 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) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:44:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:44:57,148 INFO L93 Difference]: Finished difference Result 43 states and 71 transitions. [2024-11-11 15:44:57,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 15:44:57,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-11-11 15:44:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:44:57,159 INFO L225 Difference]: With dead ends: 43 [2024-11-11 15:44:57,159 INFO L226 Difference]: Without dead ends: 20 [2024-11-11 15:44:57,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:44:57,164 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:44:57,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:44:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-11 15:44:57,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-11 15:44:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:44:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2024-11-11 15:44:57,193 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 10 [2024-11-11 15:44:57,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:44:57,194 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-11-11 15:44:57,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:44:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2024-11-11 15:44:57,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-11 15:44:57,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:44:57,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:44:57,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-11 15:44:57,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:44:57,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:44:57,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:44:57,398 INFO L85 PathProgramCache]: Analyzing trace with hash 429030367, now seen corresponding path program 1 times [2024-11-11 15:44:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:44:57,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800591548] [2024-11-11 15:44:57,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:44:57,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:44:57,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:44:57,406 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 15:44:57,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-11 15:44:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:44:57,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 15:44:57,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:44:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:44:57,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:44:57,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:44:57,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800591548] [2024-11-11 15:44:57,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800591548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:44:57,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:44:57,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 15:44:57,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241079316] [2024-11-11 15:44:57,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:44:57,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:44:57,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:44:57,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:44:57,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:44:57,528 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:44:57,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:44:57,636 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2024-11-11 15:44:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:44:57,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-11 15:44:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:44:57,641 INFO L225 Difference]: With dead ends: 40 [2024-11-11 15:44:57,641 INFO L226 Difference]: Without dead ends: 25 [2024-11-11 15:44:57,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:44:57,642 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 30 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:44:57,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 26 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:44:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-11 15:44:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2024-11-11 15:44:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:44:57,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-11-11 15:44:57,648 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2024-11-11 15:44:57,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:44:57,648 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-11 15:44:57,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:44:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2024-11-11 15:44:57,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-11 15:44:57,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:44:57,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:44:57,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-11 15:44:57,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:44:57,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:44:57,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:44:57,854 INFO L85 PathProgramCache]: Analyzing trace with hash -270581085, now seen corresponding path program 1 times [2024-11-11 15:44:57,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:44:57,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810908232] [2024-11-11 15:44:57,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:44:57,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:44:57,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:44:57,859 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 15:44:57,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-11 15:44:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:44:57,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 15:44:57,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:44:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:44:57,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:44:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:44:58,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:44:58,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810908232] [2024-11-11 15:44:58,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810908232] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:44:58,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 15:44:58,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-11 15:44:58,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079100291] [2024-11-11 15:44:58,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 15:44:58,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 15:44:58,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:44:58,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 15:44:58,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 15:44:58,004 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:44:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:44:58,294 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2024-11-11 15:44:58,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 15:44:58,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 14 [2024-11-11 15:44:58,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:44:58,298 INFO L225 Difference]: With dead ends: 60 [2024-11-11 15:44:58,298 INFO L226 Difference]: Without dead ends: 42 [2024-11-11 15:44:58,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-11 15:44:58,299 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 80 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:44:58,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 60 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:44:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-11 15:44:58,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-11-11 15:44:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:44:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-11 15:44:58,317 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 14 [2024-11-11 15:44:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:44:58,317 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-11 15:44:58,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:44:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-11-11 15:44:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-11 15:44:58,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:44:58,318 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:44:58,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-11 15:44:58,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:44:58,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:44:58,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:44:58,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1443885857, now seen corresponding path program 2 times [2024-11-11 15:44:58,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:44:58,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783445652] [2024-11-11 15:44:58,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 15:44:58,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:44:58,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:44:58,526 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 15:44:58,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-11 15:44:58,564 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-11 15:44:58,564 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 15:44:58,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 15:44:58,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:44:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 15:44:58,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:44:58,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:44:58,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783445652] [2024-11-11 15:44:58,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783445652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:44:58,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:44:58,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 15:44:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177022479] [2024-11-11 15:44:58,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:44:58,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:44:58,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:44:58,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:44:58,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:44:58,594 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:44:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:44:58,707 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2024-11-11 15:44:58,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:44:58,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 17 [2024-11-11 15:44:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:44:58,713 INFO L225 Difference]: With dead ends: 84 [2024-11-11 15:44:58,713 INFO L226 Difference]: Without dead ends: 66 [2024-11-11 15:44:58,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:44:58,714 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 28 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:44:58,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 20 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:44:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-11 15:44:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 37. [2024-11-11 15:44:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:44:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-11-11 15:44:58,722 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 17 [2024-11-11 15:44:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:44:58,722 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-11-11 15:44:58,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:44:58,723 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-11-11 15:44:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 15:44:58,723 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:44:58,723 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:44:58,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-11 15:44:58,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:44:58,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:44:58,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:44:58,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1541106392, now seen corresponding path program 1 times [2024-11-11 15:44:58,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:44:58,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192911014] [2024-11-11 15:44:58,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:44:58,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:44:58,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:44:58,928 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 15:44:58,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-11 15:44:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:44:59,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 15:44:59,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:44:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 15:44:59,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:44:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 15:44:59,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:44:59,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192911014] [2024-11-11 15:44:59,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192911014] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:44:59,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 15:44:59,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-11 15:44:59,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657813600] [2024-11-11 15:44:59,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 15:44:59,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 15:44:59,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:44:59,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 15:44:59,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-11 15:44:59,217 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:45:00,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:45:00,097 INFO L93 Difference]: Finished difference Result 119 states and 150 transitions. [2024-11-11 15:45:00,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 15:45:00,099 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-11 15:45:00,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:45:00,100 INFO L225 Difference]: With dead ends: 119 [2024-11-11 15:45:00,100 INFO L226 Difference]: Without dead ends: 85 [2024-11-11 15:45:00,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2024-11-11 15:45:00,101 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 197 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 15:45:00,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 157 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 15:45:00,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-11 15:45:00,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2024-11-11 15:45:00,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:45:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2024-11-11 15:45:00,112 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 24 [2024-11-11 15:45:00,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:45:00,112 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2024-11-11 15:45:00,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:45:00,112 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2024-11-11 15:45:00,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-11 15:45:00,113 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:45:00,113 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:45:00,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-11 15:45:00,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:45:00,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:45:00,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:45:00,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1220021784, now seen corresponding path program 2 times [2024-11-11 15:45:00,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:45:00,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130876935] [2024-11-11 15:45:00,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 15:45:00,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:45:00,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:45:00,318 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 15:45:00,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-11 15:45:00,463 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 15:45:00,463 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 15:45:00,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-11 15:45:00,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:45:00,634 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-11 15:45:00,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:45:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-11 15:45:00,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:45:00,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130876935] [2024-11-11 15:45:00,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130876935] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:45:00,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 15:45:00,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-11 15:45:00,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413518814] [2024-11-11 15:45:00,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 15:45:00,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-11 15:45:00,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:45:00,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-11 15:45:00,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-11 15:45:00,963 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 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-11-11 15:45:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:45:03,254 INFO L93 Difference]: Finished difference Result 233 states and 288 transitions. [2024-11-11 15:45:03,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-11 15:45:03,257 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 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) Word has length 36 [2024-11-11 15:45:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:45:03,258 INFO L225 Difference]: With dead ends: 233 [2024-11-11 15:45:03,258 INFO L226 Difference]: Without dead ends: 169 [2024-11-11 15:45:03,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=479, Invalid=853, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 15:45:03,259 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 714 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 15:45:03,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 494 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 15:45:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-11 15:45:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 127. [2024-11-11 15:45:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.2142857142857142) internal successors, (153), 126 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:45:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2024-11-11 15:45:03,275 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 36 [2024-11-11 15:45:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:45:03,275 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2024-11-11 15:45:03,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 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-11-11 15:45:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2024-11-11 15:45:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-11 15:45:03,276 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:45:03,276 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:45:03,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-11 15:45:03,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:45:03,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:45:03,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:45:03,477 INFO L85 PathProgramCache]: Analyzing trace with hash -783303832, now seen corresponding path program 3 times [2024-11-11 15:45:03,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:45:03,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825273646] [2024-11-11 15:45:03,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 15:45:03,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:45:03,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:45:03,480 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 15:45:03,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-11 15:45:03,555 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-11 15:45:03,555 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 15:45:03,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 15:45:03,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:45:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2024-11-11 15:45:03,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:45:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2024-11-11 15:45:03,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:45:03,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825273646] [2024-11-11 15:45:03,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825273646] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:45:03,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 15:45:03,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-11 15:45:03,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278623953] [2024-11-11 15:45:03,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 15:45:03,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 15:45:03,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:45:03,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 15:45:03,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 15:45:03,821 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 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-11-11 15:45:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:45:04,091 INFO L93 Difference]: Finished difference Result 590 states and 718 transitions. [2024-11-11 15:45:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 15:45:04,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 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 60 [2024-11-11 15:45:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:45:04,094 INFO L225 Difference]: With dead ends: 590 [2024-11-11 15:45:04,094 INFO L226 Difference]: Without dead ends: 491 [2024-11-11 15:45:04,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-11 15:45:04,095 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 88 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:45:04,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 45 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:45:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-11 15:45:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 277. [2024-11-11 15:45:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.1195652173913044) internal successors, (309), 276 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:45:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 309 transitions. [2024-11-11 15:45:04,157 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 309 transitions. Word has length 60 [2024-11-11 15:45:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:45:04,161 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 309 transitions. [2024-11-11 15:45:04,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 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-11-11 15:45:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 309 transitions. [2024-11-11 15:45:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-11 15:45:04,167 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:45:04,167 INFO L218 NwaCegarLoop]: trace histogram [88, 88, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:45:04,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-11 15:45:04,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:45:04,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:45:04,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:45:04,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2132288564, now seen corresponding path program 4 times [2024-11-11 15:45:04,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:45:04,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926916895] [2024-11-11 15:45:04,369 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 15:45:04,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:45:04,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:45:04,374 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 15:45:04,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-11 15:45:05,431 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 15:45:05,432 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 15:45:05,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-11 15:45:05,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:45:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8404 backedges. 1591 proven. 253 refuted. 0 times theorem prover too weak. 6560 trivial. 0 not checked. [2024-11-11 15:45:05,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:45:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 8404 backedges. 1591 proven. 253 refuted. 0 times theorem prover too weak. 6560 trivial. 0 not checked. [2024-11-11 15:45:07,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:45:07,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926916895] [2024-11-11 15:45:07,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926916895] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:45:07,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 15:45:07,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-11 15:45:07,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970951179] [2024-11-11 15:45:07,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 15:45:07,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-11 15:45:07,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:45:07,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-11 15:45:07,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2024-11-11 15:45:07,016 INFO L87 Difference]: Start difference. First operand 277 states and 309 transitions. Second operand has 50 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:45:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:45:14,851 INFO L93 Difference]: Finished difference Result 882 states and 1140 transitions. [2024-11-11 15:45:14,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-11 15:45:14,854 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 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 210 [2024-11-11 15:45:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:45:14,856 INFO L225 Difference]: With dead ends: 882 [2024-11-11 15:45:14,856 INFO L226 Difference]: Without dead ends: 631 [2024-11-11 15:45:14,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1823, Invalid=3433, Unknown=0, NotChecked=0, Total=5256 [2024-11-11 15:45:14,864 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 2618 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 1158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2618 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 3533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1158 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:45:14,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2618 Valid, 1858 Invalid, 3533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1158 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-11 15:45:14,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-11 15:45:14,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 541. [2024-11-11 15:45:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 1.1055555555555556) internal successors, (597), 540 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:45:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 597 transitions. [2024-11-11 15:45:14,975 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 597 transitions. Word has length 210 [2024-11-11 15:45:14,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:45:14,975 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 597 transitions. [2024-11-11 15:45:14,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:45:14,976 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 597 transitions. [2024-11-11 15:45:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-11-11 15:45:14,984 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:45:14,984 INFO L218 NwaCegarLoop]: trace histogram [184, 184, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:45:15,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-11 15:45:15,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:45:15,185 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:45:15,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:45:15,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1718558668, now seen corresponding path program 5 times [2024-11-11 15:45:15,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:45:15,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872237017] [2024-11-11 15:45:15,187 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-11 15:45:15,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:45:15,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:45:15,193 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 15:45:15,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process