./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.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 7566a205875353a7a53577ca4c9ca94a9d2d53458c01e4aa6bab26ab44feec5a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:27:20,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:27:20,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:27:20,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:27:20,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:27:20,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:27:20,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:27:20,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:27:20,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:27:20,688 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:27:20,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:27:20,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:27:20,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:27:20,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:27:20,690 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:27:20,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:27:20,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:27:20,691 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:27:20,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:27:20,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:27:20,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:27:20,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:27:20,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:27:20,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:27:20,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:27:20,696 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:27:20,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:27:20,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:27:20,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:27:20,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:27:20,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:27:20,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:27:20,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:27:20,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:27:20,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:27:20,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:27:20,699 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:27:20,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:27:20,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:27:20,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:27:20,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:27:20,701 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:27:20,701 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 -> 7566a205875353a7a53577ca4c9ca94a9d2d53458c01e4aa6bab26ab44feec5a [2024-10-11 11:27:20,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:27:20,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:27:20,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:27:20,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:27:20,989 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:27:20,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.i [2024-10-11 11:27:22,450 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:27:22,679 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:27:22,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.i [2024-10-11 11:27:22,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/10fb4d3ff/f6d39d5978db4c8bb5aeb2bf00bfb8d8/FLAGd2f72baa4 [2024-10-11 11:27:23,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/10fb4d3ff/f6d39d5978db4c8bb5aeb2bf00bfb8d8 [2024-10-11 11:27:23,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:27:23,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:27:23,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:27:23,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:27:23,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:27:23,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:27:23" (1/1) ... [2024-10-11 11:27:23,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a30e0db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:23, skipping insertion in model container [2024-10-11 11:27:23,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:27:23" (1/1) ... [2024-10-11 11:27:23,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:27:23,214 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.i[915,928] [2024-10-11 11:27:23,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:27:23,266 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:27:23,277 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-41.i[915,928] [2024-10-11 11:27:23,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:27:23,314 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:27:23,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:23 WrapperNode [2024-10-11 11:27:23,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:27:23,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:27:23,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:27:23,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:27:23,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:23" (1/1) ... [2024-10-11 11:27:23,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:23" (1/1) ... [2024-10-11 11:27:23,361 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-10-11 11:27:23,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:27:23,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:27:23,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:27:23,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:27:23,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:23" (1/1) ... [2024-10-11 11:27:23,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:23" (1/1) ... [2024-10-11 11:27:23,374 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:23" (1/1) ... [2024-10-11 11:27:23,386 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 11:27:23,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:23" (1/1) ... [2024-10-11 11:27:23,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:23" (1/1) ... [2024-10-11 11:27:23,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:23" (1/1) ... [2024-10-11 11:27:23,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:23" (1/1) ... [2024-10-11 11:27:23,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:23" (1/1) ... [2024-10-11 11:27:23,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:23" (1/1) ... [2024-10-11 11:27:23,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:27:23,417 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:27:23,417 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:27:23,418 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:27:23,418 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:23" (1/1) ... [2024-10-11 11:27:23,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:27:23,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:27:23,485 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 11:27:23,487 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 11:27:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:27:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:27:23,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:27:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:27:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:27:23,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:27:23,587 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:27:23,589 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:27:23,804 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 11:27:23,804 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:27:23,863 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:27:23,863 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:27:23,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:27:23 BoogieIcfgContainer [2024-10-11 11:27:23,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:27:23,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:27:23,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:27:23,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:27:23,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:27:23" (1/3) ... [2024-10-11 11:27:23,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c3ce7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:27:23, skipping insertion in model container [2024-10-11 11:27:23,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:27:23" (2/3) ... [2024-10-11 11:27:23,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c3ce7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:27:23, skipping insertion in model container [2024-10-11 11:27:23,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:27:23" (3/3) ... [2024-10-11 11:27:23,874 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-41.i [2024-10-11 11:27:23,892 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:27:23,892 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:27:23,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:27:23,976 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;@5a7e49f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:27:23,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:27:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 11:27:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 11:27:23,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:27:23,998 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:27:23,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:27:24,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:27:24,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2117070649, now seen corresponding path program 1 times [2024-10-11 11:27:24,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:27:24,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303892814] [2024-10-11 11:27:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:27:24,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:27:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:27:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:27:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:27:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:27:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:27:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:27:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:27:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:27:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:27:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:27:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:27:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:27:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:27:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:27:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:27:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:27:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 11:27:24,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:27:24,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303892814] [2024-10-11 11:27:24,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303892814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:27:24,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:27:24,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:27:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428304241] [2024-10-11 11:27:24,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:27:24,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:27:24,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:27:24,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:27:24,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:27:24,449 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 11:27:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:27:24,493 INFO L93 Difference]: Finished difference Result 88 states and 151 transitions. [2024-10-11 11:27:24,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:27:24,498 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 99 [2024-10-11 11:27:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:27:24,504 INFO L225 Difference]: With dead ends: 88 [2024-10-11 11:27:24,504 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 11:27:24,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-11 11:27:24,513 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:27:24,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:27:24,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 11:27:24,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 11:27:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 11:27:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2024-10-11 11:27:24,555 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 99 [2024-10-11 11:27:24,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:27:24,557 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2024-10-11 11:27:24,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 11:27:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2024-10-11 11:27:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 11:27:24,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:27:24,563 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:27:24,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:27:24,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:27:24,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:27:24,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1105653959, now seen corresponding path program 1 times [2024-10-11 11:27:24,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:27:24,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477739248] [2024-10-11 11:27:24,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:27:24,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:27:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:27:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:27:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:27:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:27:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:27:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:27:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:27:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:27:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:27:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:27:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:27:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:27:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:27:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:27:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:27:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:27:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 11:27:26,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:27:26,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477739248] [2024-10-11 11:27:26,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477739248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:27:26,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:27:26,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 11:27:26,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106150901] [2024-10-11 11:27:26,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:27:26,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:27:26,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:27:26,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:27:26,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:27:26,186 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:27:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:27:26,488 INFO L93 Difference]: Finished difference Result 103 states and 138 transitions. [2024-10-11 11:27:26,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:27:26,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-11 11:27:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:27:26,491 INFO L225 Difference]: With dead ends: 103 [2024-10-11 11:27:26,493 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 11:27:26,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:27:26,495 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 78 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:27:26,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 223 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:27:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 11:27:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2024-10-11 11:27:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 55 states have internal predecessors, (65), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 11:27:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2024-10-11 11:27:26,525 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 99 [2024-10-11 11:27:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:27:26,527 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2024-10-11 11:27:26,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:27:26,527 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2024-10-11 11:27:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 11:27:26,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:27:26,529 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:27:26,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:27:26,529 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:27:26,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:27:26,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1414305975, now seen corresponding path program 1 times [2024-10-11 11:27:26,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:27:26,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142291612] [2024-10-11 11:27:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:27:26,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:27:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:27:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:27:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:27:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:27:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:27:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:27:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:27:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:27:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:27:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:27:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:27:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:27:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:27:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:27:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:27:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:27:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 11:27:27,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:27:27,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142291612] [2024-10-11 11:27:27,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142291612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:27:27,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:27:27,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 11:27:27,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646309146] [2024-10-11 11:27:27,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:27:27,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:27:27,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:27:27,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:27:27,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:27:27,431 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:27:27,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:27:27,702 INFO L93 Difference]: Finished difference Result 176 states and 244 transitions. [2024-10-11 11:27:27,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:27:27,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-11 11:27:27,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:27:27,704 INFO L225 Difference]: With dead ends: 176 [2024-10-11 11:27:27,704 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 11:27:27,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:27:27,707 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 48 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:27:27,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 296 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:27:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 11:27:27,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2024-10-11 11:27:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 49 states have internal predecessors, (58), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 11:27:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2024-10-11 11:27:27,747 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 99 [2024-10-11 11:27:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:27:27,748 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2024-10-11 11:27:27,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:27:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2024-10-11 11:27:27,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 11:27:27,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:27:27,750 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:27:27,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:27:27,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:27:27,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:27:27,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1785712329, now seen corresponding path program 1 times [2024-10-11 11:27:27,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:27:27,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537210044] [2024-10-11 11:27:27,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:27:27,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:27:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:27:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:27:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:27:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:27:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:27:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:27:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:27:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:27:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:27:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:27:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:27:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:27:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:27:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:27:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:27:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:27:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 11:27:28,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:27:28,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537210044] [2024-10-11 11:27:28,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537210044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:27:28,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:27:28,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 11:27:28,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362704902] [2024-10-11 11:27:28,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:27:28,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:27:28,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:27:28,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:27:28,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:27:28,630 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:27:28,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:27:28,863 INFO L93 Difference]: Finished difference Result 96 states and 126 transitions. [2024-10-11 11:27:28,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:27:28,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-11 11:27:28,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:27:28,867 INFO L225 Difference]: With dead ends: 96 [2024-10-11 11:27:28,868 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 11:27:28,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:27:28,869 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 26 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:27:28,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 186 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:27:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 11:27:28,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2024-10-11 11:27:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 55 states have internal predecessors, (66), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 11:27:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2024-10-11 11:27:28,896 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 99 [2024-10-11 11:27:28,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:27:28,897 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2024-10-11 11:27:28,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:27:28,897 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2024-10-11 11:27:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 11:27:28,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:27:28,899 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:27:28,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:27:28,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:27:28,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:27:28,900 INFO L85 PathProgramCache]: Analyzing trace with hash -734247605, now seen corresponding path program 1 times [2024-10-11 11:27:28,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:27:28,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959239499] [2024-10-11 11:27:28,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:27:28,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:27:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:27:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:27:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:27:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:27:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:27:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:27:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:27:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:27:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:27:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:27:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:27:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:27:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:27:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:27:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:27:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:27:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 11:27:29,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:27:29,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959239499] [2024-10-11 11:27:29,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959239499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:27:29,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:27:29,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 11:27:29,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551725569] [2024-10-11 11:27:29,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:27:29,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:27:29,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:27:29,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:27:29,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:27:29,763 INFO L87 Difference]: Start difference. First operand 80 states and 110 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:27:30,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:27:30,043 INFO L93 Difference]: Finished difference Result 96 states and 126 transitions. [2024-10-11 11:27:30,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:27:30,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-11 11:27:30,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:27:30,046 INFO L225 Difference]: With dead ends: 96 [2024-10-11 11:27:30,046 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 11:27:30,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:27:30,049 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 22 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:27:30,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 268 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:27:30,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 11:27:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2024-10-11 11:27:30,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.2) internal successors, (60), 51 states have internal predecessors, (60), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 11:27:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2024-10-11 11:27:30,077 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 99 [2024-10-11 11:27:30,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:27:30,078 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2024-10-11 11:27:30,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:27:30,079 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2024-10-11 11:27:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 11:27:30,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:27:30,080 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:27:30,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:27:30,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:27:30,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:27:30,081 INFO L85 PathProgramCache]: Analyzing trace with hash -93998736, now seen corresponding path program 1 times [2024-10-11 11:27:30,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:27:30,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236316346] [2024-10-11 11:27:30,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:27:30,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:27:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:27:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:27:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:27:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:27:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:27:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:27:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:27:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:27:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:27:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:27:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:27:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:27:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:27:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:27:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:27:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:27:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:27:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 11:27:30,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:27:30,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236316346] [2024-10-11 11:27:30,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236316346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:27:30,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:27:30,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:27:30,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272444429] [2024-10-11 11:27:30,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:27:30,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:27:30,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:27:30,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:27:30,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:27:30,187 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:27:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:27:30,213 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2024-10-11 11:27:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:27:30,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2024-10-11 11:27:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:27:30,215 INFO L225 Difference]: With dead ends: 142 [2024-10-11 11:27:30,215 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 11:27:30,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:27:30,217 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:27:30,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:27:30,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 11:27:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 11:27:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 11:27:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 11:27:30,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2024-10-11 11:27:30,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:27:30,219 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 11:27:30,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:27:30,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 11:27:30,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 11:27:30,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:27:30,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:27:30,226 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 11:27:30,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 11:27:30,704 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:27:30,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:27:30 BoogieIcfgContainer [2024-10-11 11:27:30,722 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:27:30,722 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:27:30,722 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:27:30,722 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:27:30,723 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:27:23" (3/4) ... [2024-10-11 11:27:30,724 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 11:27:30,728 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 11:27:30,735 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 11:27:30,736 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 11:27:30,736 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 11:27:30,736 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 11:27:30,834 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 11:27:30,834 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 11:27:30,834 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:27:30,835 INFO L158 Benchmark]: Toolchain (without parser) took 7813.51ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 109.6MB in the beginning and 194.3MB in the end (delta: -84.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:27:30,837 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:27:30,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.11ms. Allocated memory is still 176.2MB. Free memory was 109.4MB in the beginning and 96.0MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 11:27:30,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.34ms. Allocated memory is still 176.2MB. Free memory was 96.0MB in the beginning and 93.9MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:27:30,838 INFO L158 Benchmark]: Boogie Preprocessor took 54.31ms. Allocated memory is still 176.2MB. Free memory was 93.9MB in the beginning and 150.0MB in the end (delta: -56.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 11:27:30,841 INFO L158 Benchmark]: RCFGBuilder took 446.82ms. Allocated memory is still 176.2MB. Free memory was 150.0MB in the beginning and 131.8MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 11:27:30,841 INFO L158 Benchmark]: TraceAbstraction took 6855.70ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 131.1MB in the beginning and 200.6MB in the end (delta: -69.5MB). Peak memory consumption was 135.1MB. Max. memory is 16.1GB. [2024-10-11 11:27:30,841 INFO L158 Benchmark]: Witness Printer took 112.37ms. Allocated memory is still 255.9MB. Free memory was 200.6MB in the beginning and 194.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:27:30,842 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.16ms. Allocated memory is still 104.9MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.11ms. Allocated memory is still 176.2MB. Free memory was 109.4MB in the beginning and 96.0MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.34ms. Allocated memory is still 176.2MB. Free memory was 96.0MB in the beginning and 93.9MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.31ms. Allocated memory is still 176.2MB. Free memory was 93.9MB in the beginning and 150.0MB in the end (delta: -56.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 446.82ms. Allocated memory is still 176.2MB. Free memory was 150.0MB in the beginning and 131.8MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6855.70ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 131.1MB in the beginning and 200.6MB in the end (delta: -69.5MB). Peak memory consumption was 135.1MB. Max. memory is 16.1GB. * Witness Printer took 112.37ms. Allocated memory is still 255.9MB. Free memory was 200.6MB in the beginning and 194.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 1131 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 756 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 484 IncrementalHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 375 mSDtfsCounter, 484 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=2, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 70 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 2370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 2880/2880 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((var_1_5 == 0) || (((1 == var_1_8) || ((0 == var_1_9) && (0 == var_1_8))) && ((1 != var_1_8) || (0 != var_1_9)))) RESULT: Ultimate proved your program to be correct! [2024-10-11 11:27:30,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE