./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b1bd1257190961b4c1941dc1e9dfbe09ed3b9534a64219badf358449b7e869c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:30:08,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:30:08,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:30:08,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:30:08,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:30:08,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:30:08,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:30:08,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:30:08,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:30:08,335 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:30:08,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:30:08,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:30:08,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:30:08,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:30:08,339 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:30:08,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:30:08,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:30:08,340 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:30:08,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:30:08,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:30:08,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:30:08,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:30:08,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:30:08,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:30:08,343 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:30:08,344 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:30:08,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:30:08,344 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:30:08,345 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:30:08,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:30:08,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:30:08,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:30:08,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:30:08,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:30:08,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:30:08,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:30:08,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:30:08,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:30:08,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:30:08,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:30:08,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:30:08,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:30:08,350 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b1bd1257190961b4c1941dc1e9dfbe09ed3b9534a64219badf358449b7e869c [2024-11-10 07:30:08,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:30:08,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:30:08,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:30:08,628 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:30:08,628 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:30:08,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i [2024-11-10 07:30:10,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:30:10,381 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:30:10,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i [2024-11-10 07:30:10,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2c46e45/b845f714323343b7b4ee8793c457126e/FLAGd74ef5105 [2024-11-10 07:30:10,721 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2c46e45/b845f714323343b7b4ee8793c457126e [2024-11-10 07:30:10,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:30:10,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:30:10,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:30:10,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:30:10,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:30:10,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:30:10" (1/1) ... [2024-11-10 07:30:10,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a2698f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:30:10, skipping insertion in model container [2024-11-10 07:30:10,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:30:10" (1/1) ... [2024-11-10 07:30:10,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:30:10,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i[915,928] [2024-11-10 07:30:10,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:30:10,961 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:30:10,972 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i[915,928] [2024-11-10 07:30:10,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:30:11,017 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:30:11,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:30:11 WrapperNode [2024-11-10 07:30:11,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:30:11,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:30:11,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:30:11,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:30:11,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:30:11" (1/1) ... [2024-11-10 07:30:11,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:30:11" (1/1) ... [2024-11-10 07:30:11,133 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-10 07:30:11,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:30:11,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:30:11,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:30:11,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:30:11,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:30:11" (1/1) ... [2024-11-10 07:30:11,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:30:11" (1/1) ... [2024-11-10 07:30:11,160 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:30:11" (1/1) ... [2024-11-10 07:30:11,178 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-11-10 07:30:11,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:30:11" (1/1) ... [2024-11-10 07:30:11,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:30:11" (1/1) ... [2024-11-10 07:30:11,187 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:30:11" (1/1) ... [2024-11-10 07:30:11,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:30:11" (1/1) ... [2024-11-10 07:30:11,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:30:11" (1/1) ... [2024-11-10 07:30:11,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:30:11" (1/1) ... [2024-11-10 07:30:11,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:30:11,206 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:30:11,206 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:30:11,206 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:30:11,207 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:30:11" (1/1) ... [2024-11-10 07:30:11,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:30:11,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:30:11,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:30:11,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:30:11,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:30:11,305 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:30:11,306 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:30:11,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:30:11,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:30:11,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:30:11,393 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:30:11,397 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:30:11,768 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-10 07:30:11,768 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:30:11,784 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:30:11,785 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:30:11,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:30:11 BoogieIcfgContainer [2024-11-10 07:30:11,786 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:30:11,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:30:11,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:30:11,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:30:11,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:30:10" (1/3) ... [2024-11-10 07:30:11,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfe5ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:30:11, skipping insertion in model container [2024-11-10 07:30:11,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:30:11" (2/3) ... [2024-11-10 07:30:11,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfe5ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:30:11, skipping insertion in model container [2024-11-10 07:30:11,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:30:11" (3/3) ... [2024-11-10 07:30:11,798 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-86.i [2024-11-10 07:30:11,816 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:30:11,817 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:30:11,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:30:11,907 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;@506641b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:30:11,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:30:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 07:30:11,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 07:30:11,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:30:11,927 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:30:11,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:30:11,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:30:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2128816395, now seen corresponding path program 1 times [2024-11-10 07:30:11,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:30:11,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795489614] [2024-11-10 07:30:11,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:30:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:30:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:30:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:30:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:30:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:30:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:30:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:30:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:30:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:30:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:30:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:30:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:30:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:30:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:30:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:30:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:30:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:30:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:30:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 07:30:12,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:30:12,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795489614] [2024-11-10 07:30:12,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795489614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:30:12,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:30:12,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:30:12,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103216268] [2024-11-10 07:30:12,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:30:12,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:30:12,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:30:12,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:30:12,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:30:12,383 INFO L87 Difference]: Start difference. First operand has 54 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 07:30:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:30:12,406 INFO L93 Difference]: Finished difference Result 104 states and 169 transitions. [2024-11-10 07:30:12,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:30:12,409 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2024-11-10 07:30:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:30:12,416 INFO L225 Difference]: With dead ends: 104 [2024-11-10 07:30:12,417 INFO L226 Difference]: Without dead ends: 49 [2024-11-10 07:30:12,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-11-10 07:30:12,425 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:30:12,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:30:12,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-10 07:30:12,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-10 07:30:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 07:30:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-10 07:30:12,484 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 110 [2024-11-10 07:30:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:30:12,486 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-10 07:30:12,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 07:30:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2024-11-10 07:30:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 07:30:12,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:30:12,492 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:30:12,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:30:12,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:30:12,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:30:12,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1724598516, now seen corresponding path program 1 times [2024-11-10 07:30:12,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:30:12,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684984796] [2024-11-10 07:30:12,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:30:12,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:30:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:14,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:30:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:14,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:30:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:14,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:30:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:14,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:30:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:14,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:30:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:14,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:30:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:14,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:30:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:14,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:30:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:14,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:30:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:14,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:30:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:14,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:30:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:14,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:30:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:14,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:30:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:14,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:30:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:15,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:30:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:15,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:30:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:15,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:30:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 07:30:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:30:15,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684984796] [2024-11-10 07:30:15,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684984796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:30:15,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:30:15,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:30:15,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20113664] [2024-11-10 07:30:15,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:30:15,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:30:15,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:30:15,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:30:15,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:30:15,077 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 07:30:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:30:15,255 INFO L93 Difference]: Finished difference Result 141 states and 204 transitions. [2024-11-10 07:30:15,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:30:15,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2024-11-10 07:30:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:30:15,259 INFO L225 Difference]: With dead ends: 141 [2024-11-10 07:30:15,259 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 07:30:15,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:30:15,262 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 46 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:30:15,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 211 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:30:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 07:30:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-11-10 07:30:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 07:30:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-11-10 07:30:15,294 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 110 [2024-11-10 07:30:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:30:15,295 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-11-10 07:30:15,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 07:30:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-11-10 07:30:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 07:30:15,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:30:15,300 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:30:15,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:30:15,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:30:15,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:30:15,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1695969365, now seen corresponding path program 1 times [2024-11-10 07:30:15,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:30:15,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084678193] [2024-11-10 07:30:15,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:30:15,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:30:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:30:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:30:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:30:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:30:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:30:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:30:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:30:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:30:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:30:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:30:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:30:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:30:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:30:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:30:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:30:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:30:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:30:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 07:30:18,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:30:18,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084678193] [2024-11-10 07:30:18,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084678193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:30:18,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:30:18,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 07:30:18,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476271915] [2024-11-10 07:30:18,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:30:18,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:30:18,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:30:18,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:30:18,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:30:18,133 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 07:30:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:30:18,897 INFO L93 Difference]: Finished difference Result 194 states and 274 transitions. [2024-11-10 07:30:18,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:30:18,898 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-11-10 07:30:18,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:30:18,902 INFO L225 Difference]: With dead ends: 194 [2024-11-10 07:30:18,905 INFO L226 Difference]: Without dead ends: 191 [2024-11-10 07:30:18,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:30:18,906 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 69 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 07:30:18,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 274 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 07:30:18,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-10 07:30:18,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2024-11-10 07:30:18,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 109 states have (on average 1.1926605504587156) internal successors, (130), 111 states have internal predecessors, (130), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 07:30:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 258 transitions. [2024-11-10 07:30:18,942 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 258 transitions. Word has length 110 [2024-11-10 07:30:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:30:18,943 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 258 transitions. [2024-11-10 07:30:18,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 07:30:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 258 transitions. [2024-11-10 07:30:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 07:30:18,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:30:18,945 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:30:18,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:30:18,946 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:30:18,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:30:18,947 INFO L85 PathProgramCache]: Analyzing trace with hash 46840970, now seen corresponding path program 1 times [2024-11-10 07:30:18,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:30:18,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975181335] [2024-11-10 07:30:18,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:30:18,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:30:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:30:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:30:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:30:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:30:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:30:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:30:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:30:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:30:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:30:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:30:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:30:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:30:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:30:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:30:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:30:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:30:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:30:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 07:30:21,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:30:21,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975181335] [2024-11-10 07:30:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975181335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:30:21,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:30:21,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 07:30:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677899962] [2024-11-10 07:30:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:30:21,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:30:21,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:30:21,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:30:21,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:30:21,812 INFO L87 Difference]: Start difference. First operand 178 states and 258 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 07:30:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:30:22,335 INFO L93 Difference]: Finished difference Result 195 states and 274 transitions. [2024-11-10 07:30:22,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:30:22,336 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-11-10 07:30:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:30:22,342 INFO L225 Difference]: With dead ends: 195 [2024-11-10 07:30:22,342 INFO L226 Difference]: Without dead ends: 192 [2024-11-10 07:30:22,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:30:22,344 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 19 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:30:22,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 320 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:30:22,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-10 07:30:22,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 173. [2024-11-10 07:30:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 104 states have (on average 1.1923076923076923) internal successors, (124), 106 states have internal predecessors, (124), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 07:30:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 252 transitions. [2024-11-10 07:30:22,374 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 252 transitions. Word has length 110 [2024-11-10 07:30:22,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:30:22,374 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 252 transitions. [2024-11-10 07:30:22,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 07:30:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 252 transitions. [2024-11-10 07:30:22,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 07:30:22,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:30:22,379 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:30:22,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 07:30:22,380 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:30:22,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:30:22,380 INFO L85 PathProgramCache]: Analyzing trace with hash 802046572, now seen corresponding path program 1 times [2024-11-10 07:30:22,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:30:22,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509016414] [2024-11-10 07:30:22,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:30:22,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:30:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:30:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:30:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:30:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:30:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:30:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:30:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:30:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:30:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:30:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:30:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:30:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:30:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:30:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:30:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:30:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:30:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:30:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 07:30:24,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:30:24,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509016414] [2024-11-10 07:30:24,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509016414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:30:24,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:30:24,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 07:30:24,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878493885] [2024-11-10 07:30:24,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:30:24,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:30:24,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:30:24,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:30:24,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:30:24,896 INFO L87 Difference]: Start difference. First operand 173 states and 252 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 07:30:25,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:30:25,306 INFO L93 Difference]: Finished difference Result 190 states and 269 transitions. [2024-11-10 07:30:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 07:30:25,307 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-11-10 07:30:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:30:25,309 INFO L225 Difference]: With dead ends: 190 [2024-11-10 07:30:25,310 INFO L226 Difference]: Without dead ends: 187 [2024-11-10 07:30:25,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-10 07:30:25,315 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 43 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:30:25,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 255 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:30:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-10 07:30:25,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 176. [2024-11-10 07:30:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 107 states have (on average 1.1775700934579438) internal successors, (126), 109 states have internal predecessors, (126), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 07:30:25,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 254 transitions. [2024-11-10 07:30:25,341 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 254 transitions. Word has length 110 [2024-11-10 07:30:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:30:25,342 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 254 transitions. [2024-11-10 07:30:25,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 07:30:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 254 transitions. [2024-11-10 07:30:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 07:30:25,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:30:25,344 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:30:25,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 07:30:25,345 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:30:25,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:30:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash -50177059, now seen corresponding path program 1 times [2024-11-10 07:30:25,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:30:25,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563680162] [2024-11-10 07:30:25,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:30:25,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:30:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:30:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:30:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:30:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:30:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:30:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:30:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:30:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:30:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:30:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:30:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:30:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:30:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:30:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:30:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:30:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:30:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:30:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 07:30:26,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:30:26,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563680162] [2024-11-10 07:30:26,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563680162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:30:26,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:30:26,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 07:30:26,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563982685] [2024-11-10 07:30:26,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:30:26,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:30:26,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:30:26,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:30:26,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:30:26,878 INFO L87 Difference]: Start difference. First operand 176 states and 254 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 07:30:27,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:30:27,197 INFO L93 Difference]: Finished difference Result 202 states and 282 transitions. [2024-11-10 07:30:27,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:30:27,198 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2024-11-10 07:30:27,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:30:27,200 INFO L225 Difference]: With dead ends: 202 [2024-11-10 07:30:27,200 INFO L226 Difference]: Without dead ends: 199 [2024-11-10 07:30:27,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-10 07:30:27,203 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 41 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:30:27,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 306 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:30:27,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-10 07:30:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 177. [2024-11-10 07:30:27,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 110 states have internal predecessors, (128), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 07:30:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 256 transitions. [2024-11-10 07:30:27,236 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 256 transitions. Word has length 111 [2024-11-10 07:30:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:30:27,237 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 256 transitions. [2024-11-10 07:30:27,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 07:30:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 256 transitions. [2024-11-10 07:30:27,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 07:30:27,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:30:27,238 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:30:27,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 07:30:27,239 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:30:27,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:30:27,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1663904675, now seen corresponding path program 1 times [2024-11-10 07:30:27,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:30:27,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177923739] [2024-11-10 07:30:27,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:30:27,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:30:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:30:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:30:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:30:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:30:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:30:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:30:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:30:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:30:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:30:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:30:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:30:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:30:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:30:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:30:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:30:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:30:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:30:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 07:30:27,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:30:27,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177923739] [2024-11-10 07:30:27,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177923739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:30:27,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:30:27,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:30:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957177742] [2024-11-10 07:30:27,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:30:27,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:30:27,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:30:27,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:30:27,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:30:27,303 INFO L87 Difference]: Start difference. First operand 177 states and 256 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 07:30:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:30:27,349 INFO L93 Difference]: Finished difference Result 511 states and 739 transitions. [2024-11-10 07:30:27,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:30:27,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2024-11-10 07:30:27,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:30:27,352 INFO L225 Difference]: With dead ends: 511 [2024-11-10 07:30:27,352 INFO L226 Difference]: Without dead ends: 337 [2024-11-10 07:30:27,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:30:27,355 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 62 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:30:27,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 191 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:30:27,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-10 07:30:27,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333. [2024-11-10 07:30:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 196 states have (on average 1.1326530612244898) internal successors, (222), 200 states have internal predecessors, (222), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 124 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-10 07:30:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 478 transitions. [2024-11-10 07:30:27,388 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 478 transitions. Word has length 111 [2024-11-10 07:30:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:30:27,389 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 478 transitions. [2024-11-10 07:30:27,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 07:30:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 478 transitions. [2024-11-10 07:30:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 07:30:27,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:30:27,391 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:30:27,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 07:30:27,391 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:30:27,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:30:27,392 INFO L85 PathProgramCache]: Analyzing trace with hash 78905660, now seen corresponding path program 1 times [2024-11-10 07:30:27,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:30:27,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864958650] [2024-11-10 07:30:27,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:30:27,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:30:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:30:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:30:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:30:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:30:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:30:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:30:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:30:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:30:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:30:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:30:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:30:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:30:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:30:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:30:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:30:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:30:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:30:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,577 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 07:30:27,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:30:27,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864958650] [2024-11-10 07:30:27,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864958650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:30:27,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:30:27,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:30:27,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746295376] [2024-11-10 07:30:27,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:30:27,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:30:27,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:30:27,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:30:27,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:30:27,579 INFO L87 Difference]: Start difference. First operand 333 states and 478 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 07:30:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:30:27,626 INFO L93 Difference]: Finished difference Result 734 states and 1058 transitions. [2024-11-10 07:30:27,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:30:27,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2024-11-10 07:30:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:30:27,631 INFO L225 Difference]: With dead ends: 734 [2024-11-10 07:30:27,632 INFO L226 Difference]: Without dead ends: 404 [2024-11-10 07:30:27,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:30:27,634 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 29 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:30:27,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 139 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:30:27,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-10 07:30:27,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-11-10 07:30:27,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 233 states have (on average 1.1201716738197425) internal successors, (261), 238 states have internal predecessors, (261), 160 states have call successors, (160), 10 states have call predecessors, (160), 10 states have return successors, (160), 155 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-10 07:30:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 581 transitions. [2024-11-10 07:30:27,678 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 581 transitions. Word has length 111 [2024-11-10 07:30:27,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:30:27,678 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 581 transitions. [2024-11-10 07:30:27,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 07:30:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 581 transitions. [2024-11-10 07:30:27,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-10 07:30:27,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:30:27,682 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:30:27,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 07:30:27,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:30:27,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:30:27,683 INFO L85 PathProgramCache]: Analyzing trace with hash -5567199, now seen corresponding path program 1 times [2024-11-10 07:30:27,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:30:27,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084411713] [2024-11-10 07:30:27,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:30:27,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:30:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:30:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:30:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:30:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:30:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:30:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:30:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:30:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:30:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:30:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:30:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:30:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:30:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:30:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:30:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:30:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:30:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:30:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 07:30:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:30:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:30:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:30:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 07:30:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:30:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 07:30:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:30:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 07:30:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 07:30:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 07:30:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-10 07:30:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 07:30:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 07:30:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 07:30:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-10 07:30:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 07:30:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2281 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-10 07:30:27,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:30:27,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084411713] [2024-11-10 07:30:27,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084411713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:30:27,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675566047] [2024-11-10 07:30:27,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:30:27,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:30:27,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:30:27,878 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:30:27,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 07:30:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:30:28,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 07:30:28,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:30:28,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2281 backedges. 1193 proven. 0 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2024-11-10 07:30:28,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:30:28,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675566047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:30:28,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 07:30:28,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-10 07:30:28,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102213911] [2024-11-10 07:30:28,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:30:28,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:30:28,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:30:28,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:30:28,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:30:28,171 INFO L87 Difference]: Start difference. First operand 404 states and 581 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-10 07:30:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:30:28,225 INFO L93 Difference]: Finished difference Result 454 states and 638 transitions. [2024-11-10 07:30:28,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:30:28,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 217 [2024-11-10 07:30:28,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:30:28,228 INFO L225 Difference]: With dead ends: 454 [2024-11-10 07:30:28,228 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 07:30:28,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:30:28,234 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:30:28,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 112 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:30:28,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 07:30:28,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 07:30:28,237 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-11-10 07:30:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 07:30:28,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 217 [2024-11-10 07:30:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:30:28,238 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 07:30:28,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-10 07:30:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 07:30:28,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 07:30:28,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:30:28,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 07:30:28,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:30:28,450 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:30:28,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 07:30:29,803 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:30:29,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:30:29 BoogieIcfgContainer [2024-11-10 07:30:29,837 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:30:29,837 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:30:29,838 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:30:29,838 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:30:29,838 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:30:11" (3/4) ... [2024-11-10 07:30:29,841 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 07:30:29,845 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 07:30:29,850 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 07:30:29,851 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 07:30:29,851 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 07:30:29,851 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 07:30:29,944 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 07:30:29,945 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 07:30:29,945 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:30:29,946 INFO L158 Benchmark]: Toolchain (without parser) took 19220.35ms. Allocated memory was 182.5MB in the beginning and 539.0MB in the end (delta: 356.5MB). Free memory was 113.2MB in the beginning and 401.9MB in the end (delta: -288.7MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2024-11-10 07:30:29,946 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:30:29,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.35ms. Allocated memory is still 182.5MB. Free memory was 113.0MB in the beginning and 98.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 07:30:29,947 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.66ms. Allocated memory is still 182.5MB. Free memory was 98.7MB in the beginning and 152.8MB in the end (delta: -54.1MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-11-10 07:30:29,947 INFO L158 Benchmark]: Boogie Preprocessor took 69.80ms. Allocated memory is still 182.5MB. Free memory was 152.8MB in the beginning and 147.3MB in the end (delta: 5.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:30:29,948 INFO L158 Benchmark]: IcfgBuilder took 580.43ms. Allocated memory is still 182.5MB. Free memory was 147.3MB in the beginning and 128.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 07:30:29,948 INFO L158 Benchmark]: TraceAbstraction took 18048.07ms. Allocated memory was 182.5MB in the beginning and 539.0MB in the end (delta: 356.5MB). Free memory was 127.6MB in the beginning and 407.1MB in the end (delta: -279.5MB). Peak memory consumption was 300.1MB. Max. memory is 16.1GB. [2024-11-10 07:30:29,948 INFO L158 Benchmark]: Witness Printer took 107.88ms. Allocated memory is still 539.0MB. Free memory was 407.1MB in the beginning and 401.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 07:30:29,952 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.18ms. Allocated memory is still 109.1MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.35ms. Allocated memory is still 182.5MB. Free memory was 113.0MB in the beginning and 98.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.66ms. Allocated memory is still 182.5MB. Free memory was 98.7MB in the beginning and 152.8MB in the end (delta: -54.1MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.80ms. Allocated memory is still 182.5MB. Free memory was 152.8MB in the beginning and 147.3MB in the end (delta: 5.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 580.43ms. Allocated memory is still 182.5MB. Free memory was 147.3MB in the beginning and 128.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 18048.07ms. Allocated memory was 182.5MB in the beginning and 539.0MB in the end (delta: 356.5MB). Free memory was 127.6MB in the beginning and 407.1MB in the end (delta: -279.5MB). Peak memory consumption was 300.1MB. Max. memory is 16.1GB. * Witness Printer took 107.88ms. Allocated memory is still 539.0MB. Free memory was 407.1MB in the beginning and 401.9MB in the end (delta: 5.2MB). 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, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 9, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 1882 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1219 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 654 IncrementalHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 663 mSDtfsCounter, 654 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 647 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=8, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 72 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 1317 NumberOfCodeBlocks, 1317 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1307 ConstructedInterpolants, 0 QuantifiedInterpolants, 4955 SizeOfPredicates, 0 NumberOfNonLiveVariables, 455 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 8912/8914 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: 96]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((var_1_7 == 4) && (0 <= var_1_16)) && (var_1_16 <= 0)) Ensures: ((((var_1_7 == 4) && (0 <= var_1_16)) && (var_1_16 <= 0)) && ((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (last_1_var_1_1 == \old(last_1_var_1_1)))) RESULT: Ultimate proved your program to be correct! [2024-11-10 07:30:30,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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