./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/sum01_bug02.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum01_bug02.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 29d100da65e2ae9d5c43d48b49216d155078158e341858baee0b08b697e15c8e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 01:57:33,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:57:33,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:57:33,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:57:33,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:57:33,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:57:33,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:57:33,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:57:33,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:57:33,597 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:57:33,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:57:33,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:57:33,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:57:33,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:57:33,601 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:57:33,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:57:33,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:57:33,602 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:57:33,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:57:33,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:57:33,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:57:33,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:57:33,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:57:33,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:57:33,607 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:57:33,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:57:33,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:57:33,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:57:33,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:57:33,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:57:33,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:57:33,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:57:33,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:57:33,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:57:33,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:57:33,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:57:33,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:57:33,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:57:33,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:57:33,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:57:33,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:57:33,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:57:33,612 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 29d100da65e2ae9d5c43d48b49216d155078158e341858baee0b08b697e15c8e [2024-10-14 01:57:33,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:57:33,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:57:33,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:57:33,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:57:33,912 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:57:33,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum01_bug02.i [2024-10-14 01:57:35,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:57:35,580 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:57:35,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum01_bug02.i [2024-10-14 01:57:35,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd0d10926/24f8b6db72c5489aa7c0d4e9477cafd1/FLAG4fa3594b3 [2024-10-14 01:57:35,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd0d10926/24f8b6db72c5489aa7c0d4e9477cafd1 [2024-10-14 01:57:35,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:57:35,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:57:35,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:57:35,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:57:35,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:57:35,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:57:35" (1/1) ... [2024-10-14 01:57:35,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f2aa10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:57:35, skipping insertion in model container [2024-10-14 01:57:35,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:57:35" (1/1) ... [2024-10-14 01:57:35,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:57:35,832 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/sum01_bug02.i[812,825] [2024-10-14 01:57:35,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:57:35,868 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:57:35,883 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/sum01_bug02.i[812,825] [2024-10-14 01:57:35,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:57:35,907 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:57:35,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:57:35 WrapperNode [2024-10-14 01:57:35,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:57:35,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:57:35,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:57:35,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:57:35,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:57:35" (1/1) ... [2024-10-14 01:57:35,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:57:35" (1/1) ... [2024-10-14 01:57:35,943 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 37 [2024-10-14 01:57:35,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:57:35,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:57:35,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:57:35,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:57:35,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:57:35" (1/1) ... [2024-10-14 01:57:35,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:57:35" (1/1) ... [2024-10-14 01:57:35,957 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:57:35" (1/1) ... [2024-10-14 01:57:36,006 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-14 01:57:36,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:57:35" (1/1) ... [2024-10-14 01:57:36,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:57:35" (1/1) ... [2024-10-14 01:57:36,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:57:35" (1/1) ... [2024-10-14 01:57:36,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:57:35" (1/1) ... [2024-10-14 01:57:36,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:57:35" (1/1) ... [2024-10-14 01:57:36,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:57:35" (1/1) ... [2024-10-14 01:57:36,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:57:36,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:57:36,034 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:57:36,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:57:36,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:57:35" (1/1) ... [2024-10-14 01:57:36,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:57:36,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:57:36,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 01:57:36,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 01:57:36,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:57:36,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:57:36,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:57:36,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:57:36,194 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:57:36,196 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:57:36,310 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-14 01:57:36,311 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:57:36,342 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:57:36,342 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 01:57:36,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:57:36 BoogieIcfgContainer [2024-10-14 01:57:36,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:57:36,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:57:36,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:57:36,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:57:36,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:57:35" (1/3) ... [2024-10-14 01:57:36,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497f09b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:57:36, skipping insertion in model container [2024-10-14 01:57:36,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:57:35" (2/3) ... [2024-10-14 01:57:36,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497f09b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:57:36, skipping insertion in model container [2024-10-14 01:57:36,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:57:36" (3/3) ... [2024-10-14 01:57:36,352 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_bug02.i [2024-10-14 01:57:36,368 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:57:36,368 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:57:36,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:57:36,429 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;@39b04c9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:57:36,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:57:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:57:36,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 01:57:36,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:57:36,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 01:57:36,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:57:36,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:57:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2140513856, now seen corresponding path program 1 times [2024-10-14 01:57:36,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:57:36,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277504111] [2024-10-14 01:57:36,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:57:36,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:57:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:57:36,609 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-14 01:57:36,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:57:36,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277504111] [2024-10-14 01:57:36,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277504111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:57:36,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:57:36,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 01:57:36,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44749239] [2024-10-14 01:57:36,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:57:36,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 01:57:36,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:57:36,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 01:57:36,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 01:57:36,644 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-14 01:57:36,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:57:36,664 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2024-10-14 01:57:36,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 01:57:36,667 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-14 01:57:36,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:57:36,672 INFO L225 Difference]: With dead ends: 19 [2024-10-14 01:57:36,672 INFO L226 Difference]: Without dead ends: 9 [2024-10-14 01:57:36,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 01:57:36,677 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:57:36,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:57:36,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-14 01:57:36,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-10-14 01:57:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:57:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-10-14 01:57:36,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2024-10-14 01:57:36,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:57:36,704 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-10-14 01:57:36,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-14 01:57:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2024-10-14 01:57:36,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 01:57:36,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:57:36,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 01:57:36,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 01:57:36,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:57:36,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:57:36,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2140901139, now seen corresponding path program 1 times [2024-10-14 01:57:36,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:57:36,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861727042] [2024-10-14 01:57:36,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:57:36,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:57:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:57:36,879 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-14 01:57:36,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:57:36,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861727042] [2024-10-14 01:57:36,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861727042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:57:36,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:57:36,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 01:57:36,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513834454] [2024-10-14 01:57:36,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:57:36,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:57:36,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:57:36,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:57:36,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:57:36,883 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. 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-14 01:57:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:57:36,932 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-10-14 01:57:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:57:36,932 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-14 01:57:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:57:36,933 INFO L225 Difference]: With dead ends: 16 [2024-10-14 01:57:36,933 INFO L226 Difference]: Without dead ends: 12 [2024-10-14 01:57:36,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:57:36,935 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:57:36,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 8 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:57:36,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-14 01:57:36,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-14 01:57:36,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:57:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-10-14 01:57:36,943 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2024-10-14 01:57:36,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:57:36,944 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-10-14 01:57:36,944 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-14 01:57:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2024-10-14 01:57:36,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 01:57:36,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:57:36,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:57:36,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 01:57:36,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:57:36,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:57:36,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2117223459, now seen corresponding path program 1 times [2024-10-14 01:57:36,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:57:36,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220578673] [2024-10-14 01:57:36,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:57:36,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:57:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:57:37,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:57:37,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:57:37,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220578673] [2024-10-14 01:57:37,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220578673] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:57:37,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453981234] [2024-10-14 01:57:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:57:37,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:57:37,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:57:37,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:57:37,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 01:57:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:57:37,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 01:57:37,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:57:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:57:37,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:57:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:57:37,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453981234] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:57:37,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:57:37,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-10-14 01:57:37,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704702379] [2024-10-14 01:57:37,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:57:37,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 01:57:37,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:57:37,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 01:57:37,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-10-14 01:57:37,805 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 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-14 01:57:37,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:57:37,972 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-10-14 01:57:37,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 01:57:37,973 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 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 9 [2024-10-14 01:57:37,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:57:37,974 INFO L225 Difference]: With dead ends: 27 [2024-10-14 01:57:37,974 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 01:57:37,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2024-10-14 01:57:37,976 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:57:37,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 21 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:57:37,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 01:57:37,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-10-14 01:57:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:57:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-10-14 01:57:37,981 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2024-10-14 01:57:37,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:57:37,981 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-14 01:57:37,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 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-14 01:57:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-10-14 01:57:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 01:57:37,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:57:37,982 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:57:38,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 01:57:38,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:57:38,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:57:38,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:57:38,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1052836821, now seen corresponding path program 1 times [2024-10-14 01:57:38,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:57:38,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466879204] [2024-10-14 01:57:38,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:57:38,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:57:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:57:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:57:38,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:57:38,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466879204] [2024-10-14 01:57:38,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466879204] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:57:38,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244388150] [2024-10-14 01:57:38,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:57:38,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:57:38,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:57:38,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:57:38,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 01:57:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:57:38,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 01:57:38,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:57:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:57:38,362 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:57:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:57:38,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244388150] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:57:38,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:57:38,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-14 01:57:38,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609892384] [2024-10-14 01:57:38,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:57:38,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 01:57:38,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:57:38,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 01:57:38,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-14 01:57:38,409 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:57:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:57:38,465 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-10-14 01:57:38,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 01:57:38,466 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 01:57:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:57:38,466 INFO L225 Difference]: With dead ends: 31 [2024-10-14 01:57:38,467 INFO L226 Difference]: Without dead ends: 21 [2024-10-14 01:57:38,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-14 01:57:38,468 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:57:38,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 17 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:57:38,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-14 01:57:38,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-10-14 01:57:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-14 01:57:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-10-14 01:57:38,474 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2024-10-14 01:57:38,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:57:38,475 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-10-14 01:57:38,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:57:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-10-14 01:57:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 01:57:38,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:57:38,477 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-10-14 01:57:38,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 01:57:38,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-14 01:57:38,678 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:57:38,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:57:38,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1903600093, now seen corresponding path program 2 times [2024-10-14 01:57:38,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:57:38,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379323756] [2024-10-14 01:57:38,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:57:38,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:57:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:57:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:57:38,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:57:38,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379323756] [2024-10-14 01:57:38,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379323756] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:57:38,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812606028] [2024-10-14 01:57:38,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:57:38,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:57:38,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:57:38,970 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:57:38,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 01:57:39,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:57:39,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:57:39,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 01:57:39,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:57:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:57:39,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:57:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:57:39,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812606028] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:57:39,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:57:39,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 29 [2024-10-14 01:57:39,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971960353] [2024-10-14 01:57:39,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:57:39,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-14 01:57:39,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:57:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-14 01:57:39,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2024-10-14 01:57:39,537 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 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-14 01:57:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:57:39,883 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-10-14 01:57:39,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 01:57:39,883 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 01:57:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:57:39,885 INFO L225 Difference]: With dead ends: 30 [2024-10-14 01:57:39,886 INFO L226 Difference]: Without dead ends: 25 [2024-10-14 01:57:39,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=1381, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 01:57:39,890 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:57:39,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 33 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:57:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-14 01:57:39,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2024-10-14 01:57:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:57:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-10-14 01:57:39,899 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2024-10-14 01:57:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:57:39,900 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-10-14 01:57:39,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 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-14 01:57:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-10-14 01:57:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 01:57:39,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:57:39,901 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:57:39,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 01:57:40,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:57:40,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:57:40,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:57:40,106 INFO L85 PathProgramCache]: Analyzing trace with hash -540755685, now seen corresponding path program 2 times [2024-10-14 01:57:40,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:57:40,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364647789] [2024-10-14 01:57:40,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:57:40,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:57:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:57:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:57:40,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:57:40,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364647789] [2024-10-14 01:57:40,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364647789] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:57:40,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952839133] [2024-10-14 01:57:40,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:57:40,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:57:40,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:57:40,231 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:57:40,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 01:57:40,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:57:40,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:57:40,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 01:57:40,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:57:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:57:40,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:57:40,477 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:57:40,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952839133] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:57:40,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:57:40,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-14 01:57:40,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615813114] [2024-10-14 01:57:40,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:57:40,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 01:57:40,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:57:40,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 01:57:40,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2024-10-14 01:57:40,480 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:57:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:57:40,531 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-10-14 01:57:40,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 01:57:40,532 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 01:57:40,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:57:40,533 INFO L225 Difference]: With dead ends: 35 [2024-10-14 01:57:40,534 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 01:57:40,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2024-10-14 01:57:40,536 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:57:40,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 28 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:57:40,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 01:57:40,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-10-14 01:57:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 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-14 01:57:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-10-14 01:57:40,545 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2024-10-14 01:57:40,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:57:40,546 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-10-14 01:57:40,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:57:40,546 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-10-14 01:57:40,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 01:57:40,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:57:40,547 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:57:40,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 01:57:40,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:57:40,748 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:57:40,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:57:40,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1646145579, now seen corresponding path program 3 times [2024-10-14 01:57:40,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:57:40,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119158311] [2024-10-14 01:57:40,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:57:40,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:57:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 01:57:40,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 01:57:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 01:57:40,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 01:57:40,798 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 01:57:40,799 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 01:57:40,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 01:57:40,805 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2024-10-14 01:57:40,837 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 01:57:40,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 01:57:40 BoogieIcfgContainer [2024-10-14 01:57:40,842 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 01:57:40,843 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 01:57:40,843 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 01:57:40,844 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 01:57:40,844 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:57:36" (3/4) ... [2024-10-14 01:57:40,846 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 01:57:40,889 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 01:57:40,890 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 01:57:40,890 INFO L158 Benchmark]: Toolchain (without parser) took 5276.32ms. Allocated memory was 161.5MB in the beginning and 203.4MB in the end (delta: 41.9MB). Free memory was 94.7MB in the beginning and 157.4MB in the end (delta: -62.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:57:40,891 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 01:57:40,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.99ms. Allocated memory is still 161.5MB. Free memory was 94.5MB in the beginning and 83.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 01:57:40,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.68ms. Allocated memory is still 161.5MB. Free memory was 83.2MB in the beginning and 81.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:57:40,891 INFO L158 Benchmark]: Boogie Preprocessor took 83.33ms. Allocated memory is still 161.5MB. Free memory was 81.7MB in the beginning and 135.8MB in the end (delta: -54.1MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-10-14 01:57:40,892 INFO L158 Benchmark]: RCFGBuilder took 313.20ms. Allocated memory is still 161.5MB. Free memory was 135.8MB in the beginning and 124.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 01:57:40,892 INFO L158 Benchmark]: TraceAbstraction took 4497.31ms. Allocated memory was 161.5MB in the beginning and 203.4MB in the end (delta: 41.9MB). Free memory was 124.1MB in the beginning and 159.5MB in the end (delta: -35.4MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-10-14 01:57:40,892 INFO L158 Benchmark]: Witness Printer took 47.03ms. Allocated memory is still 203.4MB. Free memory was 159.5MB in the beginning and 157.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 01:57:40,894 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.15ms. Allocated memory is still 104.9MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.99ms. Allocated memory is still 161.5MB. Free memory was 94.5MB in the beginning and 83.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.68ms. Allocated memory is still 161.5MB. Free memory was 83.2MB in the beginning and 81.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.33ms. Allocated memory is still 161.5MB. Free memory was 81.7MB in the beginning and 135.8MB in the end (delta: -54.1MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * RCFGBuilder took 313.20ms. Allocated memory is still 161.5MB. Free memory was 135.8MB in the beginning and 124.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4497.31ms. Allocated memory was 161.5MB in the beginning and 203.4MB in the end (delta: 41.9MB). Free memory was 124.1MB in the beginning and 159.5MB in the end (delta: -35.4MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Witness Printer took 47.03ms. Allocated memory is still 203.4MB. Free memory was 159.5MB in the beginning and 157.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; VAL [j=10, n=6, sn=0] [L24] COND FALSE !(n==2147483647) [L27] i=1 VAL [i=1, j=10, n=6, sn=0] [L27] COND TRUE i<=n VAL [i=1, j=10, n=6, sn=0] [L28] COND TRUE i