./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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-78.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 9eace40a5bfc748d79d918840a33885e3923058b3c61ac895b0c4200f609a10f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:15:57,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:15:57,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:15:57,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:15:57,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:15:57,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:15:57,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:15:57,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:15:57,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:15:57,317 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:15:57,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:15:57,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:15:57,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:15:57,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:15:57,321 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:15:57,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:15:57,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:15:57,322 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:15:57,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:15:57,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:15:57,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:15:57,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:15:57,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:15:57,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:15:57,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:15:57,327 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:15:57,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:15:57,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:15:57,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:15:57,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:15:57,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:15:57,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:15:57,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:15:57,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:15:57,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:15:57,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:15:57,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:15:57,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:15:57,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:15:57,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:15:57,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:15:57,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:15:57,332 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 -> 9eace40a5bfc748d79d918840a33885e3923058b3c61ac895b0c4200f609a10f [2024-11-16 17:15:57,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:15:57,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:15:57,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:15:57,632 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:15:57,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:15:57,634 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-78.i [2024-11-16 17:15:59,153 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:15:59,352 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:15:59,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-78.i [2024-11-16 17:15:59,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237af3360/1e1bfb03ce914aeab6e913444b641f34/FLAG1d4f9e3af [2024-11-16 17:15:59,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237af3360/1e1bfb03ce914aeab6e913444b641f34 [2024-11-16 17:15:59,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:15:59,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:15:59,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:15:59,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:15:59,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:15:59,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:15:59" (1/1) ... [2024-11-16 17:15:59,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7798b11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:15:59, skipping insertion in model container [2024-11-16 17:15:59,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:15:59" (1/1) ... [2024-11-16 17:15:59,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:15:59,922 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-78.i[915,928] [2024-11-16 17:15:59,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:15:59,980 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:15:59,993 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-78.i[915,928] [2024-11-16 17:16:00,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:16:00,032 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:16:00,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:16:00 WrapperNode [2024-11-16 17:16:00,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:16:00,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:16:00,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:16:00,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:16:00,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:16:00" (1/1) ... [2024-11-16 17:16:00,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:16:00" (1/1) ... [2024-11-16 17:16:00,087 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 71 [2024-11-16 17:16:00,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:16:00,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:16:00,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:16:00,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:16:00,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:16:00" (1/1) ... [2024-11-16 17:16:00,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:16:00" (1/1) ... [2024-11-16 17:16:00,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:16:00" (1/1) ... [2024-11-16 17:16:00,133 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-16 17:16:00,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:16:00" (1/1) ... [2024-11-16 17:16:00,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:16:00" (1/1) ... [2024-11-16 17:16:00,142 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:16:00" (1/1) ... [2024-11-16 17:16:00,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:16:00" (1/1) ... [2024-11-16 17:16:00,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:16:00" (1/1) ... [2024-11-16 17:16:00,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:16:00" (1/1) ... [2024-11-16 17:16:00,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:16:00,155 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:16:00,156 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:16:00,156 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:16:00,157 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:16:00" (1/1) ... [2024-11-16 17:16:00,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:16:00,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:16:00,202 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-16 17:16:00,208 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-16 17:16:00,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:16:00,259 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:16:00,259 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:16:00,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:16:00,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:16:00,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:16:00,331 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:16:00,333 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:16:00,515 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 17:16:00,516 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:16:00,530 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:16:00,531 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:16:00,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:16:00 BoogieIcfgContainer [2024-11-16 17:16:00,531 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:16:00,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:16:00,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:16:00,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:16:00,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:15:59" (1/3) ... [2024-11-16 17:16:00,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b4e2d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:16:00, skipping insertion in model container [2024-11-16 17:16:00,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:16:00" (2/3) ... [2024-11-16 17:16:00,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b4e2d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:16:00, skipping insertion in model container [2024-11-16 17:16:00,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:16:00" (3/3) ... [2024-11-16 17:16:00,541 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-78.i [2024-11-16 17:16:00,559 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:16:00,559 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:16:00,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:16:00,633 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;@71d139d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:16:00,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:16:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 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-16 17:16:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 17:16:00,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:16:00,654 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] [2024-11-16 17:16:00,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:16:00,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:16:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash -253668580, now seen corresponding path program 1 times [2024-11-16 17:16:00,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:16:00,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418660713] [2024-11-16 17:16:00,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:16:00,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:16:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:00,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:16:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:00,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:16:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:00,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:16:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:00,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:16:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:00,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:16:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:00,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:16:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:00,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:16:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:00,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:16:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:00,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:16:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:00,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:16:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:00,975 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-16 17:16:00,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:16:00,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418660713] [2024-11-16 17:16:00,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418660713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:16:00,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:16:00,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:16:00,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016059082] [2024-11-16 17:16:00,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:16:00,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:16:00,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:16:01,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:16:01,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:16:01,016 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 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 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-16 17:16:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:16:01,034 INFO L93 Difference]: Finished difference Result 72 states and 113 transitions. [2024-11-16 17:16:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:16:01,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (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 67 [2024-11-16 17:16:01,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:16:01,042 INFO L225 Difference]: With dead ends: 72 [2024-11-16 17:16:01,043 INFO L226 Difference]: Without dead ends: 35 [2024-11-16 17:16:01,046 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-16 17:16:01,049 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:16:01,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:16:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-16 17:16:01,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-16 17:16:01,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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-16 17:16:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2024-11-16 17:16:01,089 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 67 [2024-11-16 17:16:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:16:01,090 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2024-11-16 17:16:01,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (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-16 17:16:01,090 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2024-11-16 17:16:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 17:16:01,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:16:01,094 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] [2024-11-16 17:16:01,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:16:01,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:16:01,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:16:01,095 INFO L85 PathProgramCache]: Analyzing trace with hash 858646140, now seen corresponding path program 1 times [2024-11-16 17:16:01,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:16:01,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918780830] [2024-11-16 17:16:01,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:16:01,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:16:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:01,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:16:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:01,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:16:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:01,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:16:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:01,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:16:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:01,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:16:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:01,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:16:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:01,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:16:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:01,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:16:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:01,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:16:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:01,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:16:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:01,761 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-16 17:16:01,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:16:01,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918780830] [2024-11-16 17:16:01,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918780830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:16:01,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:16:01,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 17:16:01,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106039416] [2024-11-16 17:16:01,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:16:01,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 17:16:01,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:16:01,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 17:16:01,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:16:01,767 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-16 17:16:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:16:01,881 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2024-11-16 17:16:01,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 17:16:01,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 67 [2024-11-16 17:16:01,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:16:01,883 INFO L225 Difference]: With dead ends: 45 [2024-11-16 17:16:01,883 INFO L226 Difference]: Without dead ends: 42 [2024-11-16 17:16:01,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:16:01,885 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:16:01,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 172 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:16:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-16 17:16:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-16 17:16:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-16 17:16:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-16 17:16:01,903 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 67 [2024-11-16 17:16:01,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:16:01,905 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-16 17:16:01,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-16 17:16:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-16 17:16:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-16 17:16:01,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:16:01,907 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] [2024-11-16 17:16:01,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:16:01,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:16:01,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:16:01,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1766267019, now seen corresponding path program 1 times [2024-11-16 17:16:01,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:16:01,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610289451] [2024-11-16 17:16:01,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:16:01,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:16:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:02,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:16:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:02,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:16:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:02,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:16:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:02,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:16:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:02,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:16:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:02,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:16:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:02,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:16:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:02,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:16:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:02,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:16:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:02,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:16:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:02,564 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-16 17:16:02,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:16:02,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610289451] [2024-11-16 17:16:02,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610289451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:16:02,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:16:02,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 17:16:02,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385280641] [2024-11-16 17:16:02,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:16:02,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 17:16:02,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:16:02,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 17:16:02,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:16:02,569 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (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-16 17:16:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:16:02,728 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2024-11-16 17:16:02,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 17:16:02,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (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 68 [2024-11-16 17:16:02,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:16:02,730 INFO L225 Difference]: With dead ends: 48 [2024-11-16 17:16:02,730 INFO L226 Difference]: Without dead ends: 45 [2024-11-16 17:16:02,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-16 17:16:02,731 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:16:02,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 207 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:16:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-16 17:16:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2024-11-16 17:16:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-16 17:16:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-16 17:16:02,746 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 68 [2024-11-16 17:16:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:16:02,747 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-16 17:16:02,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (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-16 17:16:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-16 17:16:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-16 17:16:02,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:16:02,748 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] [2024-11-16 17:16:02,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 17:16:02,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:16:02,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:16:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1670008860, now seen corresponding path program 1 times [2024-11-16 17:16:02,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:16:02,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999905947] [2024-11-16 17:16:02,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:16:02,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:16:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:16:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:16:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:16:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:16:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:16:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:16:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:16:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:16:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:16:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:16:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,066 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-16 17:16:03,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:16:03,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999905947] [2024-11-16 17:16:03,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999905947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:16:03,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:16:03,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 17:16:03,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887027375] [2024-11-16 17:16:03,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:16:03,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 17:16:03,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:16:03,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 17:16:03,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:16:03,071 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-16 17:16:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:16:03,188 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-11-16 17:16:03,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 17:16:03,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 69 [2024-11-16 17:16:03,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:16:03,189 INFO L225 Difference]: With dead ends: 53 [2024-11-16 17:16:03,192 INFO L226 Difference]: Without dead ends: 50 [2024-11-16 17:16:03,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:16:03,193 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 23 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:16:03,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 212 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:16:03,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-16 17:16:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2024-11-16 17:16:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-16 17:16:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-16 17:16:03,205 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 69 [2024-11-16 17:16:03,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:16:03,206 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-16 17:16:03,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-16 17:16:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-16 17:16:03,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-16 17:16:03,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:16:03,209 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] [2024-11-16 17:16:03,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 17:16:03,209 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:16:03,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:16:03,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1641379709, now seen corresponding path program 1 times [2024-11-16 17:16:03,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:16:03,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596030193] [2024-11-16 17:16:03,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:16:03,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:16:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:16:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:16:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:16:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:16:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:16:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:16:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:16:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:16:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:16:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:16:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:16:03,522 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-16 17:16:03,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:16:03,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596030193] [2024-11-16 17:16:03,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596030193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:16:03,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:16:03,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:16:03,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046953440] [2024-11-16 17:16:03,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:16:03,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:16:03,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:16:03,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:16:03,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:16:03,526 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (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-16 17:16:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:16:03,626 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2024-11-16 17:16:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 17:16:03,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (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 69 [2024-11-16 17:16:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:16:03,628 INFO L225 Difference]: With dead ends: 49 [2024-11-16 17:16:03,628 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 17:16:03,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:16:03,630 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 16 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:16:03,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 174 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:16:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 17:16:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 17:16:03,634 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-16 17:16:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 17:16:03,634 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2024-11-16 17:16:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:16:03,634 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 17:16:03,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (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-16 17:16:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 17:16:03,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 17:16:03,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:16:03,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 17:16:03,646 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 17:16:03,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 17:16:03,670 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:16:03,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:16:03 BoogieIcfgContainer [2024-11-16 17:16:03,692 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:16:03,692 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:16:03,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:16:03,693 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:16:03,693 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:16:00" (3/4) ... [2024-11-16 17:16:03,697 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 17:16:03,701 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-16 17:16:03,706 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-16 17:16:03,706 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-16 17:16:03,707 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 17:16:03,707 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 17:16:03,799 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 17:16:03,800 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 17:16:03,800 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:16:03,800 INFO L158 Benchmark]: Toolchain (without parser) took 4067.83ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 97.2MB in the beginning and 64.2MB in the end (delta: 33.1MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2024-11-16 17:16:03,801 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 153.1MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:16:03,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.71ms. Allocated memory is still 153.1MB. Free memory was 97.2MB in the beginning and 83.4MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 17:16:03,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.48ms. Allocated memory is still 153.1MB. Free memory was 83.4MB in the beginning and 81.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:16:03,801 INFO L158 Benchmark]: Boogie Preprocessor took 64.86ms. Allocated memory is still 153.1MB. Free memory was 81.3MB in the beginning and 79.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:16:03,802 INFO L158 Benchmark]: IcfgBuilder took 375.91ms. Allocated memory is still 153.1MB. Free memory was 79.2MB in the beginning and 65.8MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 17:16:03,802 INFO L158 Benchmark]: TraceAbstraction took 3158.23ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 65.4MB in the beginning and 68.4MB in the end (delta: -2.9MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2024-11-16 17:16:03,802 INFO L158 Benchmark]: Witness Printer took 107.39ms. Allocated memory is still 205.5MB. Free memory was 68.4MB in the beginning and 64.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 17:16:03,804 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.25ms. Allocated memory is still 153.1MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.71ms. Allocated memory is still 153.1MB. Free memory was 97.2MB in the beginning and 83.4MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.48ms. Allocated memory is still 153.1MB. Free memory was 83.4MB in the beginning and 81.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.86ms. Allocated memory is still 153.1MB. Free memory was 81.3MB in the beginning and 79.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 375.91ms. Allocated memory is still 153.1MB. Free memory was 79.2MB in the beginning and 65.8MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3158.23ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 65.4MB in the beginning and 68.4MB in the end (delta: -2.9MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * Witness Printer took 107.39ms. Allocated memory is still 205.5MB. Free memory was 68.4MB in the beginning and 64.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.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, 59 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 812 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 577 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169 IncrementalHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 235 mSDtfsCounter, 169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 27, 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, 23 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 340 NumberOfCodeBlocks, 340 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 575 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: 70]: 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-16 17:16:03,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE