./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-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76e63db8a1f11506a4aa82d105c50692fc5fb5205570dd5e3435037592a7b2ae --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:59:40,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:59:40,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:59:40,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:59:40,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:59:40,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:59:40,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:59:40,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:59:40,445 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:59:40,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:59:40,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:59:40,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:59:40,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:59:40,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:59:40,451 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:59:40,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:59:40,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:59:40,451 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:59:40,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:59:40,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:59:40,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:59:40,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:59:40,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:59:40,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:59:40,454 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:59:40,454 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:59:40,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:59:40,455 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:59:40,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:59:40,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:59:40,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:59:40,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:59:40,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:59:40,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:59:40,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:59:40,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:59:40,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:59:40,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:59:40,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:59:40,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:59:40,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:59:40,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:59:40,460 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76e63db8a1f11506a4aa82d105c50692fc5fb5205570dd5e3435037592a7b2ae [2024-10-24 08:59:40,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:59:40,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:59:40,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:59:40,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:59:40,698 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:59:40,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2024-10-24 08:59:41,888 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:59:42,052 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:59:42,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2024-10-24 08:59:42,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f93bec73/6c62be6e3bfc48878ca41a08102dd157/FLAG28acbc90e [2024-10-24 08:59:42,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f93bec73/6c62be6e3bfc48878ca41a08102dd157 [2024-10-24 08:59:42,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:59:42,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:59:42,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:59:42,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:59:42,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:59:42,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:59:42" (1/1) ... [2024-10-24 08:59:42,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12113adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:42, skipping insertion in model container [2024-10-24 08:59:42,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:59:42" (1/1) ... [2024-10-24 08:59:42,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:59:42,654 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-88.i[916,929] [2024-10-24 08:59:42,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:59:42,717 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:59:42,727 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-88.i[916,929] [2024-10-24 08:59:42,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:59:42,762 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:59:42,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:42 WrapperNode [2024-10-24 08:59:42,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:59:42,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:59:42,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:59:42,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:59:42,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:42" (1/1) ... [2024-10-24 08:59:42,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:42" (1/1) ... [2024-10-24 08:59:42,805 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-10-24 08:59:42,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:59:42,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:59:42,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:59:42,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:59:42,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:42" (1/1) ... [2024-10-24 08:59:42,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:42" (1/1) ... [2024-10-24 08:59:42,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:42" (1/1) ... [2024-10-24 08:59:42,829 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:59:42,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:42" (1/1) ... [2024-10-24 08:59:42,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:42" (1/1) ... [2024-10-24 08:59:42,833 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:42" (1/1) ... [2024-10-24 08:59:42,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:42" (1/1) ... [2024-10-24 08:59:42,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:42" (1/1) ... [2024-10-24 08:59:42,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:42" (1/1) ... [2024-10-24 08:59:42,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:59:42,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:59:42,840 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:59:42,840 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:59:42,841 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:42" (1/1) ... [2024-10-24 08:59:42,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:59:42,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:59:42,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:59:42,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:59:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:59:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:59:42,911 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:59:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:59:42,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:59:42,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:59:42,970 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:59:42,972 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:59:43,183 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-24 08:59:43,183 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:59:43,212 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:59:43,212 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:59:43,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:59:43 BoogieIcfgContainer [2024-10-24 08:59:43,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:59:43,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:59:43,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:59:43,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:59:43,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:59:42" (1/3) ... [2024-10-24 08:59:43,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66afc979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:59:43, skipping insertion in model container [2024-10-24 08:59:43,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:59:42" (2/3) ... [2024-10-24 08:59:43,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66afc979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:59:43, skipping insertion in model container [2024-10-24 08:59:43,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:59:43" (3/3) ... [2024-10-24 08:59:43,219 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-88.i [2024-10-24 08:59:43,232 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:59:43,233 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:59:43,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:59:43,287 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;@54e6a643, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:59:43,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:59:43,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 08:59:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 08:59:43,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:43,306 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:59:43,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:43,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:43,312 INFO L85 PathProgramCache]: Analyzing trace with hash 718731022, now seen corresponding path program 1 times [2024-10-24 08:59:43,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:43,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338104755] [2024-10-24 08:59:43,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:43,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:59:43,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:43,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338104755] [2024-10-24 08:59:43,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338104755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:43,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:43,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:59:43,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712524446] [2024-10-24 08:59:43,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:43,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:59:43,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:43,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:59:43,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:59:43,678 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 08:59:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:43,715 INFO L93 Difference]: Finished difference Result 103 states and 180 transitions. [2024-10-24 08:59:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:59:43,720 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 112 [2024-10-24 08:59:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:43,747 INFO L225 Difference]: With dead ends: 103 [2024-10-24 08:59:43,750 INFO L226 Difference]: Without dead ends: 51 [2024-10-24 08:59:43,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:59:43,755 INFO L432 NwaCegarLoop]: 74 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, 74 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:43,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:59:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-24 08:59:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-24 08:59:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 08:59:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 77 transitions. [2024-10-24 08:59:43,849 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 77 transitions. Word has length 112 [2024-10-24 08:59:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:43,850 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 77 transitions. [2024-10-24 08:59:43,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 08:59:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 77 transitions. [2024-10-24 08:59:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 08:59:43,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:43,854 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:59:43,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:59:43,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:43,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:43,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1374066766, now seen corresponding path program 1 times [2024-10-24 08:59:43,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:43,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827805735] [2024-10-24 08:59:43,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:43,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:59:44,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:44,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827805735] [2024-10-24 08:59:44,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827805735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:44,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:44,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:59:44,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919533893] [2024-10-24 08:59:44,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:44,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:59:44,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:44,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:59:44,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:59:44,501 INFO L87 Difference]: Start difference. First operand 51 states and 77 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:44,712 INFO L93 Difference]: Finished difference Result 152 states and 230 transitions. [2024-10-24 08:59:44,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:59:44,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2024-10-24 08:59:44,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:44,715 INFO L225 Difference]: With dead ends: 152 [2024-10-24 08:59:44,717 INFO L226 Difference]: Without dead ends: 102 [2024-10-24 08:59:44,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:59:44,718 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 53 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:44,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 197 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:59:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-24 08:59:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2024-10-24 08:59:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.290909090909091) internal successors, (71), 55 states have internal predecessors, (71), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 08:59:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 143 transitions. [2024-10-24 08:59:44,752 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 143 transitions. Word has length 112 [2024-10-24 08:59:44,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:44,753 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 143 transitions. [2024-10-24 08:59:44,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:44,753 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 143 transitions. [2024-10-24 08:59:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 08:59:44,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:44,757 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:59:44,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:59:44,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:44,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:44,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1766213212, now seen corresponding path program 1 times [2024-10-24 08:59:44,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:44,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984741967] [2024-10-24 08:59:44,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:44,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:44,999 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:59:44,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:45,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984741967] [2024-10-24 08:59:45,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984741967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:45,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:45,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:59:45,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958870405] [2024-10-24 08:59:45,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:45,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:59:45,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:45,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:59:45,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:59:45,003 INFO L87 Difference]: Start difference. First operand 94 states and 143 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:45,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:45,130 INFO L93 Difference]: Finished difference Result 160 states and 241 transitions. [2024-10-24 08:59:45,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:59:45,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-10-24 08:59:45,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:45,133 INFO L225 Difference]: With dead ends: 160 [2024-10-24 08:59:45,133 INFO L226 Difference]: Without dead ends: 102 [2024-10-24 08:59:45,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:59:45,134 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 50 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:45,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 201 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:59:45,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-24 08:59:45,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2024-10-24 08:59:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 08:59:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 143 transitions. [2024-10-24 08:59:45,150 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 143 transitions. Word has length 114 [2024-10-24 08:59:45,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:45,150 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 143 transitions. [2024-10-24 08:59:45,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 143 transitions. [2024-10-24 08:59:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 08:59:45,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:45,152 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:59:45,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:59:45,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:45,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:45,153 INFO L85 PathProgramCache]: Analyzing trace with hash -348892562, now seen corresponding path program 1 times [2024-10-24 08:59:45,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:45,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091835926] [2024-10-24 08:59:45,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:45,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:59:45,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:45,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091835926] [2024-10-24 08:59:45,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091835926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:45,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:45,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 08:59:45,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490369597] [2024-10-24 08:59:45,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:45,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:59:45,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:45,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:59:45,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:59:45,585 INFO L87 Difference]: Start difference. First operand 95 states and 143 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:45,877 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2024-10-24 08:59:45,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 08:59:45,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-10-24 08:59:45,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:45,882 INFO L225 Difference]: With dead ends: 185 [2024-10-24 08:59:45,883 INFO L226 Difference]: Without dead ends: 129 [2024-10-24 08:59:45,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-24 08:59:45,885 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 133 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:45,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 309 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:59:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-24 08:59:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 96. [2024-10-24 08:59:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 08:59:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 144 transitions. [2024-10-24 08:59:45,918 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 144 transitions. Word has length 116 [2024-10-24 08:59:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:45,919 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 144 transitions. [2024-10-24 08:59:45,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:45,920 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 144 transitions. [2024-10-24 08:59:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 08:59:45,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:45,923 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:59:45,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:59:45,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:45,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:45,924 INFO L85 PathProgramCache]: Analyzing trace with hash 352172016, now seen corresponding path program 1 times [2024-10-24 08:59:45,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:45,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341605695] [2024-10-24 08:59:45,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:45,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:59:48,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:48,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341605695] [2024-10-24 08:59:48,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341605695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:48,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:48,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:59:48,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956357391] [2024-10-24 08:59:48,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:48,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:59:48,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:48,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:59:48,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:59:48,552 INFO L87 Difference]: Start difference. First operand 96 states and 144 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:48,787 INFO L93 Difference]: Finished difference Result 125 states and 182 transitions. [2024-10-24 08:59:48,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 08:59:48,789 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-10-24 08:59:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:48,791 INFO L225 Difference]: With dead ends: 125 [2024-10-24 08:59:48,791 INFO L226 Difference]: Without dead ends: 123 [2024-10-24 08:59:48,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:59:48,792 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 30 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:48,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 235 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:59:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-24 08:59:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-10-24 08:59:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 79 states have internal predecessors, (99), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 08:59:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 179 transitions. [2024-10-24 08:59:48,819 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 179 transitions. Word has length 116 [2024-10-24 08:59:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:48,820 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 179 transitions. [2024-10-24 08:59:48,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2024-10-24 08:59:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 08:59:48,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:48,823 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:59:48,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 08:59:48,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:48,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash 100020389, now seen corresponding path program 1 times [2024-10-24 08:59:48,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:48,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816677718] [2024-10-24 08:59:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:48,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:59:49,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:49,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816677718] [2024-10-24 08:59:49,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816677718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:49,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:49,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 08:59:49,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066506385] [2024-10-24 08:59:49,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:49,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 08:59:49,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:49,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 08:59:49,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 08:59:49,595 INFO L87 Difference]: Start difference. First operand 122 states and 179 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 08:59:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:49,825 INFO L93 Difference]: Finished difference Result 204 states and 292 transitions. [2024-10-24 08:59:49,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 08:59:49,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 117 [2024-10-24 08:59:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:49,826 INFO L225 Difference]: With dead ends: 204 [2024-10-24 08:59:49,826 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 08:59:49,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:59:49,827 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 78 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:49,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 142 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:59:49,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 08:59:49,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 119. [2024-10-24 08:59:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 08:59:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2024-10-24 08:59:49,844 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 169 transitions. Word has length 117 [2024-10-24 08:59:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:49,844 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 169 transitions. [2024-10-24 08:59:49,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 08:59:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 169 transitions. [2024-10-24 08:59:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 08:59:49,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:49,846 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:59:49,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 08:59:49,846 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:49,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash -709326237, now seen corresponding path program 1 times [2024-10-24 08:59:49,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:49,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822768363] [2024-10-24 08:59:49,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:49,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:59:51,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:51,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822768363] [2024-10-24 08:59:51,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822768363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:51,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:51,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 08:59:51,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506830473] [2024-10-24 08:59:51,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:51,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 08:59:51,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:51,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 08:59:51,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:59:51,493 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:51,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:51,942 INFO L93 Difference]: Finished difference Result 212 states and 300 transitions. [2024-10-24 08:59:51,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 08:59:51,942 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2024-10-24 08:59:51,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:51,943 INFO L225 Difference]: With dead ends: 212 [2024-10-24 08:59:51,943 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 08:59:51,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-10-24 08:59:51,944 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 69 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:51,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 375 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:59:51,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 08:59:51,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 120. [2024-10-24 08:59:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 79 states have (on average 1.240506329113924) internal successors, (98), 79 states have internal predecessors, (98), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 08:59:51,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2024-10-24 08:59:51,964 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 117 [2024-10-24 08:59:51,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:51,964 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2024-10-24 08:59:51,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2024-10-24 08:59:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-10-24 08:59:51,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:59:51,967 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:59:51,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 08:59:51,967 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:59:51,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:59:51,967 INFO L85 PathProgramCache]: Analyzing trace with hash -836605756, now seen corresponding path program 1 times [2024-10-24 08:59:51,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:59:51,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773423801] [2024-10-24 08:59:51,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:59:51,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:59:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:59:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:59:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:59:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:59:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:59:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:59:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:59:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:59:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:59:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:59:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:59:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:59:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:59:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:59:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:59:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:59:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:59:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:59:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 08:59:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 08:59:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 08:59:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 08:59:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 08:59:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 08:59:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-24 08:59:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-24 08:59:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-24 08:59:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-24 08:59:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-24 08:59:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-24 08:59:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-24 08:59:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-24 08:59:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-24 08:59:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-24 08:59:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-24 08:59:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-24 08:59:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:59:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2558 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2024-10-24 08:59:54,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:59:54,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773423801] [2024-10-24 08:59:54,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773423801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:59:54,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:59:54,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:59:54,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879421023] [2024-10-24 08:59:54,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:59:54,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:59:54,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:59:54,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:59:54,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:59:54,569 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:54,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:59:54,839 INFO L93 Difference]: Finished difference Result 120 states and 170 transitions. [2024-10-24 08:59:54,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 08:59:54,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 227 [2024-10-24 08:59:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:59:54,841 INFO L225 Difference]: With dead ends: 120 [2024-10-24 08:59:54,841 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 08:59:54,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:59:54,842 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 23 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:59:54,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 293 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:59:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 08:59:54,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 08:59:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 08:59:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 08:59:54,843 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 227 [2024-10-24 08:59:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:59:54,843 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 08:59:54,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:59:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 08:59:54,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 08:59:54,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:59:54,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 08:59:54,849 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:59:54,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 08:59:56,259 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:59:56,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:59:56 BoogieIcfgContainer [2024-10-24 08:59:56,283 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:59:56,284 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:59:56,284 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:59:56,284 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:59:56,285 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:59:43" (3/4) ... [2024-10-24 08:59:56,286 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 08:59:56,289 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 08:59:56,295 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-24 08:59:56,295 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 08:59:56,295 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 08:59:56,295 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 08:59:56,384 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 08:59:56,387 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 08:59:56,387 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:59:56,389 INFO L158 Benchmark]: Toolchain (without parser) took 13937.29ms. Allocated memory was 142.6MB in the beginning and 610.3MB in the end (delta: 467.7MB). Free memory was 72.5MB in the beginning and 427.8MB in the end (delta: -355.2MB). Peak memory consumption was 114.7MB. Max. memory is 16.1GB. [2024-10-24 08:59:56,389 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 94.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:59:56,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.38ms. Allocated memory was 142.6MB in the beginning and 222.3MB in the end (delta: 79.7MB). Free memory was 72.2MB in the beginning and 191.2MB in the end (delta: -119.0MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-10-24 08:59:56,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.73ms. Allocated memory is still 222.3MB. Free memory was 191.2MB in the beginning and 188.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:59:56,390 INFO L158 Benchmark]: Boogie Preprocessor took 33.40ms. Allocated memory is still 222.3MB. Free memory was 188.1MB in the beginning and 186.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:59:56,390 INFO L158 Benchmark]: RCFGBuilder took 372.91ms. Allocated memory is still 222.3MB. Free memory was 186.0MB in the beginning and 164.0MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 08:59:56,390 INFO L158 Benchmark]: TraceAbstraction took 13069.23ms. Allocated memory was 222.3MB in the beginning and 610.3MB in the end (delta: 388.0MB). Free memory was 164.0MB in the beginning and 434.1MB in the end (delta: -270.1MB). Peak memory consumption was 336.0MB. Max. memory is 16.1GB. [2024-10-24 08:59:56,390 INFO L158 Benchmark]: Witness Printer took 103.24ms. Allocated memory is still 610.3MB. Free memory was 434.1MB in the beginning and 427.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 08:59:56,391 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.14ms. Allocated memory is still 142.6MB. Free memory is still 94.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.38ms. Allocated memory was 142.6MB in the beginning and 222.3MB in the end (delta: 79.7MB). Free memory was 72.2MB in the beginning and 191.2MB in the end (delta: -119.0MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.73ms. Allocated memory is still 222.3MB. Free memory was 191.2MB in the beginning and 188.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.40ms. Allocated memory is still 222.3MB. Free memory was 188.1MB in the beginning and 186.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.91ms. Allocated memory is still 222.3MB. Free memory was 186.0MB in the beginning and 164.0MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13069.23ms. Allocated memory was 222.3MB in the beginning and 610.3MB in the end (delta: 388.0MB). Free memory was 164.0MB in the beginning and 434.1MB in the end (delta: -270.1MB). Peak memory consumption was 336.0MB. Max. memory is 16.1GB. * Witness Printer took 103.24ms. Allocated memory is still 610.3MB. Free memory was 434.1MB in the beginning and 427.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 8, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 436 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 436 mSDsluCounter, 1826 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1232 mSDsCounter, 217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 713 IncrementalHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 217 mSolverCounterUnsat, 594 mSDtfsCounter, 713 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 416 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=5, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 84 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 1031 NumberOfCodeBlocks, 1031 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1023 ConstructedInterpolants, 0 QuantifiedInterpolants, 5634 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 6842/6842 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: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((128 <= ((var_1_7 >= 0) ? (var_1_7 % 256) : ((var_1_7 % 256) + 256))) && (((var_1_7 >= 0) ? (var_1_7 % 256) : ((var_1_7 % 256) + 256)) == (256 + var_1_8))) || ((((var_1_7 >= 0) ? (var_1_7 % 256) : ((var_1_7 % 256) + 256)) <= 127) && (((var_1_7 >= 0) ? (var_1_7 % 256) : ((var_1_7 % 256) + 256)) == var_1_8))) && ((var_1_9 + 1) <= var_1_7)) || ((var_1_7 <= var_1_9) && (((((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)) == var_1_8) && (((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)) <= 127)) || ((((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)) == (256 + var_1_8)) && (128 <= ((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256))))))) || (var_1_5 == 0)) && (var_1_1 == var_1_7)) && (0 == 0)) && ((((var_1_8 + 1) <= var_1_9) && (var_1_9 == var_1_7)) || (var_1_10 == ((((unsigned long long) 4294967295 * var_1_13) + var_1_11) % 4294967296)))) && (var_1_19 == var_1_18)) && ((((var_1_9 != var_1_7) || ((((var_1_11 + ((unsigned long long) 4294967295 * var_1_12)) + 1) % 4294967296) == var_1_10)) || (var_1_12 < ((long long) var_1_13 + 1))) || (var_1_1 < (var_1_8 + 1)))) && ((((var_1_13 < var_1_12) || (var_1_9 != var_1_7)) || (var_1_1 < (var_1_8 + 1))) || (var_1_10 == (((((unsigned long long) 4294967295 * var_1_13) + var_1_11) + 1) % 4294967296)))) && (((var_1_9 != var_1_7) && (var_1_7 <= var_1_9)) || (var_1_9 < 128))) && (((((var_1_8 + 1) <= 0) && (((long long) var_1_8 + var_1_14) == 0)) || ((0 <= var_1_8) && (var_1_8 == var_1_14))) || (((var_1_8 >= 0) ? (var_1_8 % 4294967296) : ((var_1_8 % 4294967296) + 4294967296)) < var_1_12))) && (2 == var_1_15)) && (var_1_17 == var_1_16)) || (((((((((((((16 + var_1_15) == 0) && ((((last_1_var_1_15 >= 0) ? (last_1_var_1_15 / 4294967296) : ((last_1_var_1_15 / 4294967296) - 1)) + 1) <= 0)) && (25 == var_1_10)) && (((var_1_9 != var_1_7) && (var_1_7 <= var_1_9)) || (var_1_9 < 128))) && (last_1_var_1_10 <= (41 + last_1_var_1_15))) && (0 <= 0)) && (last_1_var_1_18 <= 0)) && (((var_1_9 != var_1_7) || ((((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)) == var_1_8) && (((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)) <= 127))) || ((((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)) == (256 + var_1_8)) && (128 <= ((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)))))) && (25 <= last_1_var_1_10)) && (var_1_18 == 0)) && (var_1_5 == 0)) && (var_1_1 <= var_1_7))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((var_1_9 != var_1_7) && (var_1_7 <= var_1_9)) || (var_1_9 < 128)) Ensures: ((((var_1_9 != var_1_7) && (var_1_7 <= var_1_9)) || (var_1_9 < 128)) && ((((((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (var_1_19 == \old(var_1_19))) && (last_1_var_1_10 == \old(last_1_var_1_10))) && (last_1_var_1_15 == \old(last_1_var_1_15))) && (last_1_var_1_18 == \old(last_1_var_1_18)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 08:59:56,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE