./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-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-96.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 56998212cbbe54111cbc2f72cf7e227ae5158c3547e0f2e9eaace18cc5cee700 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:00:47,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:00:47,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:00:47,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:00:47,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:00:47,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:00:47,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:00:47,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:00:47,666 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:00:47,667 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:00:47,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:00:47,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:00:47,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:00:47,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:00:47,672 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:00:47,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:00:47,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:00:47,673 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:00:47,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:00:47,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:00:47,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:00:47,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:00:47,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:00:47,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:00:47,678 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:00:47,679 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:00:47,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:00:47,679 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:00:47,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:00:47,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:00:47,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:00:47,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:00:47,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:00:47,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:00:47,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:00:47,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:00:47,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:00:47,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:00:47,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:00:47,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:00:47,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:00:47,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:00:47,682 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 -> 56998212cbbe54111cbc2f72cf7e227ae5158c3547e0f2e9eaace18cc5cee700 [2024-10-24 09:00:47,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:00:47,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:00:47,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:00:47,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:00:47,946 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:00:47,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-96.i [2024-10-24 09:00:49,392 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:00:49,600 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:00:49,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-96.i [2024-10-24 09:00:49,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2adaf5339/aca0d79794b940989182a2e2ea3adaee/FLAG8a3b660ac [2024-10-24 09:00:49,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2adaf5339/aca0d79794b940989182a2e2ea3adaee [2024-10-24 09:00:49,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:00:49,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:00:49,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:00:49,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:00:49,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:00:49,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:00:49" (1/1) ... [2024-10-24 09:00:49,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281d748b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:49, skipping insertion in model container [2024-10-24 09:00:49,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:00:49" (1/1) ... [2024-10-24 09:00:49,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:00:49,839 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-96.i[916,929] [2024-10-24 09:00:49,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:00:49,902 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:00:49,914 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-96.i[916,929] [2024-10-24 09:00:49,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:00:49,949 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:00:49,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:49 WrapperNode [2024-10-24 09:00:49,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:00:49,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:00:49,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:00:49,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:00:49,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:49" (1/1) ... [2024-10-24 09:00:49,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:49" (1/1) ... [2024-10-24 09:00:50,007 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-10-24 09:00:50,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:00:50,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:00:50,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:00:50,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:00:50,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:49" (1/1) ... [2024-10-24 09:00:50,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:49" (1/1) ... [2024-10-24 09:00:50,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:49" (1/1) ... [2024-10-24 09:00:50,042 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-24 09:00:50,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:49" (1/1) ... [2024-10-24 09:00:50,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:49" (1/1) ... [2024-10-24 09:00:50,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:49" (1/1) ... [2024-10-24 09:00:50,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:49" (1/1) ... [2024-10-24 09:00:50,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:49" (1/1) ... [2024-10-24 09:00:50,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:49" (1/1) ... [2024-10-24 09:00:50,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:00:50,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:00:50,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:00:50,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:00:50,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:49" (1/1) ... [2024-10-24 09:00:50,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:00:50,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:00:50,109 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-24 09:00:50,113 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-24 09:00:50,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:00:50,159 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:00:50,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:00:50,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:00:50,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:00:50,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:00:50,258 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:00:50,262 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:00:50,506 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 09:00:50,507 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:00:50,572 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:00:50,573 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:00:50,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:00:50 BoogieIcfgContainer [2024-10-24 09:00:50,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:00:50,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:00:50,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:00:50,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:00:50,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:00:49" (1/3) ... [2024-10-24 09:00:50,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c884348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:00:50, skipping insertion in model container [2024-10-24 09:00:50,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:00:49" (2/3) ... [2024-10-24 09:00:50,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c884348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:00:50, skipping insertion in model container [2024-10-24 09:00:50,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:00:50" (3/3) ... [2024-10-24 09:00:50,584 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-96.i [2024-10-24 09:00:50,597 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:00:50,597 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:00:50,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:00:50,667 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;@3074960, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:00:50,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:00:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 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-24 09:00:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 09:00:50,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:00:50,681 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-24 09:00:50,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:00:50,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:00:50,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1898360507, now seen corresponding path program 1 times [2024-10-24 09:00:50,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:00:50,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172224966] [2024-10-24 09:00:50,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:00:50,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:00:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:50,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:00:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:00:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:00:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:00:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:00:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:00:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:00:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:00:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:00:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:00:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:00:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:00:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:00:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:00:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:00:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:00:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:00:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 09:00:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:51,129 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-24 09:00:51,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:00:51,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172224966] [2024-10-24 09:00:51,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172224966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:00:51,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:00:51,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:00:51,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908513325] [2024-10-24 09:00:51,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:00:51,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:00:51,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:00:51,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:00:51,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:00:51,168 INFO L87 Difference]: Start difference. First operand has 48 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-24 09:00:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:00:51,223 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2024-10-24 09:00:51,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:00:51,231 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (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 109 [2024-10-24 09:00:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:00:51,240 INFO L225 Difference]: With dead ends: 93 [2024-10-24 09:00:51,240 INFO L226 Difference]: Without dead ends: 46 [2024-10-24 09:00:51,243 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-24 09:00:51,246 INFO L432 NwaCegarLoop]: 66 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, 66 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-24 09:00:51,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:00:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-24 09:00:51,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-24 09:00:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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-24 09:00:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2024-10-24 09:00:51,293 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 69 transitions. Word has length 109 [2024-10-24 09:00:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:00:51,294 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 69 transitions. [2024-10-24 09:00:51,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (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-24 09:00:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2024-10-24 09:00:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 09:00:51,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:00:51,300 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-24 09:00:51,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:00:51,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:00:51,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:00:51,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2022651909, now seen corresponding path program 1 times [2024-10-24 09:00:51,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:00:51,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629826881] [2024-10-24 09:00:51,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:00:51,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:00:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:00:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:00:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:00:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:00:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:00:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:00:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:00:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:00:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:00:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:00:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:00:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:00:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:00:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:00:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:00:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:00:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:00:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 09:00:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,468 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-24 09:00:53,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:00:53,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629826881] [2024-10-24 09:00:53,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629826881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:00:53,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:00:53,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 09:00:53,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482125089] [2024-10-24 09:00:53,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:00:53,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:00:53,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:00:53,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:00:53,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:00:53,473 INFO L87 Difference]: Start difference. First operand 46 states and 69 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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-24 09:00:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:00:53,627 INFO L93 Difference]: Finished difference Result 110 states and 163 transitions. [2024-10-24 09:00:53,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 09:00:53,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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-24 09:00:53,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:00:53,633 INFO L225 Difference]: With dead ends: 110 [2024-10-24 09:00:53,633 INFO L226 Difference]: Without dead ends: 65 [2024-10-24 09:00:53,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:00:53,636 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 19 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:00:53,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 237 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:00:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-24 09:00:53,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2024-10-24 09:00:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 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-24 09:00:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2024-10-24 09:00:53,651 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 109 [2024-10-24 09:00:53,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:00:53,653 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2024-10-24 09:00:53,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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-24 09:00:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2024-10-24 09:00:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 09:00:53,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:00:53,656 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-24 09:00:53,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:00:53,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:00:53,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:00:53,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1462968761, now seen corresponding path program 1 times [2024-10-24 09:00:53,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:00:53,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010046385] [2024-10-24 09:00:53,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:00:53,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:00:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:00:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:00:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:00:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:00:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:00:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:00:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:00:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:00:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:00:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:00:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:00:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:00:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:00:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:00:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:00:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:00:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:00:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 09:00:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:53,840 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-24 09:00:53,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:00:53,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010046385] [2024-10-24 09:00:53,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010046385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:00:53,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:00:53,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:00:53,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109066090] [2024-10-24 09:00:53,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:00:53,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:00:53,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:00:53,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:00:53,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:00:53,843 INFO L87 Difference]: Start difference. First operand 54 states and 80 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-24 09:00:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:00:53,963 INFO L93 Difference]: Finished difference Result 162 states and 237 transitions. [2024-10-24 09:00:53,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:00:53,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-24 09:00:53,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:00:53,967 INFO L225 Difference]: With dead ends: 162 [2024-10-24 09:00:53,967 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 09:00:53,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-24 09:00:53,970 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 55 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:00:53,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 189 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:00:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 09:00:53,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2024-10-24 09:00:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 61 states have internal predecessors, (76), 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-24 09:00:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 148 transitions. [2024-10-24 09:00:53,996 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 148 transitions. Word has length 109 [2024-10-24 09:00:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:00:53,998 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 148 transitions. [2024-10-24 09:00:53,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-24 09:00:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 148 transitions. [2024-10-24 09:00:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 09:00:54,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:00:54,000 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, 1] [2024-10-24 09:00:54,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:00:54,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:00:54,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:00:54,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1417779193, now seen corresponding path program 1 times [2024-10-24 09:00:54,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:00:54,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928119499] [2024-10-24 09:00:54,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:00:54,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:00:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:00:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:00:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:00:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:00:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:00:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:00:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:00:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:00:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:00:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:00:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:00:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:00:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:00:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:00:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:00:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:00:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:00:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 09:00:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:56,714 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-24 09:00:56,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:00:56,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928119499] [2024-10-24 09:00:56,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928119499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:00:56,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:00:56,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 09:00:56,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183756666] [2024-10-24 09:00:56,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:00:56,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 09:00:56,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:00:56,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 09:00:56,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:00:56,719 INFO L87 Difference]: Start difference. First operand 100 states and 148 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-24 09:00:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:00:56,847 INFO L93 Difference]: Finished difference Result 205 states and 302 transitions. [2024-10-24 09:00:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 09:00:56,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 110 [2024-10-24 09:00:56,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:00:56,850 INFO L225 Difference]: With dead ends: 205 [2024-10-24 09:00:56,852 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 09:00:56,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:00:56,856 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 8 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:00:56,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 214 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:00:56,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 09:00:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2024-10-24 09:00:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 56 states have internal predecessors, (68), 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-24 09:00:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 140 transitions. [2024-10-24 09:00:56,873 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 140 transitions. Word has length 110 [2024-10-24 09:00:56,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:00:56,874 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 140 transitions. [2024-10-24 09:00:56,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-24 09:00:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 140 transitions. [2024-10-24 09:00:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-24 09:00:56,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:00:56,878 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, 1, 1, 1] [2024-10-24 09:00:56,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:00:56,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:00:56,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:00:56,879 INFO L85 PathProgramCache]: Analyzing trace with hash -914970014, now seen corresponding path program 1 times [2024-10-24 09:00:56,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:00:56,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991485571] [2024-10-24 09:00:56,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:00:56,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:00:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:00:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:00:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:00:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:00:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:00:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:00:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:00:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:00:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:00:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:00:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:00:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:00:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:00:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:00:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:00:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:00:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:00:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 09:00:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:00:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 09:00:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 09:00:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 09:00:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 09:00:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 09:00:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 09:00:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 09:00:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 09:00:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 09:00:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-24 09:00:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 09:00:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-24 09:00:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-24 09:00:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-24 09:00:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-24 09:00:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 09:00:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-24 09:00:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:00:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2555 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2549 trivial. 0 not checked. [2024-10-24 09:00:58,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:00:58,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991485571] [2024-10-24 09:00:58,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991485571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:00:58,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:00:58,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 09:00:58,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799817521] [2024-10-24 09:00:58,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:00:58,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:00:58,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:00:58,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:00:58,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:00:58,545 INFO L87 Difference]: Start difference. First operand 95 states and 140 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-24 09:00:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:00:58,688 INFO L93 Difference]: Finished difference Result 156 states and 229 transitions. [2024-10-24 09:00:58,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 09:00:58,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 219 [2024-10-24 09:00:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:00:58,690 INFO L225 Difference]: With dead ends: 156 [2024-10-24 09:00:58,693 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 09:00:58,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:00:58,694 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 19 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:00:58,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 238 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:00:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 09:00:58,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2024-10-24 09:00:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 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-24 09:00:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 138 transitions. [2024-10-24 09:00:58,714 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 138 transitions. Word has length 219 [2024-10-24 09:00:58,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:00:58,715 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 138 transitions. [2024-10-24 09:00:58,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-24 09:00:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 138 transitions. [2024-10-24 09:00:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-24 09:00:58,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:00:58,720 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:00:58,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 09:00:58,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:00:58,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:00:58,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2005221706, now seen corresponding path program 1 times [2024-10-24 09:00:58,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:00:58,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936562132] [2024-10-24 09:00:58,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:00:58,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:00:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:01:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:01:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:01:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:01:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:01:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:01:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:01:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:01:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:01:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:01:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:01:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:01:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:01:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:01:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:01:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:01:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:01:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 09:01:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:01:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 09:01:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 09:01:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 09:01:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 09:01:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 09:01:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 09:01:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 09:01:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 09:01:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 09:01:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-24 09:01:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 09:01:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-24 09:01:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-24 09:01:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-24 09:01:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-24 09:01:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-24 09:01:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-24 09:01:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:01:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2549 trivial. 0 not checked. [2024-10-24 09:01:00,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:01:00,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936562132] [2024-10-24 09:01:00,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936562132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:01:00,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:01:00,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 09:01:00,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526255487] [2024-10-24 09:01:00,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:01:00,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 09:01:00,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:01:00,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 09:01:00,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:01:00,431 INFO L87 Difference]: Start difference. First operand 94 states and 138 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-24 09:01:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:01:00,588 INFO L93 Difference]: Finished difference Result 150 states and 220 transitions. [2024-10-24 09:01:00,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 09:01:00,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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 220 [2024-10-24 09:01:00,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:01:00,590 INFO L225 Difference]: With dead ends: 150 [2024-10-24 09:01:00,590 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 09:01:00,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:01:00,591 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 11 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:01:00,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 222 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:01:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 09:01:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 09:01:00,593 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-24 09:01:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 09:01:00,594 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2024-10-24 09:01:00,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:01:00,594 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 09:01:00,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-24 09:01:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 09:01:00,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 09:01:00,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:01:00,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 09:01:00,601 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 09:01:00,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 09:01:00,656 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:01:00,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:01:00 BoogieIcfgContainer [2024-10-24 09:01:00,676 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:01:00,677 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:01:00,677 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:01:00,677 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:01:00,678 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:00:50" (3/4) ... [2024-10-24 09:01:00,679 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 09:01:00,683 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 09:01:00,687 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-24 09:01:00,688 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 09:01:00,688 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 09:01:00,688 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 09:01:00,801 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 09:01:00,801 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 09:01:00,801 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:01:00,802 INFO L158 Benchmark]: Toolchain (without parser) took 11178.10ms. Allocated memory was 172.0MB in the beginning and 522.2MB in the end (delta: 350.2MB). Free memory was 142.3MB in the beginning and 408.4MB in the end (delta: -266.1MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2024-10-24 09:01:00,803 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 83.9MB in the beginning and 83.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:01:00,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.44ms. Allocated memory is still 172.0MB. Free memory was 142.3MB in the beginning and 127.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 09:01:00,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.77ms. Allocated memory is still 172.0MB. Free memory was 127.6MB in the beginning and 124.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:01:00,803 INFO L158 Benchmark]: Boogie Preprocessor took 59.26ms. Allocated memory is still 172.0MB. Free memory was 124.8MB in the beginning and 120.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:01:00,804 INFO L158 Benchmark]: RCFGBuilder took 504.86ms. Allocated memory is still 172.0MB. Free memory was 120.6MB in the beginning and 100.4MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 09:01:00,804 INFO L158 Benchmark]: TraceAbstraction took 10100.71ms. Allocated memory was 172.0MB in the beginning and 522.2MB in the end (delta: 350.2MB). Free memory was 99.6MB in the beginning and 413.7MB in the end (delta: -314.0MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2024-10-24 09:01:00,804 INFO L158 Benchmark]: Witness Printer took 124.62ms. Allocated memory is still 522.2MB. Free memory was 413.7MB in the beginning and 408.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 09:01:00,806 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 83.9MB in the beginning and 83.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.44ms. Allocated memory is still 172.0MB. Free memory was 142.3MB in the beginning and 127.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.77ms. Allocated memory is still 172.0MB. Free memory was 127.6MB in the beginning and 124.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.26ms. Allocated memory is still 172.0MB. Free memory was 124.8MB in the beginning and 120.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 504.86ms. Allocated memory is still 172.0MB. Free memory was 120.6MB in the beginning and 100.4MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10100.71ms. Allocated memory was 172.0MB in the beginning and 522.2MB in the end (delta: 350.2MB). Free memory was 99.6MB in the beginning and 413.7MB in the end (delta: -314.0MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * Witness Printer took 124.62ms. Allocated memory is still 522.2MB. Free memory was 413.7MB in the beginning and 408.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 6, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 1166 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 779 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 293 IncrementalHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 387 mSDtfsCounter, 293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=3, InterpolantAutomatonStates: 32, 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, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 876 NumberOfCodeBlocks, 876 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 870 ConstructedInterpolants, 0 QuantifiedInterpolants, 1920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 7559/7559 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: 106]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (last_1_var_1_5 == \old(last_1_var_1_5))) RESULT: Ultimate proved your program to be correct! [2024-10-24 09:01:00,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE