./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum05.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum05.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aee69f990ab81a58f1fe8cd275c8a09f43ca6a442f73810f885d3d0c9a85d2b3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 21:58:31,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 21:58:31,438 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 21:58:31,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 21:58:31,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 21:58:31,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 21:58:31,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 21:58:31,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 21:58:31,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 21:58:31,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 21:58:31,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 21:58:31,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 21:58:31,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 21:58:31,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 21:58:31,490 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 21:58:31,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 21:58:31,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 21:58:31,491 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 21:58:31,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 21:58:31,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 21:58:31,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 21:58:31,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 21:58:31,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 21:58:31,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 21:58:31,496 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 21:58:31,496 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 21:58:31,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 21:58:31,497 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 21:58:31,497 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 21:58:31,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 21:58:31,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 21:58:31,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 21:58:31,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 21:58:31,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 21:58:31,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 21:58:31,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 21:58:31,502 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 21:58:31,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 21:58:31,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 21:58:31,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 21:58:31,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 21:58:31,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 21:58:31,504 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aee69f990ab81a58f1fe8cd275c8a09f43ca6a442f73810f885d3d0c9a85d2b3 [2024-10-10 21:58:31,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 21:58:31,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 21:58:31,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 21:58:31,851 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 21:58:31,852 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 21:58:31,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum05.i [2024-10-10 21:58:33,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 21:58:33,492 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 21:58:33,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum05.i [2024-10-10 21:58:33,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/92fa06bbd/c78411dfcb164542a46abd742b6f7560/FLAG2028c37dd [2024-10-10 21:58:33,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/92fa06bbd/c78411dfcb164542a46abd742b6f7560 [2024-10-10 21:58:33,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 21:58:33,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 21:58:33,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 21:58:33,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 21:58:33,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 21:58:33,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 09:58:33" (1/1) ... [2024-10-10 21:58:33,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dbc2e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:33, skipping insertion in model container [2024-10-10 21:58:33,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 09:58:33" (1/1) ... [2024-10-10 21:58:33,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 21:58:33,753 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum05.i[1457,1470] [2024-10-10 21:58:33,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 21:58:33,769 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 21:58:33,788 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum05.i[1457,1470] [2024-10-10 21:58:33,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 21:58:33,806 INFO L204 MainTranslator]: Completed translation [2024-10-10 21:58:33,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:33 WrapperNode [2024-10-10 21:58:33,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 21:58:33,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 21:58:33,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 21:58:33,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 21:58:33,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:33" (1/1) ... [2024-10-10 21:58:33,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:33" (1/1) ... [2024-10-10 21:58:33,848 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2024-10-10 21:58:33,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 21:58:33,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 21:58:33,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 21:58:33,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 21:58:33,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:33" (1/1) ... [2024-10-10 21:58:33,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:33" (1/1) ... [2024-10-10 21:58:33,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:33" (1/1) ... [2024-10-10 21:58:33,898 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-10-10 21:58:33,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:33" (1/1) ... [2024-10-10 21:58:33,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:33" (1/1) ... [2024-10-10 21:58:33,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:33" (1/1) ... [2024-10-10 21:58:33,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:33" (1/1) ... [2024-10-10 21:58:33,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:33" (1/1) ... [2024-10-10 21:58:33,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:33" (1/1) ... [2024-10-10 21:58:33,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 21:58:33,932 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 21:58:33,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 21:58:33,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 21:58:33,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:33" (1/1) ... [2024-10-10 21:58:33,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 21:58:33,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:33,982 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 21:58:33,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 21:58:34,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 21:58:34,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 21:58:34,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 21:58:34,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 21:58:34,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 21:58:34,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 21:58:34,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 21:58:34,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 21:58:34,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 21:58:34,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 21:58:34,035 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-10-10 21:58:34,035 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-10-10 21:58:34,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 21:58:34,111 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 21:58:34,113 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 21:58:34,314 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-10 21:58:34,314 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 21:58:34,344 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 21:58:34,345 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-10 21:58:34,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 09:58:34 BoogieIcfgContainer [2024-10-10 21:58:34,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 21:58:34,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 21:58:34,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 21:58:34,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 21:58:34,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 09:58:33" (1/3) ... [2024-10-10 21:58:34,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4c3c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 09:58:34, skipping insertion in model container [2024-10-10 21:58:34,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:33" (2/3) ... [2024-10-10 21:58:34,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4c3c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 09:58:34, skipping insertion in model container [2024-10-10 21:58:34,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 09:58:34" (3/3) ... [2024-10-10 21:58:34,354 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum05.i [2024-10-10 21:58:34,369 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 21:58:34,370 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 21:58:34,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 21:58:34,426 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;@29153fce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 21:58:34,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 21:58:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:58:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-10 21:58:34,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:34,436 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:34,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:34,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:34,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1502132506, now seen corresponding path program 1 times [2024-10-10 21:58:34,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:34,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717514284] [2024-10-10 21:58:34,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:34,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:34,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-10 21:58:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:34,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-10 21:58:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:34,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 21:58:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 21:58:34,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:34,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717514284] [2024-10-10 21:58:34,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717514284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:34,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 21:58:34,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 21:58:34,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464565278] [2024-10-10 21:58:34,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:34,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 21:58:34,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:34,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 21:58:34,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 21:58:34,815 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 21:58:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:34,865 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2024-10-10 21:58:34,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 21:58:34,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-10-10 21:58:34,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:34,875 INFO L225 Difference]: With dead ends: 45 [2024-10-10 21:58:34,875 INFO L226 Difference]: Without dead ends: 22 [2024-10-10 21:58:34,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-10-10 21:58:34,881 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:34,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-10 21:58:34,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-10 21:58:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:58:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-10 21:58:34,921 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 28 [2024-10-10 21:58:34,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:34,922 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-10 21:58:34,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 21:58:34,923 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-10-10 21:58:34,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-10 21:58:34,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:34,926 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:34,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 21:58:34,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:34,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:34,927 INFO L85 PathProgramCache]: Analyzing trace with hash -432814053, now seen corresponding path program 1 times [2024-10-10 21:58:34,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:34,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834255964] [2024-10-10 21:58:34,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:34,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-10 21:58:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-10 21:58:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-10 21:58:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-10 21:58:35,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:35,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834255964] [2024-10-10 21:58:35,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834255964] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:35,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892286388] [2024-10-10 21:58:35,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:35,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:35,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:35,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:35,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 21:58:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 21:58:35,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 21:58:35,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 21:58:35,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892286388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:35,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 21:58:35,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-10-10 21:58:35,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29133106] [2024-10-10 21:58:35,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:35,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 21:58:35,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:35,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 21:58:35,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 21:58:35,331 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:58:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:35,370 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2024-10-10 21:58:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 21:58:35,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-10-10 21:58:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:35,372 INFO L225 Difference]: With dead ends: 42 [2024-10-10 21:58:35,372 INFO L226 Difference]: Without dead ends: 25 [2024-10-10 21:58:35,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 21:58:35,374 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:35,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:35,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-10 21:58:35,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-10-10 21:58:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:58:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-10 21:58:35,387 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 29 [2024-10-10 21:58:35,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:35,388 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-10 21:58:35,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:58:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-10-10 21:58:35,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 21:58:35,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:35,391 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:35,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 21:58:35,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:35,592 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:35,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:35,593 INFO L85 PathProgramCache]: Analyzing trace with hash 28977858, now seen corresponding path program 1 times [2024-10-10 21:58:35,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:35,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122768578] [2024-10-10 21:58:35,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:35,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-10 21:58:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-10 21:58:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-10 21:58:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-10 21:58:35,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:35,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122768578] [2024-10-10 21:58:35,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122768578] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:35,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877368949] [2024-10-10 21:58:35,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:35,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:35,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:35,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:35,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 21:58:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:35,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 21:58:35,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 21:58:35,939 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 21:58:35,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877368949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:35,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 21:58:35,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 21:58:35,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467271616] [2024-10-10 21:58:35,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:35,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 21:58:35,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:35,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 21:58:35,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 21:58:35,945 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:58:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:35,962 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-10-10 21:58:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 21:58:35,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-10 21:58:35,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:35,964 INFO L225 Difference]: With dead ends: 40 [2024-10-10 21:58:35,965 INFO L226 Difference]: Without dead ends: 25 [2024-10-10 21:58:35,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 21:58:35,966 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:35,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:35,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-10 21:58:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-10 21:58:35,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:58:35,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-10-10 21:58:35,976 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 38 [2024-10-10 21:58:35,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:35,978 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-10-10 21:58:35,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:58:35,978 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-10-10 21:58:35,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-10 21:58:35,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:35,980 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:35,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 21:58:36,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:36,185 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:36,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:36,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2098863663, now seen corresponding path program 1 times [2024-10-10 21:58:36,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:36,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14812316] [2024-10-10 21:58:36,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:36,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-10 21:58:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-10 21:58:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-10 21:58:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 21:58:36,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:36,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14812316] [2024-10-10 21:58:36,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14812316] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:36,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943881142] [2024-10-10 21:58:36,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:36,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:36,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:36,307 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:36,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 21:58:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 21:58:36,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-10 21:58:36,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 21:58:36,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943881142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:36,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 21:58:36,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 21:58:36,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447681860] [2024-10-10 21:58:36,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:36,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 21:58:36,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:36,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 21:58:36,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 21:58:36,417 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:58:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:36,438 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2024-10-10 21:58:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 21:58:36,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-10-10 21:58:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:36,440 INFO L225 Difference]: With dead ends: 49 [2024-10-10 21:58:36,441 INFO L226 Difference]: Without dead ends: 29 [2024-10-10 21:58:36,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 21:58:36,443 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:36,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-10 21:58:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-10 21:58:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:58:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-10-10 21:58:36,453 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 39 [2024-10-10 21:58:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:36,454 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-10-10 21:58:36,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:58:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-10-10 21:58:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-10 21:58:36,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:36,457 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:36,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 21:58:36,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:36,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:36,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:36,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1976122640, now seen corresponding path program 1 times [2024-10-10 21:58:36,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:36,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817702386] [2024-10-10 21:58:36,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:36,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-10 21:58:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-10 21:58:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-10 21:58:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 21:58:36,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:36,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817702386] [2024-10-10 21:58:36,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817702386] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:36,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577219148] [2024-10-10 21:58:36,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:36,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:36,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:36,737 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:36,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 21:58:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:36,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 21:58:36,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 21:58:36,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 21:58:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577219148] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:36,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:36,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2024-10-10 21:58:36,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869660902] [2024-10-10 21:58:36,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:36,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 21:58:36,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:36,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 21:58:36,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 21:58:36,906 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-10 21:58:36,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:36,933 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2024-10-10 21:58:36,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 21:58:36,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2024-10-10 21:58:36,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:36,937 INFO L225 Difference]: With dead ends: 58 [2024-10-10 21:58:36,937 INFO L226 Difference]: Without dead ends: 32 [2024-10-10 21:58:36,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 21:58:36,938 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:36,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:36,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-10 21:58:36,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-10 21:58:36,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:58:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-10-10 21:58:36,947 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 39 [2024-10-10 21:58:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:36,949 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-10 21:58:36,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-10 21:58:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-10-10 21:58:36,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 21:58:36,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:36,950 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:36,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 21:58:37,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:37,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:37,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash -71399842, now seen corresponding path program 2 times [2024-10-10 21:58:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:37,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161963852] [2024-10-10 21:58:37,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:37,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:37,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 21:58:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:37,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 21:58:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:37,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-10 21:58:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:37,222 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 21:58:37,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:37,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161963852] [2024-10-10 21:58:37,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161963852] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:37,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162512134] [2024-10-10 21:58:37,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 21:58:37,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:37,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:37,225 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:37,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 21:58:37,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 21:58:37,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 21:58:37,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 21:58:37,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 21:58:37,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 21:58:37,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162512134] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:37,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:37,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 7] total 9 [2024-10-10 21:58:37,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848951622] [2024-10-10 21:58:37,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:37,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 21:58:37,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:37,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 21:58:37,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-10 21:58:37,460 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-10 21:58:37,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:37,519 INFO L93 Difference]: Finished difference Result 63 states and 84 transitions. [2024-10-10 21:58:37,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 21:58:37,521 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2024-10-10 21:58:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:37,521 INFO L225 Difference]: With dead ends: 63 [2024-10-10 21:58:37,522 INFO L226 Difference]: Without dead ends: 37 [2024-10-10 21:58:37,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-10 21:58:37,523 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:37,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 114 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:37,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-10 21:58:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-10-10 21:58:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:58:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-10-10 21:58:37,532 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 42 [2024-10-10 21:58:37,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:37,534 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-10 21:58:37,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-10 21:58:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-10-10 21:58:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-10 21:58:37,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:37,537 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:37,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 21:58:37,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:37,738 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:37,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:37,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1402925949, now seen corresponding path program 3 times [2024-10-10 21:58:37,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:37,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736571639] [2024-10-10 21:58:37,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:37,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:37,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-10 21:58:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:37,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-10 21:58:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:37,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-10 21:58:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-10 21:58:37,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:37,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736571639] [2024-10-10 21:58:37,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736571639] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:37,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173935975] [2024-10-10 21:58:37,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 21:58:37,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:37,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:37,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:37,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 21:58:37,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-10 21:58:37,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 21:58:37,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 21:58:37,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-10 21:58:37,901 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 21:58:37,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173935975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:37,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 21:58:37,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-10-10 21:58:37,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218776841] [2024-10-10 21:58:37,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:37,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 21:58:37,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:37,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 21:58:37,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 21:58:37,903 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 21:58:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:37,927 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-10-10 21:58:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 21:58:37,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-10-10 21:58:37,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:37,929 INFO L225 Difference]: With dead ends: 66 [2024-10-10 21:58:37,929 INFO L226 Difference]: Without dead ends: 39 [2024-10-10 21:58:37,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 21:58:37,930 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:37,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 56 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:37,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-10 21:58:37,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2024-10-10 21:58:37,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:58:37,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-10-10 21:58:37,935 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 52 [2024-10-10 21:58:37,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:37,935 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-10-10 21:58:37,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 21:58:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-10-10 21:58:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-10 21:58:37,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:37,937 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 6, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:37,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-10 21:58:38,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-10 21:58:38,141 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:38,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:38,142 INFO L85 PathProgramCache]: Analyzing trace with hash 608273425, now seen corresponding path program 1 times [2024-10-10 21:58:38,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:38,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231666526] [2024-10-10 21:58:38,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:38,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:38,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-10 21:58:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:38,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-10 21:58:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:38,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-10 21:58:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-10-10 21:58:38,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:38,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231666526] [2024-10-10 21:58:38,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231666526] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:38,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332271238] [2024-10-10 21:58:38,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:38,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:38,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:38,252 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:38,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 21:58:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:38,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 21:58:38,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-10 21:58:38,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-10 21:58:38,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332271238] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:38,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:38,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 7 [2024-10-10 21:58:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978419549] [2024-10-10 21:58:38,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:38,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 21:58:38,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:38,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 21:58:38,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 21:58:38,423 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-10 21:58:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:38,467 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2024-10-10 21:58:38,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 21:58:38,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2024-10-10 21:58:38,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:38,469 INFO L225 Difference]: With dead ends: 63 [2024-10-10 21:58:38,469 INFO L226 Difference]: Without dead ends: 38 [2024-10-10 21:58:38,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 21:58:38,470 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:38,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:38,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-10 21:58:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-10 21:58:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:58:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-10-10 21:58:38,475 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 61 [2024-10-10 21:58:38,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:38,476 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-10 21:58:38,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-10 21:58:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-10-10 21:58:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-10 21:58:38,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:38,477 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:38,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-10 21:58:38,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:38,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:38,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:38,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1467560057, now seen corresponding path program 2 times [2024-10-10 21:58:38,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:38,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195839350] [2024-10-10 21:58:38,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:38,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:38,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-10 21:58:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:38,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-10 21:58:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:38,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-10 21:58:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-10 21:58:38,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:38,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195839350] [2024-10-10 21:58:38,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195839350] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:38,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283034917] [2024-10-10 21:58:38,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 21:58:38,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:38,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:38,828 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:38,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 21:58:38,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 21:58:38,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 21:58:38,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 21:58:38,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 116 proven. 22 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-10-10 21:58:38,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-10-10 21:58:39,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283034917] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:39,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:39,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 10 [2024-10-10 21:58:39,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509522205] [2024-10-10 21:58:39,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:39,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 21:58:39,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:39,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 21:58:39,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-10 21:58:39,050 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-10 21:58:39,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:39,098 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2024-10-10 21:58:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 21:58:39,099 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2024-10-10 21:58:39,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:39,100 INFO L225 Difference]: With dead ends: 71 [2024-10-10 21:58:39,101 INFO L226 Difference]: Without dead ends: 42 [2024-10-10 21:58:39,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-10 21:58:39,103 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:39,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 73 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-10 21:58:39,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-10 21:58:39,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:58:39,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-10-10 21:58:39,113 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 71 [2024-10-10 21:58:39,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:39,114 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-10-10 21:58:39,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-10 21:58:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-10-10 21:58:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-10 21:58:39,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:39,117 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 9, 6, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:39,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-10 21:58:39,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:39,318 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:39,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1445518479, now seen corresponding path program 3 times [2024-10-10 21:58:39,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:39,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885727312] [2024-10-10 21:58:39,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:39,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:39,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-10 21:58:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:39,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-10 21:58:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:39,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-10 21:58:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-10-10 21:58:39,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:39,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885727312] [2024-10-10 21:58:39,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885727312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:39,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334054750] [2024-10-10 21:58:39,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 21:58:39,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:39,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:39,485 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:39,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-10 21:58:39,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-10 21:58:39,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 21:58:39,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 21:58:39,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 180 proven. 6 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-10-10 21:58:39,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-10-10 21:58:39,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334054750] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:39,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:39,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-10-10 21:58:39,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267773085] [2024-10-10 21:58:39,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:39,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 21:58:39,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:39,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 21:58:39,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 21:58:39,663 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 21:58:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:39,677 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2024-10-10 21:58:39,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 21:58:39,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 81 [2024-10-10 21:58:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:39,678 INFO L225 Difference]: With dead ends: 69 [2024-10-10 21:58:39,678 INFO L226 Difference]: Without dead ends: 43 [2024-10-10 21:58:39,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 163 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 21:58:39,679 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:39,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:39,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-10 21:58:39,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-10 21:58:39,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 21:58:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-10-10 21:58:39,684 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 81 [2024-10-10 21:58:39,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:39,684 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-10 21:58:39,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 21:58:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-10-10 21:58:39,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-10 21:58:39,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:39,686 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 9, 6, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:39,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-10 21:58:39,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:39,887 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:39,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash 545495682, now seen corresponding path program 4 times [2024-10-10 21:58:39,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:39,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634122811] [2024-10-10 21:58:39,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:39,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-10 21:58:40,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911198150] [2024-10-10 21:58:40,046 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-10 21:58:40,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:40,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:40,048 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:40,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-10 21:58:40,212 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-10 21:58:40,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-10 21:58:40,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-10 21:58:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 21:58:40,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-10 21:58:40,391 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-10 21:58:40,392 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 21:58:40,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-10 21:58:40,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 21:58:40,597 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2024-10-10 21:58:40,663 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 21:58:40,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 09:58:40 BoogieIcfgContainer [2024-10-10 21:58:40,668 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 21:58:40,668 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 21:58:40,668 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 21:58:40,669 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 21:58:40,669 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 09:58:34" (3/4) ... [2024-10-10 21:58:40,670 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-10 21:58:40,769 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 21:58:40,769 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 21:58:40,770 INFO L158 Benchmark]: Toolchain (without parser) took 7251.21ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 123.0MB in the beginning and 92.8MB in the end (delta: 30.2MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2024-10-10 21:58:40,770 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory was 76.9MB in the beginning and 76.7MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 21:58:40,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.95ms. Allocated memory is still 153.1MB. Free memory was 122.1MB in the beginning and 109.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 21:58:40,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.08ms. Allocated memory is still 153.1MB. Free memory was 109.6MB in the beginning and 108.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 21:58:40,771 INFO L158 Benchmark]: Boogie Preprocessor took 82.26ms. Allocated memory is still 153.1MB. Free memory was 108.5MB in the beginning and 106.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 21:58:40,771 INFO L158 Benchmark]: RCFGBuilder took 413.42ms. Allocated memory is still 153.1MB. Free memory was 106.4MB in the beginning and 118.0MB in the end (delta: -11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 21:58:40,771 INFO L158 Benchmark]: TraceAbstraction took 6320.78ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 116.9MB in the beginning and 98.2MB in the end (delta: 18.7MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2024-10-10 21:58:40,772 INFO L158 Benchmark]: Witness Printer took 101.01ms. Allocated memory is still 184.5MB. Free memory was 98.2MB in the beginning and 92.8MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 21:58:40,773 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.20ms. Allocated memory is still 104.9MB. Free memory was 76.9MB in the beginning and 76.7MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.95ms. Allocated memory is still 153.1MB. Free memory was 122.1MB in the beginning and 109.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.08ms. Allocated memory is still 153.1MB. Free memory was 109.6MB in the beginning and 108.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.26ms. Allocated memory is still 153.1MB. Free memory was 108.5MB in the beginning and 106.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 413.42ms. Allocated memory is still 153.1MB. Free memory was 106.4MB in the beginning and 118.0MB in the end (delta: -11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6320.78ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 116.9MB in the beginning and 98.2MB in the end (delta: 18.7MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. * Witness Printer took 101.01ms. Allocated memory is still 184.5MB. Free memory was 98.2MB in the beginning and 92.8MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[5]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={3:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}] [L17] COND TRUE i < 5 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}] [L17] COND FALSE !(i < 5) VAL [x={3:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=3, ret=-3, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=4, ret=-3, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=1, i=4, ret=-3, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=4, ret=-1, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=5, ret=-1, x={3:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={3:0}, cnt=2, ret=-1, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=0, x={3:0}] [L49] RET, EXPR rangesum(x) VAL [x={3:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp [L52] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=3, ret=-3, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=4, ret=-3, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=1, i=4, ret=-3, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=4, ret=-1, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=5, ret=-1, x={3:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={3:0}, cnt=2, ret=-1, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=0, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [ret=0, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=0, ret=0, temp=1, x={3:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=0, ret=0, temp=1, x={3:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=0, ret=0, temp=1, x={3:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=0, ret=0, temp=1, x={3:0}] [L54] COND TRUE i<5 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=0, ret=0, temp=1, x={3:0}] [L54] COND FALSE !(i<5 -1) VAL [ret2=0, ret=0, temp=1, x={3:0}] [L57] x[5 -1] = temp [L58] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 5/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=3, ret=2, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=4, ret=2, x={3:0}] [L28] COND TRUE i < 5 VAL [\old(x)={3:0}, cnt=1, i=4, ret=2, x={3:0}] [L29] COND TRUE i > 5/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=4, ret=3, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=5, ret=3, x={3:0}] [L28] COND FALSE !(i < 5) VAL [\old(x)={3:0}, cnt=2, ret=3, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=1, x={3:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=0, ret=0, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={3:0}] [L61] reach_error() VAL [x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 583 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 361 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 205 IncrementalHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 222 mSDtfsCounter, 205 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 834 GetRequests, 776 SyntacticMatches, 16 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=10, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1096 NumberOfCodeBlocks, 1033 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1202 ConstructedInterpolants, 0 QuantifiedInterpolants, 1398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1651 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 24 InterpolantComputations, 5 PerfectInterpolantSequences, 2754/3097 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-10 21:58:40,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE