./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-97.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 3ba38ef6acc82fdb63f92a7590a6e53b41a3fa91ed0f40b85a8a30577d3cb67b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:20:01,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:20:02,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:20:02,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:20:02,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:20:02,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:20:02,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:20:02,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:20:02,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:20:02,053 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:20:02,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:20:02,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:20:02,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:20:02,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:20:02,056 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:20:02,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:20:02,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:20:02,057 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:20:02,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:20:02,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:20:02,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:20:02,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:20:02,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:20:02,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:20:02,062 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:20:02,062 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:20:02,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:20:02,062 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:20:02,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:20:02,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:20:02,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:20:02,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:20:02,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:20:02,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:20:02,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:20:02,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:20:02,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:20:02,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:20:02,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:20:02,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:20:02,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:20:02,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:20:02,065 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 -> 3ba38ef6acc82fdb63f92a7590a6e53b41a3fa91ed0f40b85a8a30577d3cb67b [2024-11-10 08:20:02,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:20:02,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:20:02,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:20:02,289 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:20:02,289 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:20:02,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-97.i [2024-11-10 08:20:03,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:20:03,902 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:20:03,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-97.i [2024-11-10 08:20:03,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25b668486/24d777221a5d45d9ba1355187f9e5ce4/FLAGd50886cd3 [2024-11-10 08:20:03,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25b668486/24d777221a5d45d9ba1355187f9e5ce4 [2024-11-10 08:20:03,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:20:03,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:20:03,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:20:03,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:20:03,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:20:03,944 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:20:03" (1/1) ... [2024-11-10 08:20:03,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183ae755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:03, skipping insertion in model container [2024-11-10 08:20:03,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:20:03" (1/1) ... [2024-11-10 08:20:03,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:20:04,108 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-97.i[915,928] [2024-11-10 08:20:04,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:20:04,150 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:20:04,159 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-97.i[915,928] [2024-11-10 08:20:04,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:20:04,186 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:20:04,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:04 WrapperNode [2024-11-10 08:20:04,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:20:04,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:20:04,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:20:04,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:20:04,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:04" (1/1) ... [2024-11-10 08:20:04,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:04" (1/1) ... [2024-11-10 08:20:04,217 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-11-10 08:20:04,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:20:04,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:20:04,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:20:04,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:20:04,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:04" (1/1) ... [2024-11-10 08:20:04,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:04" (1/1) ... [2024-11-10 08:20:04,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:04" (1/1) ... [2024-11-10 08:20:04,240 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:20:04,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:04" (1/1) ... [2024-11-10 08:20:04,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:04" (1/1) ... [2024-11-10 08:20:04,243 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:04" (1/1) ... [2024-11-10 08:20:04,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:04" (1/1) ... [2024-11-10 08:20:04,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:04" (1/1) ... [2024-11-10 08:20:04,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:04" (1/1) ... [2024-11-10 08:20:04,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:20:04,247 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:20:04,247 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:20:04,247 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:20:04,248 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:04" (1/1) ... [2024-11-10 08:20:04,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:20:04,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:20:04,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:20:04,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:20:04,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:20:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:20:04,340 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:20:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:20:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:20:04,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:20:04,399 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:20:04,402 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:20:04,540 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L63: havoc property_#t~ite11#1;havoc property_#t~bitwise10#1; [2024-11-10 08:20:04,566 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-10 08:20:04,566 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:20:04,584 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:20:04,585 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:20:04,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:20:04 BoogieIcfgContainer [2024-11-10 08:20:04,585 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:20:04,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:20:04,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:20:04,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:20:04,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:20:03" (1/3) ... [2024-11-10 08:20:04,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5bb096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:20:04, skipping insertion in model container [2024-11-10 08:20:04,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:04" (2/3) ... [2024-11-10 08:20:04,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5bb096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:20:04, skipping insertion in model container [2024-11-10 08:20:04,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:20:04" (3/3) ... [2024-11-10 08:20:04,592 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-97.i [2024-11-10 08:20:04,605 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:20:04,606 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:20:04,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:20:04,657 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;@2bc0fd47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:20:04,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:20:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:20:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 08:20:04,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:20:04,670 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:20:04,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:20:04,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:20:04,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1479095150, now seen corresponding path program 1 times [2024-11-10 08:20:04,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:20:04,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211786348] [2024-11-10 08:20:04,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:20:04,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:20:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:04,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:20:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:04,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:20:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:04,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:20:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:04,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:20:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:04,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:20:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:04,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:20:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:04,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:20:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:04,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:20:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:04,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:20:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:04,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:20:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:20:04,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:20:04,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211786348] [2024-11-10 08:20:04,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211786348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:20:04,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:20:04,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:20:04,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426688720] [2024-11-10 08:20:04,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:20:04,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:20:04,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:20:04,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:20:04,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:20:04,969 INFO L87 Difference]: Start difference. First operand has 49 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-10 08:20:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:20:04,993 INFO L93 Difference]: Finished difference Result 90 states and 139 transitions. [2024-11-10 08:20:04,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:20:04,996 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2024-11-10 08:20:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:20:05,001 INFO L225 Difference]: With dead ends: 90 [2024-11-10 08:20:05,001 INFO L226 Difference]: Without dead ends: 44 [2024-11-10 08:20:05,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:20:05,007 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:20:05,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:20:05,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-10 08:20:05,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-10 08:20:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 08:20:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2024-11-10 08:20:05,039 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 71 [2024-11-10 08:20:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:20:05,039 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2024-11-10 08:20:05,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-10 08:20:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2024-11-10 08:20:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 08:20:05,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:20:05,043 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:20:05,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:20:05,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:20:05,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:20:05,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1321396530, now seen corresponding path program 1 times [2024-11-10 08:20:05,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:20:05,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236517667] [2024-11-10 08:20:05,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:20:05,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:20:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:05,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:20:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:05,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:20:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:05,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:20:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:05,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:20:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:05,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:20:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:05,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:20:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:05,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:20:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:05,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:20:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:05,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:20:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:05,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:20:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:20:05,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:20:05,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236517667] [2024-11-10 08:20:05,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236517667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:20:05,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:20:05,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:20:05,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414978085] [2024-11-10 08:20:05,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:20:05,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:20:05,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:20:05,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:20:05,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:20:05,882 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:06,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:20:06,166 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2024-11-10 08:20:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:20:06,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2024-11-10 08:20:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:20:06,168 INFO L225 Difference]: With dead ends: 76 [2024-11-10 08:20:06,168 INFO L226 Difference]: Without dead ends: 73 [2024-11-10 08:20:06,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:20:06,170 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 33 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:20:06,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 329 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:20:06,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-10 08:20:06,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2024-11-10 08:20:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 53 states have internal predecessors, (64), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 08:20:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2024-11-10 08:20:06,191 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 71 [2024-11-10 08:20:06,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:20:06,192 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2024-11-10 08:20:06,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2024-11-10 08:20:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-10 08:20:06,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:20:06,195 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:20:06,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:20:06,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:20:06,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:20:06,196 INFO L85 PathProgramCache]: Analyzing trace with hash -521303357, now seen corresponding path program 1 times [2024-11-10 08:20:06,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:20:06,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31753395] [2024-11-10 08:20:06,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:20:06,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:20:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:20:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:20:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:20:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:20:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:20:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:20:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:20:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:20:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:20:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:20:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,299 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:20:06,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:20:06,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31753395] [2024-11-10 08:20:06,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31753395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:20:06,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:20:06,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:20:06,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999564911] [2024-11-10 08:20:06,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:20:06,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:20:06,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:20:06,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:20:06,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:20:06,304 INFO L87 Difference]: Start difference. First operand 69 states and 92 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, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:06,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:20:06,367 INFO L93 Difference]: Finished difference Result 142 states and 188 transitions. [2024-11-10 08:20:06,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:20:06,368 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, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2024-11-10 08:20:06,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:20:06,370 INFO L225 Difference]: With dead ends: 142 [2024-11-10 08:20:06,371 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 08:20:06,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:20:06,373 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:20:06,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 137 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:20:06,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 08:20:06,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2024-11-10 08:20:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 53 states have internal predecessors, (63), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 08:20:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-11-10 08:20:06,393 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 72 [2024-11-10 08:20:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:20:06,393 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-11-10 08:20:06,393 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, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-11-10 08:20:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 08:20:06,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:20:06,396 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:20:06,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:20:06,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:20:06,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:20:06,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1021233735, now seen corresponding path program 1 times [2024-11-10 08:20:06,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:20:06,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065261739] [2024-11-10 08:20:06,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:20:06,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:20:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:20:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:20:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:20:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:20:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:20:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:20:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:20:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:20:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:20:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:20:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:20:06,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:20:06,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065261739] [2024-11-10 08:20:06,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065261739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:20:06,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:20:06,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:20:06,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271273269] [2024-11-10 08:20:06,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:20:06,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:20:06,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:20:06,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:20:06,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:20:06,510 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:20:06,578 INFO L93 Difference]: Finished difference Result 131 states and 172 transitions. [2024-11-10 08:20:06,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:20:06,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2024-11-10 08:20:06,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:20:06,580 INFO L225 Difference]: With dead ends: 131 [2024-11-10 08:20:06,580 INFO L226 Difference]: Without dead ends: 65 [2024-11-10 08:20:06,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:20:06,582 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 9 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:20:06,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 132 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:20:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-10 08:20:06,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2024-11-10 08:20:06,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 46 states have internal predecessors, (52), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 08:20:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2024-11-10 08:20:06,593 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 73 [2024-11-10 08:20:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:20:06,593 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2024-11-10 08:20:06,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2024-11-10 08:20:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-10 08:20:06,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:20:06,595 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:20:06,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 08:20:06,595 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:20:06,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:20:06,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1111627004, now seen corresponding path program 1 times [2024-11-10 08:20:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:20:06,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707073296] [2024-11-10 08:20:06,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:20:06,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:20:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:20:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:20:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:20:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:20:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:20:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:20:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:20:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:20:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:20:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:20:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,703 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 08:20:06,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:20:06,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707073296] [2024-11-10 08:20:06,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707073296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:20:06,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:20:06,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:20:06,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20124960] [2024-11-10 08:20:06,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:20:06,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:20:06,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:20:06,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:20:06,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:20:06,705 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:20:06,754 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2024-11-10 08:20:06,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:20:06,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 74 [2024-11-10 08:20:06,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:20:06,755 INFO L225 Difference]: With dead ends: 75 [2024-11-10 08:20:06,755 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:20:06,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:20:06,757 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 24 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:20:06,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 316 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:20:06,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:20:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:20:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 08:20:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:20:06,758 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2024-11-10 08:20:06,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:20:06,758 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:20:06,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 08:20:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:20:06,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:20:06,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:20:06,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 08:20:06,763 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 08:20:06,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 08:20:06,879 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:20:06,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:20:06 BoogieIcfgContainer [2024-11-10 08:20:06,899 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:20:06,900 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:20:06,900 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:20:06,900 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:20:06,901 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:20:04" (3/4) ... [2024-11-10 08:20:06,902 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 08:20:06,905 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 08:20:06,911 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 08:20:06,911 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 08:20:06,911 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 08:20:06,911 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 08:20:07,004 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 08:20:07,005 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 08:20:07,005 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:20:07,005 INFO L158 Benchmark]: Toolchain (without parser) took 3069.57ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 149.2MB in the beginning and 112.6MB in the end (delta: 36.6MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2024-11-10 08:20:07,006 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory was 92.3MB in the beginning and 92.1MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:20:07,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.52ms. Allocated memory is still 178.3MB. Free memory was 149.2MB in the beginning and 135.8MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:20:07,006 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.57ms. Allocated memory is still 178.3MB. Free memory was 135.8MB in the beginning and 133.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:20:07,006 INFO L158 Benchmark]: Boogie Preprocessor took 28.67ms. Allocated memory is still 178.3MB. Free memory was 133.7MB in the beginning and 132.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:20:07,006 INFO L158 Benchmark]: IcfgBuilder took 338.18ms. Allocated memory is still 178.3MB. Free memory was 132.6MB in the beginning and 116.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 08:20:07,007 INFO L158 Benchmark]: TraceAbstraction took 2312.69ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 115.9MB in the beginning and 117.8MB in the end (delta: -1.9MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-11-10 08:20:07,007 INFO L158 Benchmark]: Witness Printer took 105.06ms. Allocated memory is still 213.9MB. Free memory was 117.8MB in the beginning and 112.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 08:20:07,008 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 130.0MB. Free memory was 92.3MB in the beginning and 92.1MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.52ms. Allocated memory is still 178.3MB. Free memory was 149.2MB in the beginning and 135.8MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.57ms. Allocated memory is still 178.3MB. Free memory was 135.8MB in the beginning and 133.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.67ms. Allocated memory is still 178.3MB. Free memory was 133.7MB in the beginning and 132.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 338.18ms. Allocated memory is still 178.3MB. Free memory was 132.6MB in the beginning and 116.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2312.69ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 115.9MB in the beginning and 117.8MB in the end (delta: -1.9MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * Witness Printer took 105.06ms. Allocated memory is still 213.9MB. Free memory was 117.8MB in the beginning and 112.6MB in the end (delta: 5.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, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 972 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 656 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 183 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 316 mSDtfsCounter, 183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=2, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 361 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 356 ConstructedInterpolants, 0 QuantifiedInterpolants, 758 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 900/900 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: 69]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) RESULT: Ultimate proved your program to be correct! [2024-11-10 08:20:07,033 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