./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum03-1.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/loops/sum03-1.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 fe7be15075ce01a2506fca5f00f42200a3ccb6fbddb1902e9169c6afecb0edfe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:47:55,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:47:55,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:47:55,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:47:55,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:47:55,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:47:55,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:47:55,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:47:55,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:47:55,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:47:55,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:47:55,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:47:55,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:47:55,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:47:55,337 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:47:55,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:47:55,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:47:55,338 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:47:55,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:47:55,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:47:55,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:47:55,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:47:55,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:47:55,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:47:55,339 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:47:55,340 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:47:55,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:47:55,340 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:47:55,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:47:55,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:47:55,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:47:55,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:47:55,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:47:55,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:47:55,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:47:55,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:47:55,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:47:55,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:47:55,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:47:55,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:47:55,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:47:55,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:47:55,343 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 -> fe7be15075ce01a2506fca5f00f42200a3ccb6fbddb1902e9169c6afecb0edfe [2024-10-11 01:47:55,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:47:55,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:47:55,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:47:55,563 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:47:55,563 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:47:55,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum03-1.i [2024-10-11 01:47:56,804 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:47:56,963 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:47:56,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum03-1.i [2024-10-11 01:47:56,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c1205d1f2/7c2ef6e8773d43be937c90a7e274730b/FLAGb8bd40bff [2024-10-11 01:47:56,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c1205d1f2/7c2ef6e8773d43be937c90a7e274730b [2024-10-11 01:47:56,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:47:56,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:47:56,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:47:56,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:47:56,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:47:56,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:47:56" (1/1) ... [2024-10-11 01:47:56,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b27411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:56, skipping insertion in model container [2024-10-11 01:47:56,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:47:56" (1/1) ... [2024-10-11 01:47:57,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:47:57,147 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/loops/sum03-1.i[807,820] [2024-10-11 01:47:57,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:47:57,168 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:47:57,176 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/loops/sum03-1.i[807,820] [2024-10-11 01:47:57,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:47:57,189 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:47:57,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:57 WrapperNode [2024-10-11 01:47:57,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:47:57,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:47:57,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:47:57,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:47:57,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:57" (1/1) ... [2024-10-11 01:47:57,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:57" (1/1) ... [2024-10-11 01:47:57,212 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2024-10-11 01:47:57,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:47:57,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:47:57,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:47:57,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:47:57,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:57" (1/1) ... [2024-10-11 01:47:57,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:57" (1/1) ... [2024-10-11 01:47:57,222 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:57" (1/1) ... [2024-10-11 01:47:57,229 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 01:47:57,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:57" (1/1) ... [2024-10-11 01:47:57,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:57" (1/1) ... [2024-10-11 01:47:57,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:57" (1/1) ... [2024-10-11 01:47:57,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:57" (1/1) ... [2024-10-11 01:47:57,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:57" (1/1) ... [2024-10-11 01:47:57,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:57" (1/1) ... [2024-10-11 01:47:57,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:47:57,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:47:57,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:47:57,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:47:57,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:57" (1/1) ... [2024-10-11 01:47:57,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:47:57,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:47:57,267 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-11 01:47:57,270 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-11 01:47:57,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:47:57,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:47:57,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:47:57,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:47:57,352 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:47:57,355 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:47:57,453 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-11 01:47:57,453 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:47:57,470 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:47:57,481 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 01:47:57,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:47:57 BoogieIcfgContainer [2024-10-11 01:47:57,482 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:47:57,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:47:57,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:47:57,486 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:47:57,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:47:56" (1/3) ... [2024-10-11 01:47:57,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651a973d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:47:57, skipping insertion in model container [2024-10-11 01:47:57,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:57" (2/3) ... [2024-10-11 01:47:57,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651a973d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:47:57, skipping insertion in model container [2024-10-11 01:47:57,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:47:57" (3/3) ... [2024-10-11 01:47:57,489 INFO L112 eAbstractionObserver]: Analyzing ICFG sum03-1.i [2024-10-11 01:47:57,502 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:47:57,502 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:47:57,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:47:57,551 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;@55b866c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:47:57,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:47:57,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:47:57,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 01:47:57,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:47:57,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 01:47:57,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:47:57,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:47:57,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1900177325, now seen corresponding path program 1 times [2024-10-11 01:47:57,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:47:57,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959222074] [2024-10-11 01:47:57,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:57,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:47:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:57,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:47:57,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959222074] [2024-10-11 01:47:57,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959222074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:47:57,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:47:57,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:47:57,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882261504] [2024-10-11 01:47:57,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:47:57,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:47:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:47:57,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:47:57,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:47:57,822 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:47:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:47:57,869 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2024-10-11 01:47:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:47:57,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 01:47:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:47:57,877 INFO L225 Difference]: With dead ends: 22 [2024-10-11 01:47:57,877 INFO L226 Difference]: Without dead ends: 13 [2024-10-11 01:47:57,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:47:57,882 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:47:57,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:47:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-11 01:47:57,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-11 01:47:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:47:57,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-10-11 01:47:57,912 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 6 [2024-10-11 01:47:57,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:47:57,913 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-10-11 01:47:57,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:47:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-10-11 01:47:57,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 01:47:57,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:47:57,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 01:47:57,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:47:57,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:47:57,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:47:57,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1900117743, now seen corresponding path program 1 times [2024-10-11 01:47:57,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:47:57,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557378953] [2024-10-11 01:47:57,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:47:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:58,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:47:58,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557378953] [2024-10-11 01:47:58,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557378953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:47:58,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:47:58,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:47:58,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262437410] [2024-10-11 01:47:58,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:47:58,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:47:58,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:47:58,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:47:58,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:47:58,166 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:47:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:47:58,191 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-10-11 01:47:58,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:47:58,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 01:47:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:47:58,194 INFO L225 Difference]: With dead ends: 24 [2024-10-11 01:47:58,194 INFO L226 Difference]: Without dead ends: 12 [2024-10-11 01:47:58,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:47:58,195 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:47:58,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:47:58,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-11 01:47:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-11 01:47:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:47:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-10-11 01:47:58,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 6 [2024-10-11 01:47:58,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:47:58,203 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-10-11 01:47:58,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:47:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-10-11 01:47:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 01:47:58,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:47:58,203 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:47:58,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:47:58,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:47:58,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:47:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash -583907041, now seen corresponding path program 1 times [2024-10-11 01:47:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:47:58,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110648685] [2024-10-11 01:47:58,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:58,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:47:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:58,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:58,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:47:58,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110648685] [2024-10-11 01:47:58,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110648685] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:47:58,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149503902] [2024-10-11 01:47:58,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:58,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:47:58,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:47:58,318 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-11 01:47:58,319 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-11 01:47:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:58,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 01:47:58,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:47:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:58,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:47:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:58,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149503902] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:47:58,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:47:58,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 01:47:58,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045389803] [2024-10-11 01:47:58,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:47:58,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:47:58,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:47:58,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:47:58,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:47:58,450 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:47:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:47:58,491 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-10-11 01:47:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:47:58,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 01:47:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:47:58,492 INFO L225 Difference]: With dead ends: 37 [2024-10-11 01:47:58,492 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 01:47:58,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:47:58,494 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:47:58,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 26 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:47:58,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 01:47:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-10-11 01:47:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:47:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-10-11 01:47:58,499 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2024-10-11 01:47:58,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:47:58,499 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-10-11 01:47:58,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:47:58,500 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-10-11 01:47:58,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 01:47:58,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:47:58,500 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 01:47:58,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:47:58,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:47:58,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:47:58,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:47:58,705 INFO L85 PathProgramCache]: Analyzing trace with hash -583966623, now seen corresponding path program 1 times [2024-10-11 01:47:58,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:47:58,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629549722] [2024-10-11 01:47:58,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:58,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:47:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:59,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:47:59,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629549722] [2024-10-11 01:47:59,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629549722] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:47:59,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173229380] [2024-10-11 01:47:59,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:59,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:47:59,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:47:59,012 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-11 01:47:59,014 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-11 01:47:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:59,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 01:47:59,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:47:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:59,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:47:59,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:59,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173229380] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:47:59,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:47:59,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2024-10-11 01:47:59,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685635854] [2024-10-11 01:47:59,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:47:59,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 01:47:59,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:47:59,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 01:47:59,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-10-11 01:47:59,452 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:47:59,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:47:59,619 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-10-11 01:47:59,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 01:47:59,620 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 01:47:59,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:47:59,620 INFO L225 Difference]: With dead ends: 33 [2024-10-11 01:47:59,620 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 01:47:59,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2024-10-11 01:47:59,621 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:47:59,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 33 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:47:59,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 01:47:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-10-11 01:47:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:47:59,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-10-11 01:47:59,632 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 11 [2024-10-11 01:47:59,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:47:59,632 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-10-11 01:47:59,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:47:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-10-11 01:47:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 01:47:59,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:47:59,634 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1] [2024-10-11 01:47:59,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 01:47:59,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:47:59,838 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:47:59,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:47:59,838 INFO L85 PathProgramCache]: Analyzing trace with hash 517506605, now seen corresponding path program 2 times [2024-10-11 01:47:59,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:47:59,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78823160] [2024-10-11 01:47:59,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:47:59,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:47:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:47:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:47:59,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:47:59,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78823160] [2024-10-11 01:47:59,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78823160] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:47:59,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827305881] [2024-10-11 01:47:59,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:47:59,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:47:59,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:47:59,924 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-11 01:47:59,926 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-11 01:47:59,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:47:59,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:47:59,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 01:47:59,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:48:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:48:00,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:48:00,100 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:48:00,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827305881] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:48:00,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:48:00,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-11 01:48:00,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211722303] [2024-10-11 01:48:00,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:48:00,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 01:48:00,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:48:00,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 01:48:00,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-10-11 01:48:00,102 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:48:00,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:48:00,270 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2024-10-11 01:48:00,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 01:48:00,271 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 01:48:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:48:00,272 INFO L225 Difference]: With dead ends: 68 [2024-10-11 01:48:00,272 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 01:48:00,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2024-10-11 01:48:00,273 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:48:00,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 96 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:48:00,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 01:48:00,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-10-11 01:48:00,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:48:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2024-10-11 01:48:00,281 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 26 [2024-10-11 01:48:00,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:48:00,281 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2024-10-11 01:48:00,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:48:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2024-10-11 01:48:00,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 01:48:00,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:48:00,282 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1] [2024-10-11 01:48:00,295 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-11 01:48:00,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:48:00,487 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:48:00,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:48:00,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1411171347, now seen corresponding path program 3 times [2024-10-11 01:48:00,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:48:00,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330843678] [2024-10-11 01:48:00,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:48:00,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:48:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 01:48:00,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 01:48:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 01:48:00,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 01:48:00,609 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 01:48:00,611 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 01:48:00,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 01:48:00,616 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-10-11 01:48:00,638 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 01:48:00,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:48:00 BoogieIcfgContainer [2024-10-11 01:48:00,642 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 01:48:00,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 01:48:00,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 01:48:00,642 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 01:48:00,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:47:57" (3/4) ... [2024-10-11 01:48:00,644 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 01:48:00,696 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 01:48:00,696 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 01:48:00,696 INFO L158 Benchmark]: Toolchain (without parser) took 3706.83ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 73.9MB in the beginning and 74.2MB in the end (delta: -298.4kB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. [2024-10-11 01:48:00,697 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 144.7MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 01:48:00,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.02ms. Allocated memory is still 144.7MB. Free memory was 73.7MB in the beginning and 61.9MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 01:48:00,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.19ms. Allocated memory is still 144.7MB. Free memory was 61.7MB in the beginning and 60.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:48:00,697 INFO L158 Benchmark]: Boogie Preprocessor took 21.69ms. Allocated memory is still 144.7MB. Free memory was 60.4MB in the beginning and 58.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:48:00,697 INFO L158 Benchmark]: RCFGBuilder took 246.40ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 58.7MB in the beginning and 179.3MB in the end (delta: -120.6MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-10-11 01:48:00,698 INFO L158 Benchmark]: TraceAbstraction took 3158.23ms. Allocated memory is still 207.6MB. Free memory was 179.3MB in the beginning and 77.3MB in the end (delta: 102.0MB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. [2024-10-11 01:48:00,698 INFO L158 Benchmark]: Witness Printer took 53.74ms. Allocated memory is still 207.6MB. Free memory was 77.3MB in the beginning and 74.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 01:48:00,699 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.19ms. Allocated memory is still 144.7MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.02ms. Allocated memory is still 144.7MB. Free memory was 73.7MB in the beginning and 61.9MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.19ms. Allocated memory is still 144.7MB. Free memory was 61.7MB in the beginning and 60.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.69ms. Allocated memory is still 144.7MB. Free memory was 60.4MB in the beginning and 58.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 246.40ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 58.7MB in the beginning and 179.3MB in the end (delta: -120.6MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3158.23ms. Allocated memory is still 207.6MB. Free memory was 179.3MB in the beginning and 77.3MB in the end (delta: 102.0MB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. * Witness Printer took 53.74ms. Allocated memory is still 207.6MB. Free memory was 77.3MB in the beginning and 74.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int sn=0; [L22] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L22] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L23] unsigned int x=0; VAL [sn=0, x=0] [L24] COND TRUE 1 VAL [sn=0, x=0] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=2, x=0] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=2, x=1] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=4, x=1] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=4, x=2] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=6, x=2] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=6, x=3] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=8, x=3] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=8, x=4] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=10, x=4] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=10, x=5] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=12, x=5] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=12, x=6] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=14, x=6] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=14, x=7] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=16, x=7] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=16, x=8] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=18, x=8] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=18, x=9] [L25] COND TRUE x<10 [L26] sn = sn + (2) VAL [sn=20, x=9] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND FALSE !(!(cond)) [L29] RET __VERIFIER_assert(sn==x*(2) || sn == 0) [L24] COND TRUE 1 VAL [sn=20, x=10] [L25] COND FALSE !(x<10) VAL [sn=20, x=10] [L28] x++ [L29] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) [L14] COND TRUE !(cond) [L15] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 185 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 38 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=5, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 782 SizeOfPredicates, 2 NumberOfNonLiveVariables, 170 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 30/162 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-11 01:48:00,723 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