./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-59.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 8715671ec75423b9d165784023eed8146db5d099ce878e73ac4d416bda27abc8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:05:25,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:05:25,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:05:25,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:05:25,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:05:25,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:05:25,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:05:25,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:05:25,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:05:25,474 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:05:25,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:05:25,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:05:25,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:05:25,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:05:25,477 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:05:25,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:05:25,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:05:25,478 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:05:25,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:05:25,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:05:25,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:05:25,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:05:25,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:05:25,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:05:25,481 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:05:25,481 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:05:25,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:05:25,482 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:05:25,482 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:05:25,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:05:25,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:05:25,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:05:25,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:05:25,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:05:25,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:05:25,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:05:25,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:05:25,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:05:25,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:05:25,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:05:25,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:05:25,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:05:25,486 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 -> 8715671ec75423b9d165784023eed8146db5d099ce878e73ac4d416bda27abc8 [2024-10-14 11:05:25,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:05:25,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:05:25,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:05:25,777 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:05:25,778 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:05:25,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-59.i [2024-10-14 11:05:27,294 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:05:27,503 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:05:27,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-59.i [2024-10-14 11:05:27,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8aca8e0/9b82a7a91e444a9b9c3bca4c773fa674/FLAG290dad4ed [2024-10-14 11:05:27,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8aca8e0/9b82a7a91e444a9b9c3bca4c773fa674 [2024-10-14 11:05:27,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:05:27,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:05:27,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:05:27,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:05:27,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:05:27,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:05:27" (1/1) ... [2024-10-14 11:05:27,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55d8a641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:27, skipping insertion in model container [2024-10-14 11:05:27,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:05:27" (1/1) ... [2024-10-14 11:05:27,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:05:27,726 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-59.i[916,929] [2024-10-14 11:05:27,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:05:27,779 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:05:27,788 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-59.i[916,929] [2024-10-14 11:05:27,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:05:27,825 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:05:27,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:27 WrapperNode [2024-10-14 11:05:27,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:05:27,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:05:27,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:05:27,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:05:27,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:27" (1/1) ... [2024-10-14 11:05:27,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:27" (1/1) ... [2024-10-14 11:05:27,887 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-10-14 11:05:27,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:05:27,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:05:27,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:05:27,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:05:27,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:27" (1/1) ... [2024-10-14 11:05:27,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:27" (1/1) ... [2024-10-14 11:05:27,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:27" (1/1) ... [2024-10-14 11:05:27,916 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:05:27,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:27" (1/1) ... [2024-10-14 11:05:27,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:27" (1/1) ... [2024-10-14 11:05:27,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:27" (1/1) ... [2024-10-14 11:05:27,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:27" (1/1) ... [2024-10-14 11:05:27,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:27" (1/1) ... [2024-10-14 11:05:27,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:27" (1/1) ... [2024-10-14 11:05:27,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:05:27,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:05:27,940 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:05:27,940 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:05:27,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:27" (1/1) ... [2024-10-14 11:05:27,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:05:27,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:05:28,048 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:05:28,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:05:28,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:05:28,097 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:05:28,098 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:05:28,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:05:28,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:05:28,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:05:28,172 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:05:28,177 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:05:28,428 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 11:05:28,428 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:05:28,482 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:05:28,484 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:05:28,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:05:28 BoogieIcfgContainer [2024-10-14 11:05:28,484 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:05:28,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:05:28,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:05:28,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:05:28,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:05:27" (1/3) ... [2024-10-14 11:05:28,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffb729c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:05:28, skipping insertion in model container [2024-10-14 11:05:28,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:05:27" (2/3) ... [2024-10-14 11:05:28,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffb729c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:05:28, skipping insertion in model container [2024-10-14 11:05:28,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:05:28" (3/3) ... [2024-10-14 11:05:28,495 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-59.i [2024-10-14 11:05:28,511 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:05:28,511 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:05:28,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:05:28,592 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;@3e357f46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:05:28,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:05:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 11:05:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 11:05:28,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:05:28,612 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:05:28,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:05:28,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:05:28,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1523944797, now seen corresponding path program 1 times [2024-10-14 11:05:28,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:05:28,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933979427] [2024-10-14 11:05:28,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:05:28,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:05:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:05:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:05:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:05:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:05:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:05:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:05:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:05:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:05:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:05:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:05:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:05:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:05:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:05:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:05:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:05:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:05:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:05:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:05:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:28,985 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 11:05:28,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:05:28,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933979427] [2024-10-14 11:05:28,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933979427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:05:28,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:05:28,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:05:28,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659004665] [2024-10-14 11:05:28,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:05:29,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:05:29,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:05:29,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:05:29,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:05:29,030 INFO L87 Difference]: Start difference. First operand has 46 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 11:05:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:05:29,065 INFO L93 Difference]: Finished difference Result 89 states and 160 transitions. [2024-10-14 11:05:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:05:29,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 107 [2024-10-14 11:05:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:05:29,076 INFO L225 Difference]: With dead ends: 89 [2024-10-14 11:05:29,076 INFO L226 Difference]: Without dead ends: 44 [2024-10-14 11:05:29,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:05:29,082 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:05:29,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:05:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-14 11:05:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-14 11:05:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 11:05:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2024-10-14 11:05:29,131 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 67 transitions. Word has length 107 [2024-10-14 11:05:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:05:29,131 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 67 transitions. [2024-10-14 11:05:29,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 11:05:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 67 transitions. [2024-10-14 11:05:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 11:05:29,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:05:29,135 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:05:29,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:05:29,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:05:29,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:05:29,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1823148387, now seen corresponding path program 1 times [2024-10-14 11:05:29,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:05:29,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321374140] [2024-10-14 11:05:29,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:05:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:05:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:05:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:05:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:05:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:05:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:05:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:05:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:05:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:05:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:05:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:05:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:05:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:05:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:05:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:05:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:05:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:05:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:05:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:05:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 11:05:29,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:05:29,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321374140] [2024-10-14 11:05:29,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321374140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:05:29,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:05:29,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:05:29,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693221204] [2024-10-14 11:05:29,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:05:29,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:05:29,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:05:29,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:05:29,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:05:29,687 INFO L87 Difference]: Start difference. First operand 44 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 11:05:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:05:29,893 INFO L93 Difference]: Finished difference Result 131 states and 200 transitions. [2024-10-14 11:05:29,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:05:29,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 107 [2024-10-14 11:05:29,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:05:29,897 INFO L225 Difference]: With dead ends: 131 [2024-10-14 11:05:29,897 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 11:05:29,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:05:29,901 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:05:29,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 169 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:05:29,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 11:05:29,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2024-10-14 11:05:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 11:05:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2024-10-14 11:05:29,934 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 107 [2024-10-14 11:05:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:05:29,935 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2024-10-14 11:05:29,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 11:05:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2024-10-14 11:05:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 11:05:29,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:05:29,937 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:05:29,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:05:29,937 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:05:29,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:05:29,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2108675400, now seen corresponding path program 1 times [2024-10-14 11:05:29,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:05:29,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863055016] [2024-10-14 11:05:29,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:05:29,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:05:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:05:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:05:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:05:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:05:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:05:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:05:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:05:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:05:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:05:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:05:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:05:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:05:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:05:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:05:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:05:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:05:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:05:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:05:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 11:05:37,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:05:37,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863055016] [2024-10-14 11:05:37,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863055016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:05:37,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:05:37,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 11:05:37,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110062951] [2024-10-14 11:05:37,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:05:37,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 11:05:37,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:05:37,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 11:05:37,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:05:37,808 INFO L87 Difference]: Start difference. First operand 79 states and 120 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 11:05:38,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:05:38,226 INFO L93 Difference]: Finished difference Result 95 states and 140 transitions. [2024-10-14 11:05:38,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 11:05:38,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 108 [2024-10-14 11:05:38,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:05:38,229 INFO L225 Difference]: With dead ends: 95 [2024-10-14 11:05:38,231 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 11:05:38,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:05:38,232 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 37 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:05:38,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 158 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:05:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 11:05:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2024-10-14 11:05:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 11:05:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2024-10-14 11:05:38,259 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 108 [2024-10-14 11:05:38,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:05:38,260 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2024-10-14 11:05:38,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 11:05:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2024-10-14 11:05:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 11:05:38,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:05:38,264 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:05:38,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:05:38,265 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:05:38,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:05:38,266 INFO L85 PathProgramCache]: Analyzing trace with hash 704969848, now seen corresponding path program 1 times [2024-10-14 11:05:38,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:05:38,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019146467] [2024-10-14 11:05:38,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:05:38,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:05:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:05:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:05:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:05:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:05:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:05:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:05:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:05:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:05:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:05:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:05:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:05:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:05:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:05:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:05:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:05:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:05:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:05:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:05:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 11:05:43,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:05:43,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019146467] [2024-10-14 11:05:43,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019146467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:05:43,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:05:43,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 11:05:43,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141559421] [2024-10-14 11:05:43,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:05:43,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 11:05:43,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:05:43,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 11:05:43,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:05:43,172 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 11:05:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:05:44,052 INFO L93 Difference]: Finished difference Result 93 states and 138 transitions. [2024-10-14 11:05:44,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 11:05:44,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 109 [2024-10-14 11:05:44,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:05:44,054 INFO L225 Difference]: With dead ends: 93 [2024-10-14 11:05:44,054 INFO L226 Difference]: Without dead ends: 91 [2024-10-14 11:05:44,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-10-14 11:05:44,055 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 12 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 11:05:44,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 247 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 11:05:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-14 11:05:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2024-10-14 11:05:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 11:05:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 128 transitions. [2024-10-14 11:05:44,070 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 128 transitions. Word has length 109 [2024-10-14 11:05:44,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:05:44,071 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 128 transitions. [2024-10-14 11:05:44,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 11:05:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 128 transitions. [2024-10-14 11:05:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-14 11:05:44,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:05:44,076 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 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] [2024-10-14 11:05:44,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:05:44,076 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:05:44,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:05:44,077 INFO L85 PathProgramCache]: Analyzing trace with hash 857893907, now seen corresponding path program 1 times [2024-10-14 11:05:44,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:05:44,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089988518] [2024-10-14 11:05:44,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:05:44,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:05:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:05:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:05:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:05:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:05:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:05:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:05:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:05:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:05:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:05:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:05:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:05:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:05:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:05:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:05:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:05:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:05:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:05:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:05:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 11:05:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:05:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:05:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:05:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:05:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:05:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:05:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:05:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 11:05:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:05:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 11:05:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:05:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 11:05:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 11:05:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-14 11:05:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 11:05:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-14 11:05:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-14 11:05:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2554 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2549 trivial. 0 not checked. [2024-10-14 11:05:45,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:05:45,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089988518] [2024-10-14 11:05:45,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089988518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:05:45,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:05:45,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 11:05:45,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132580451] [2024-10-14 11:05:45,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:05:45,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 11:05:45,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:05:45,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 11:05:45,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-14 11:05:45,955 INFO L87 Difference]: Start difference. First operand 84 states and 128 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 11:05:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:05:46,343 INFO L93 Difference]: Finished difference Result 107 states and 158 transitions. [2024-10-14 11:05:46,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 11:05:46,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 216 [2024-10-14 11:05:46,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:05:46,346 INFO L225 Difference]: With dead ends: 107 [2024-10-14 11:05:46,346 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 11:05:46,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:05:46,347 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:05:46,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 244 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:05:46,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 11:05:46,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2024-10-14 11:05:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 11:05:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 128 transitions. [2024-10-14 11:05:46,362 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 128 transitions. Word has length 216 [2024-10-14 11:05:46,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:05:46,363 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 128 transitions. [2024-10-14 11:05:46,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 11:05:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 128 transitions. [2024-10-14 11:05:46,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-14 11:05:46,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:05:46,367 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 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-10-14 11:05:46,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 11:05:46,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:05:46,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:05:46,368 INFO L85 PathProgramCache]: Analyzing trace with hash 585449229, now seen corresponding path program 1 times [2024-10-14 11:05:46,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:05:46,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599952816] [2024-10-14 11:05:46,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:05:46,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:05:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:05:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:05:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:05:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:05:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:05:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:05:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:05:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:05:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:05:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:05:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:05:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:05:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:05:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:05:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:05:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:05:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:05:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 11:05:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 11:05:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:05:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:05:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:05:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:05:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:05:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:05:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:05:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 11:05:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:05:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 11:05:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:05:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 11:05:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-14 11:05:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-14 11:05:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-14 11:05:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-14 11:05:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-14 11:05:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:05:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2554 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2549 trivial. 0 not checked. [2024-10-14 11:05:48,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:05:48,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599952816] [2024-10-14 11:05:48,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599952816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:05:48,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:05:48,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 11:05:48,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227455281] [2024-10-14 11:05:48,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:05:48,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 11:05:48,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:05:48,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 11:05:48,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 11:05:48,264 INFO L87 Difference]: Start difference. First operand 84 states and 128 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 11:05:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:05:48,727 INFO L93 Difference]: Finished difference Result 105 states and 156 transitions. [2024-10-14 11:05:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 11:05:48,728 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 217 [2024-10-14 11:05:48,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:05:48,729 INFO L225 Difference]: With dead ends: 105 [2024-10-14 11:05:48,729 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 11:05:48,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2024-10-14 11:05:48,730 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 35 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:05:48,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 245 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 11:05:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 11:05:48,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 11:05:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 11:05:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 11:05:48,732 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 217 [2024-10-14 11:05:48,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:05:48,732 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 11:05:48,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 11:05:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 11:05:48,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 11:05:48,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:05:48,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 11:05:48,738 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 11:05:48,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 11:05:48,776 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:05:48,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:05:48 BoogieIcfgContainer [2024-10-14 11:05:48,792 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:05:48,793 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:05:48,793 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:05:48,793 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:05:48,793 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:05:28" (3/4) ... [2024-10-14 11:05:48,795 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 11:05:48,799 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 11:05:48,806 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-14 11:05:48,807 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-14 11:05:48,807 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 11:05:48,807 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 11:05:48,903 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 11:05:48,904 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 11:05:48,904 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:05:48,905 INFO L158 Benchmark]: Toolchain (without parser) took 21375.03ms. Allocated memory was 167.8MB in the beginning and 673.2MB in the end (delta: 505.4MB). Free memory was 97.2MB in the beginning and 289.1MB in the end (delta: -191.8MB). Peak memory consumption was 315.8MB. Max. memory is 16.1GB. [2024-10-14 11:05:48,905 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:05:48,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.53ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 84.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 11:05:48,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.94ms. Allocated memory is still 167.8MB. Free memory was 84.0MB in the beginning and 82.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:05:48,906 INFO L158 Benchmark]: Boogie Preprocessor took 50.69ms. Allocated memory is still 167.8MB. Free memory was 82.0MB in the beginning and 79.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:05:48,906 INFO L158 Benchmark]: RCFGBuilder took 544.43ms. Allocated memory is still 167.8MB. Free memory was 79.8MB in the beginning and 121.0MB in the end (delta: -41.2MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-10-14 11:05:48,906 INFO L158 Benchmark]: TraceAbstraction took 20305.09ms. Allocated memory was 167.8MB in the beginning and 673.2MB in the end (delta: 505.4MB). Free memory was 120.3MB in the beginning and 295.3MB in the end (delta: -175.1MB). Peak memory consumption was 332.0MB. Max. memory is 16.1GB. [2024-10-14 11:05:48,907 INFO L158 Benchmark]: Witness Printer took 111.24ms. Allocated memory is still 673.2MB. Free memory was 295.3MB in the beginning and 289.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 11:05:48,908 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.53ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 84.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.94ms. Allocated memory is still 167.8MB. Free memory was 84.0MB in the beginning and 82.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.69ms. Allocated memory is still 167.8MB. Free memory was 82.0MB in the beginning and 79.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 544.43ms. Allocated memory is still 167.8MB. Free memory was 79.8MB in the beginning and 121.0MB in the end (delta: -41.2MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20305.09ms. Allocated memory was 167.8MB in the beginning and 673.2MB in the end (delta: 505.4MB). Free memory was 120.3MB in the beginning and 295.3MB in the end (delta: -175.1MB). Peak memory consumption was 332.0MB. Max. memory is 16.1GB. * Witness Printer took 111.24ms. Allocated memory is still 673.2MB. Free memory was 295.3MB in the beginning and 289.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 6, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 1127 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 779 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 634 IncrementalHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 348 mSDtfsCounter, 634 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=4, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 47 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 864 NumberOfCodeBlocks, 864 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 858 ConstructedInterpolants, 0 QuantifiedInterpolants, 3778 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 7556/7556 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: 105]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-14 11:05:48,948 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