./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-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-35.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a4c213194d0d302ccf39bf2760a513e73fc81c5efa3fff556483cb0c00b1161 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:55:12,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:55:12,588 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:55:12,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:55:12,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:55:12,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:55:12,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:55:12,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:55:12,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:55:12,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:55:12,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:55:12,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:55:12,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:55:12,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:55:12,625 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:55:12,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:55:12,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:55:12,625 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:55:12,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:55:12,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:55:12,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:55:12,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:55:12,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:55:12,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:55:12,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:55:12,630 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:55:12,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:55:12,630 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:55:12,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:55:12,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:55:12,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:55:12,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:55:12,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:55:12,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:55:12,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:55:12,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:55:12,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:55:12,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:55:12,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:55:12,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:55:12,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:55:12,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:55:12,634 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a4c213194d0d302ccf39bf2760a513e73fc81c5efa3fff556483cb0c00b1161 [2024-10-11 10:55:12,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:55:12,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:55:12,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:55:12,864 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:55:12,864 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:55:12,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-35.i [2024-10-11 10:55:14,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:55:14,537 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:55:14,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-35.i [2024-10-11 10:55:14,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/feb16dd66/699f372d94a5439d964faa29703fe531/FLAGcac1fc434 [2024-10-11 10:55:14,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/feb16dd66/699f372d94a5439d964faa29703fe531 [2024-10-11 10:55:14,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:55:14,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:55:14,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:55:14,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:55:14,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:55:14,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:55:14" (1/1) ... [2024-10-11 10:55:14,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65de5bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:14, skipping insertion in model container [2024-10-11 10:55:14,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:55:14" (1/1) ... [2024-10-11 10:55:14,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:55:14,736 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-35.i[916,929] [2024-10-11 10:55:14,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:55:14,782 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:55:14,792 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-35.i[916,929] [2024-10-11 10:55:14,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:55:14,819 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:55:14,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:14 WrapperNode [2024-10-11 10:55:14,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:55:14,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:55:14,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:55:14,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:55:14,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:14" (1/1) ... [2024-10-11 10:55:14,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:14" (1/1) ... [2024-10-11 10:55:14,867 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-10-11 10:55:14,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:55:14,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:55:14,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:55:14,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:55:14,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:14" (1/1) ... [2024-10-11 10:55:14,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:14" (1/1) ... [2024-10-11 10:55:14,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:14" (1/1) ... [2024-10-11 10:55:14,897 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:55:14,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:14" (1/1) ... [2024-10-11 10:55:14,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:14" (1/1) ... [2024-10-11 10:55:14,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:14" (1/1) ... [2024-10-11 10:55:14,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:14" (1/1) ... [2024-10-11 10:55:14,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:14" (1/1) ... [2024-10-11 10:55:14,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:14" (1/1) ... [2024-10-11 10:55:14,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:55:14,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:55:14,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:55:14,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:55:14,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:14" (1/1) ... [2024-10-11 10:55:14,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:55:14,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:55:14,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:55:14,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:55:15,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:55:15,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:55:15,003 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:55:15,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:55:15,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:55:15,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:55:15,059 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:55:15,060 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:55:15,327 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:55:15,328 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:55:15,376 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:55:15,376 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:55:15,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:15 BoogieIcfgContainer [2024-10-11 10:55:15,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:55:15,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:55:15,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:55:15,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:55:15,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:55:14" (1/3) ... [2024-10-11 10:55:15,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318d8dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:55:15, skipping insertion in model container [2024-10-11 10:55:15,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:14" (2/3) ... [2024-10-11 10:55:15,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318d8dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:55:15, skipping insertion in model container [2024-10-11 10:55:15,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:15" (3/3) ... [2024-10-11 10:55:15,386 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-35.i [2024-10-11 10:55:15,405 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:55:15,406 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:55:15,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:55:15,474 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;@52afef9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:55:15,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:55:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:55:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 10:55:15,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:15,494 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:15,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:15,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:15,499 INFO L85 PathProgramCache]: Analyzing trace with hash -594923374, now seen corresponding path program 1 times [2024-10-11 10:55:15,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:15,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159564256] [2024-10-11 10:55:15,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:15,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:15,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:55:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:55:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:55:15,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:15,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159564256] [2024-10-11 10:55:15,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159564256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:15,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:15,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:55:15,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812480022] [2024-10-11 10:55:15,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:15,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:55:15,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:15,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:55:15,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:55:15,923 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 10:55:15,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:15,969 INFO L93 Difference]: Finished difference Result 97 states and 174 transitions. [2024-10-11 10:55:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:55:15,974 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2024-10-11 10:55:15,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:15,981 INFO L225 Difference]: With dead ends: 97 [2024-10-11 10:55:15,981 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 10:55:15,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:55:15,987 INFO L432 NwaCegarLoop]: 70 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, 70 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-11 10:55:15,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:55:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 10:55:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 10:55:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:55:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 73 transitions. [2024-10-11 10:55:16,030 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 73 transitions. Word has length 121 [2024-10-11 10:55:16,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:16,030 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 73 transitions. [2024-10-11 10:55:16,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 10:55:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 73 transitions. [2024-10-11 10:55:16,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 10:55:16,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:16,033 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:16,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:55:16,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:16,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:16,034 INFO L85 PathProgramCache]: Analyzing trace with hash -553269102, now seen corresponding path program 1 times [2024-10-11 10:55:16,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:16,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122686444] [2024-10-11 10:55:16,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:16,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:55:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:55:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:16,267 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:55:16,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:16,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122686444] [2024-10-11 10:55:16,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122686444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:16,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:16,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:55:16,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63224312] [2024-10-11 10:55:16,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:16,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:55:16,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:16,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:55:16,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:55:16,277 INFO L87 Difference]: Start difference. First operand 48 states and 73 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:55:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:16,346 INFO L93 Difference]: Finished difference Result 140 states and 213 transitions. [2024-10-11 10:55:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:55:16,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-11 10:55:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:16,350 INFO L225 Difference]: With dead ends: 140 [2024-10-11 10:55:16,351 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 10:55:16,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:55:16,354 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 66 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:16,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 133 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:55:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 10:55:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 49. [2024-10-11 10:55:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:55:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2024-10-11 10:55:16,381 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 121 [2024-10-11 10:55:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:16,382 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2024-10-11 10:55:16,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:55:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2024-10-11 10:55:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 10:55:16,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:16,387 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:16,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:55:16,387 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:16,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:16,388 INFO L85 PathProgramCache]: Analyzing trace with hash -551422060, now seen corresponding path program 1 times [2024-10-11 10:55:16,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:16,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982861626] [2024-10-11 10:55:16,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:16,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:55:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:55:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:55:18,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:18,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982861626] [2024-10-11 10:55:18,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982861626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:18,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:18,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:55:18,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018617018] [2024-10-11 10:55:18,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:18,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:55:18,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:18,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:55:18,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:55:18,357 INFO L87 Difference]: Start difference. First operand 49 states and 73 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:55:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:18,584 INFO L93 Difference]: Finished difference Result 126 states and 183 transitions. [2024-10-11 10:55:18,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:55:18,585 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-11 10:55:18,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:18,589 INFO L225 Difference]: With dead ends: 126 [2024-10-11 10:55:18,589 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 10:55:18,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:55:18,591 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 37 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:18,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 331 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:55:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 10:55:18,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2024-10-11 10:55:18,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:55:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2024-10-11 10:55:18,605 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 121 [2024-10-11 10:55:18,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:18,606 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2024-10-11 10:55:18,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:55:18,606 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2024-10-11 10:55:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 10:55:18,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:18,612 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:18,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:55:18,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:18,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:18,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1223585302, now seen corresponding path program 1 times [2024-10-11 10:55:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:18,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664192672] [2024-10-11 10:55:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:18,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:55:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:55:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:55:20,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:20,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664192672] [2024-10-11 10:55:20,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664192672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:20,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:20,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:55:20,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143196266] [2024-10-11 10:55:20,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:20,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:55:20,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:20,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:55:20,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:55:20,038 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:55:20,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:20,237 INFO L93 Difference]: Finished difference Result 141 states and 201 transitions. [2024-10-11 10:55:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:55:20,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-11 10:55:20,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:20,239 INFO L225 Difference]: With dead ends: 141 [2024-10-11 10:55:20,239 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 10:55:20,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:55:20,240 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 25 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:20,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 337 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:55:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 10:55:20,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 58. [2024-10-11 10:55:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:55:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2024-10-11 10:55:20,246 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 121 [2024-10-11 10:55:20,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:20,246 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2024-10-11 10:55:20,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:55:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2024-10-11 10:55:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 10:55:20,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:20,248 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:20,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:55:20,248 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:20,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:20,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1166327000, now seen corresponding path program 1 times [2024-10-11 10:55:20,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:20,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823100522] [2024-10-11 10:55:20,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:20,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:55:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:55:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:55:21,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:21,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823100522] [2024-10-11 10:55:21,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823100522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:21,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:21,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:55:21,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610202453] [2024-10-11 10:55:21,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:21,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:55:21,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:21,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:55:21,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:55:21,545 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:55:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:21,725 INFO L93 Difference]: Finished difference Result 149 states and 209 transitions. [2024-10-11 10:55:21,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:55:21,725 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-11 10:55:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:21,730 INFO L225 Difference]: With dead ends: 149 [2024-10-11 10:55:21,730 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 10:55:21,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:55:21,732 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 41 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:21,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 261 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:55:21,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 10:55:21,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 58. [2024-10-11 10:55:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:55:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2024-10-11 10:55:21,737 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 121 [2024-10-11 10:55:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:21,737 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2024-10-11 10:55:21,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:55:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2024-10-11 10:55:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 10:55:21,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:21,739 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:21,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:55:21,739 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:21,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:21,740 INFO L85 PathProgramCache]: Analyzing trace with hash 128636310, now seen corresponding path program 1 times [2024-10-11 10:55:21,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:21,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489580733] [2024-10-11 10:55:21,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:21,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:55:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:55:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:55:21,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:21,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489580733] [2024-10-11 10:55:21,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489580733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:21,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:21,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:55:21,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618209368] [2024-10-11 10:55:21,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:21,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:55:21,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:21,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:55:21,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:55:21,804 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:55:21,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:21,823 INFO L93 Difference]: Finished difference Result 110 states and 162 transitions. [2024-10-11 10:55:21,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:55:21,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-11 10:55:21,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:21,824 INFO L225 Difference]: With dead ends: 110 [2024-10-11 10:55:21,825 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 10:55:21,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:55:21,825 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:21,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:55:21,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 10:55:21,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-11 10:55:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:55:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2024-10-11 10:55:21,837 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 121 [2024-10-11 10:55:21,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:21,837 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2024-10-11 10:55:21,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:55:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2024-10-11 10:55:21,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 10:55:21,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:21,838 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:21,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 10:55:21,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:21,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:21,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1756186411, now seen corresponding path program 1 times [2024-10-11 10:55:21,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:21,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038040642] [2024-10-11 10:55:21,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:21,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:55:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:55:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:55:23,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:23,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038040642] [2024-10-11 10:55:23,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038040642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:23,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:23,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:55:23,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460602235] [2024-10-11 10:55:23,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:23,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:55:23,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:23,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:55:23,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:55:23,997 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:55:24,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:24,394 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2024-10-11 10:55:24,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:55:24,395 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 122 [2024-10-11 10:55:24,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:24,396 INFO L225 Difference]: With dead ends: 68 [2024-10-11 10:55:24,396 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 10:55:24,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:55:24,397 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 31 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:24,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 302 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:55:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 10:55:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2024-10-11 10:55:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:55:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2024-10-11 10:55:24,403 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 122 [2024-10-11 10:55:24,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:24,403 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2024-10-11 10:55:24,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:55:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2024-10-11 10:55:24,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 10:55:24,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:24,405 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:24,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 10:55:24,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:24,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:24,406 INFO L85 PathProgramCache]: Analyzing trace with hash -790525675, now seen corresponding path program 1 times [2024-10-11 10:55:24,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:24,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109175959] [2024-10-11 10:55:24,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:24,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:55:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:55:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:55:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:55:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:55:26,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:26,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109175959] [2024-10-11 10:55:26,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109175959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:26,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:26,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 10:55:26,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672206173] [2024-10-11 10:55:26,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:26,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 10:55:26,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:26,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 10:55:26,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:55:26,695 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:55:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:27,082 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2024-10-11 10:55:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 10:55:27,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 122 [2024-10-11 10:55:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:27,084 INFO L225 Difference]: With dead ends: 72 [2024-10-11 10:55:27,084 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 10:55:27,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:55:27,086 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 29 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:27,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 275 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:55:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 10:55:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 10:55:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 10:55:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 10:55:27,091 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122 [2024-10-11 10:55:27,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:27,091 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 10:55:27,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:55:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 10:55:27,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 10:55:27,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:55:27,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 10:55:27,097 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:27,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 10:55:27,133 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:55:27,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:55:27 BoogieIcfgContainer [2024-10-11 10:55:27,145 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:55:27,145 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:55:27,145 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:55:27,145 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:55:27,146 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:15" (3/4) ... [2024-10-11 10:55:27,147 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 10:55:27,150 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 10:55:27,155 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 10:55:27,155 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 10:55:27,155 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 10:55:27,156 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 10:55:27,221 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 10:55:27,222 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 10:55:27,222 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:55:27,222 INFO L158 Benchmark]: Toolchain (without parser) took 12657.39ms. Allocated memory was 188.7MB in the beginning and 482.3MB in the end (delta: 293.6MB). Free memory was 120.1MB in the beginning and 267.1MB in the end (delta: -147.0MB). Peak memory consumption was 149.8MB. Max. memory is 16.1GB. [2024-10-11 10:55:27,222 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 78.6MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:55:27,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.90ms. Allocated memory is still 188.7MB. Free memory was 119.9MB in the beginning and 105.8MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 10:55:27,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.90ms. Allocated memory is still 188.7MB. Free memory was 105.8MB in the beginning and 103.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:55:27,223 INFO L158 Benchmark]: Boogie Preprocessor took 47.23ms. Allocated memory is still 188.7MB. Free memory was 103.2MB in the beginning and 100.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:55:27,223 INFO L158 Benchmark]: RCFGBuilder took 461.22ms. Allocated memory is still 188.7MB. Free memory was 100.2MB in the beginning and 146.8MB in the end (delta: -46.5MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-10-11 10:55:27,224 INFO L158 Benchmark]: TraceAbstraction took 11766.43ms. Allocated memory was 188.7MB in the beginning and 482.3MB in the end (delta: 293.6MB). Free memory was 146.2MB in the beginning and 272.3MB in the end (delta: -126.2MB). Peak memory consumption was 170.6MB. Max. memory is 16.1GB. [2024-10-11 10:55:27,224 INFO L158 Benchmark]: Witness Printer took 76.72ms. Allocated memory is still 482.3MB. Free memory was 272.3MB in the beginning and 267.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:55:27,225 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 78.6MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.90ms. Allocated memory is still 188.7MB. Free memory was 119.9MB in the beginning and 105.8MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.90ms. Allocated memory is still 188.7MB. Free memory was 105.8MB in the beginning and 103.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.23ms. Allocated memory is still 188.7MB. Free memory was 103.2MB in the beginning and 100.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 461.22ms. Allocated memory is still 188.7MB. Free memory was 100.2MB in the beginning and 146.8MB in the end (delta: -46.5MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11766.43ms. Allocated memory was 188.7MB in the beginning and 482.3MB in the end (delta: 293.6MB). Free memory was 146.2MB in the beginning and 272.3MB in the end (delta: -126.2MB). Peak memory consumption was 170.6MB. Max. memory is 16.1GB. * Witness Printer took 76.72ms. Allocated memory is still 482.3MB. Free memory was 272.3MB in the beginning and 267.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 8, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 1842 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1294 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 660 IncrementalHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 548 mSDtfsCounter, 660 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=4, InterpolantAutomatonStates: 52, 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, 8 MinimizatonAttempts, 136 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 970 NumberOfCodeBlocks, 970 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 962 ConstructedInterpolants, 0 QuantifiedInterpolants, 3848 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 6080/6080 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: 111]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-11 10:55:27,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE