./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-7.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-7.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 1be8a8a6d13dc0dcec2623cb0b1ac309ae347ca2d7834f41920d636b33bcc8f1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:15:29,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:15:29,704 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:29,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:15:29,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:15:29,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:15:29,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:15:29,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:15:29,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:15:29,745 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:15:29,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:15:29,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:15:29,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:15:29,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:15:29,749 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:15:29,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:15:29,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:15:29,750 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:15:29,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:15:29,751 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:15:29,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:15:29,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:15:29,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:15:29,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:15:29,755 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:15:29,756 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:15:29,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:15:29,756 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:15:29,756 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:15:29,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:15:29,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:15:29,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:15:29,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:15:29,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:15:29,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:15:29,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:15:29,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:15:29,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:15:29,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:15:29,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:15:29,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:15:29,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:15:29,760 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 -> 1be8a8a6d13dc0dcec2623cb0b1ac309ae347ca2d7834f41920d636b33bcc8f1 [2024-11-16 17:15:30,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:15:30,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:15:30,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:15:30,031 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:15:30,032 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:15:30,033 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-7.i [2024-11-16 17:15:31,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:15:31,665 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:15:31,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-7.i [2024-11-16 17:15:31,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2035dbc5d/3323e6b53c0e41629660ba96e3ef7879/FLAGe5acc1627 [2024-11-16 17:15:32,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2035dbc5d/3323e6b53c0e41629660ba96e3ef7879 [2024-11-16 17:15:32,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:15:32,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:15:32,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:15:32,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:15:32,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:15:32,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:15:32" (1/1) ... [2024-11-16 17:15:32,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ce6113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:15:32, skipping insertion in model container [2024-11-16 17:15:32,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:15:32" (1/1) ... [2024-11-16 17:15:32,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:15:32,244 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-7.i[914,927] [2024-11-16 17:15:32,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:15:32,280 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:15:32,292 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-7.i[914,927] [2024-11-16 17:15:32,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:15:32,335 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:15:32,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:15:32 WrapperNode [2024-11-16 17:15:32,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:15:32,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:15:32,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:15:32,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:15:32,345 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:15:32" (1/1) ... [2024-11-16 17:15:32,352 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:15:32" (1/1) ... [2024-11-16 17:15:32,374 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-11-16 17:15:32,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:15:32,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:15:32,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:15:32,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:15:32,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:15:32" (1/1) ... [2024-11-16 17:15:32,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:15:32" (1/1) ... [2024-11-16 17:15:32,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:15:32" (1/1) ... [2024-11-16 17:15:32,401 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:15:32,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:15:32" (1/1) ... [2024-11-16 17:15:32,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:15:32" (1/1) ... [2024-11-16 17:15:32,406 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:15:32" (1/1) ... [2024-11-16 17:15:32,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:15:32" (1/1) ... [2024-11-16 17:15:32,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:15:32" (1/1) ... [2024-11-16 17:15:32,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:15:32" (1/1) ... [2024-11-16 17:15:32,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:15:32,414 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:15:32,414 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:15:32,414 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:15:32,415 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:15:32" (1/1) ... [2024-11-16 17:15:32,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:15:32,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:15:32,457 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:15:32,460 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:15:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:15:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:15:32,504 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:15:32,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:15:32,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:15:32,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:15:32,575 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:15:32,578 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:15:32,809 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 17:15:32,810 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:15:32,828 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:15:32,829 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:15:32,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:15:32 BoogieIcfgContainer [2024-11-16 17:15:32,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:15:32,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:15:32,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:15:32,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:15:32,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:15:32" (1/3) ... [2024-11-16 17:15:32,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337f8915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:15:32, skipping insertion in model container [2024-11-16 17:15:32,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:15:32" (2/3) ... [2024-11-16 17:15:32,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337f8915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:15:32, skipping insertion in model container [2024-11-16 17:15:32,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:15:32" (3/3) ... [2024-11-16 17:15:32,838 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-7.i [2024-11-16 17:15:32,851 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:15:32,851 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:15:32,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:15:32,906 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;@3940173b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:15:32,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:15:32,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 17:15:32,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 17:15:32,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:15:32,920 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:15:32,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:15:32,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:15:32,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1066951841, now seen corresponding path program 1 times [2024-11-16 17:15:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:15:32,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900972861] [2024-11-16 17:15:32,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:15:32,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:15:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:15:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:15:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:15:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:15:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:15:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:15:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 17:15:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:15:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 17:15:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 17:15:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 17:15:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 17:15:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 17:15:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 17:15:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:15:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 17:15:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 17:15:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 17:15:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 17:15:33,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:15:33,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900972861] [2024-11-16 17:15:33,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900972861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:15:33,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:15:33,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:15:33,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789857455] [2024-11-16 17:15:33,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:15:33,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:15:33,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:15:33,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:15:33,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:15:33,308 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 17:15:33,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:15:33,332 INFO L93 Difference]: Finished difference Result 92 states and 155 transitions. [2024-11-16 17:15:33,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:15:33,334 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 110 [2024-11-16 17:15:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:15:33,340 INFO L225 Difference]: With dead ends: 92 [2024-11-16 17:15:33,340 INFO L226 Difference]: Without dead ends: 45 [2024-11-16 17:15:33,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:15:33,347 INFO L432 NwaCegarLoop]: 64 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, 64 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:15:33,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:15:33,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-16 17:15:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-16 17:15:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 17:15:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2024-11-16 17:15:33,399 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 110 [2024-11-16 17:15:33,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:15:33,400 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2024-11-16 17:15:33,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 17:15:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2024-11-16 17:15:33,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 17:15:33,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:15:33,405 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:15:33,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:15:33,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:15:33,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:15:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1319702815, now seen corresponding path program 1 times [2024-11-16 17:15:33,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:15:33,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953470001] [2024-11-16 17:15:33,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:15:33,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:15:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:15:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:15:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:15:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:15:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:15:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:15:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 17:15:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:15:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 17:15:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 17:15:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 17:15:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 17:15:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 17:15:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 17:15:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:15:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 17:15:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 17:15:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 17:15:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 17:15:34,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:15:34,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953470001] [2024-11-16 17:15:34,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953470001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:15:34,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:15:34,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:15:34,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360383507] [2024-11-16 17:15:34,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:15:34,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:15:34,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:15:34,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:15:34,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:15:34,501 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 17:15:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:15:34,786 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2024-11-16 17:15:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 17:15:34,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 110 [2024-11-16 17:15:34,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:15:34,790 INFO L225 Difference]: With dead ends: 55 [2024-11-16 17:15:34,792 INFO L226 Difference]: Without dead ends: 52 [2024-11-16 17:15:34,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:15:34,793 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 6 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:15:34,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 291 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:15:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-16 17:15:34,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2024-11-16 17:15:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 17:15:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2024-11-16 17:15:34,810 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 110 [2024-11-16 17:15:34,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:15:34,813 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2024-11-16 17:15:34,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 17:15:34,814 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2024-11-16 17:15:34,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 17:15:34,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:15:34,816 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:15:34,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:15:34,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:15:34,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:15:34,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1120845240, now seen corresponding path program 1 times [2024-11-16 17:15:34,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:15:34,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250459472] [2024-11-16 17:15:34,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:15:34,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:15:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:35,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:15:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:35,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:15:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:35,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:15:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:35,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:15:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:35,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:15:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:35,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:15:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:35,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 17:15:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:35,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:15:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:35,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 17:15:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:35,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 17:15:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:35,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 17:15:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:35,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 17:15:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:36,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 17:15:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:36,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 17:15:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:15:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:36,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 17:15:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:36,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 17:15:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:36,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 17:15:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 17:15:36,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:15:36,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250459472] [2024-11-16 17:15:36,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250459472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:15:36,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:15:36,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 17:15:36,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867935815] [2024-11-16 17:15:36,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:15:36,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 17:15:36,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:15:36,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 17:15:36,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:15:36,026 INFO L87 Difference]: Start difference. First operand 48 states and 67 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 17:15:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:15:36,665 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2024-11-16 17:15:36,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 17:15:36,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2024-11-16 17:15:36,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:15:36,668 INFO L225 Difference]: With dead ends: 58 [2024-11-16 17:15:36,668 INFO L226 Difference]: Without dead ends: 55 [2024-11-16 17:15:36,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:15:36,670 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 8 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 17:15:36,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 323 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 17:15:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-16 17:15:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2024-11-16 17:15:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 17:15:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2024-11-16 17:15:36,684 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 111 [2024-11-16 17:15:36,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:15:36,685 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2024-11-16 17:15:36,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 17:15:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2024-11-16 17:15:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 17:15:36,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:15:36,687 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:15:36,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 17:15:36,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:15:36,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:15:36,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1092216089, now seen corresponding path program 1 times [2024-11-16 17:15:36,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:15:36,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568194854] [2024-11-16 17:15:36,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:15:36,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:15:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:15:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:15:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:15:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:15:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:15:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:15:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 17:15:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:15:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 17:15:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 17:15:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 17:15:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 17:15:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 17:15:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 17:15:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:15:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 17:15:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 17:15:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 17:15:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:15:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 17:15:37,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:15:37,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568194854] [2024-11-16 17:15:37,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568194854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:15:37,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:15:37,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 17:15:37,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53502504] [2024-11-16 17:15:37,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:15:37,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 17:15:37,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:15:37,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 17:15:37,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:15:37,423 INFO L87 Difference]: Start difference. First operand 48 states and 67 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 17:15:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:15:38,112 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2024-11-16 17:15:38,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 17:15:38,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2024-11-16 17:15:38,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:15:38,115 INFO L225 Difference]: With dead ends: 52 [2024-11-16 17:15:38,115 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 17:15:38,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:15:38,116 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 6 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 17:15:38,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 321 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 17:15:38,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 17:15:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 17:15:38,118 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:15:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 17:15:38,118 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2024-11-16 17:15:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:15:38,118 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 17:15:38,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 17:15:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 17:15:38,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 17:15:38,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:15:38,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 17:15:38,125 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-16 17:15:38,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 17:15:38,156 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:15:38,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:15:38 BoogieIcfgContainer [2024-11-16 17:15:38,179 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:15:38,179 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:15:38,179 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:15:38,180 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:15:38,180 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:15:32" (3/4) ... [2024-11-16 17:15:38,182 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 17:15:38,186 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-16 17:15:38,190 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-16 17:15:38,191 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-16 17:15:38,191 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 17:15:38,191 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 17:15:38,285 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 17:15:38,286 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 17:15:38,286 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:15:38,286 INFO L158 Benchmark]: Toolchain (without parser) took 6264.01ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 97.0MB in the beginning and 94.9MB in the end (delta: 2.1MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. [2024-11-16 17:15:38,287 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 165.7MB. Free memory was 133.5MB in the beginning and 133.4MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:15:38,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.61ms. Allocated memory is still 165.7MB. Free memory was 96.5MB in the beginning and 132.3MB in the end (delta: -35.8MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-11-16 17:15:38,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.81ms. Allocated memory is still 165.7MB. Free memory was 132.3MB in the beginning and 130.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:15:38,287 INFO L158 Benchmark]: Boogie Preprocessor took 35.78ms. Allocated memory is still 165.7MB. Free memory was 130.2MB in the beginning and 128.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:15:38,288 INFO L158 Benchmark]: IcfgBuilder took 417.23ms. Allocated memory is still 165.7MB. Free memory was 128.1MB in the beginning and 113.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 17:15:38,288 INFO L158 Benchmark]: TraceAbstraction took 5346.18ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 112.6MB in the beginning and 100.1MB in the end (delta: 12.5MB). Peak memory consumption was 86.7MB. Max. memory is 16.1GB. [2024-11-16 17:15:38,288 INFO L158 Benchmark]: Witness Printer took 106.49ms. Allocated memory is still 239.1MB. Free memory was 100.1MB in the beginning and 94.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 17:15:38,289 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.21ms. Allocated memory is still 165.7MB. Free memory was 133.5MB in the beginning and 133.4MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.61ms. Allocated memory is still 165.7MB. Free memory was 96.5MB in the beginning and 132.3MB in the end (delta: -35.8MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.81ms. Allocated memory is still 165.7MB. Free memory was 132.3MB in the beginning and 130.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.78ms. Allocated memory is still 165.7MB. Free memory was 130.2MB in the beginning and 128.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 417.23ms. Allocated memory is still 165.7MB. Free memory was 128.1MB in the beginning and 113.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5346.18ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 112.6MB in the beginning and 100.1MB in the end (delta: 12.5MB). Peak memory consumption was 86.7MB. Max. memory is 16.1GB. * Witness Printer took 106.49ms. Allocated memory is still 239.1MB. Free memory was 100.1MB in the beginning and 94.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 999 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 751 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 248 mSDtfsCounter, 189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, 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, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 442 NumberOfCodeBlocks, 442 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 438 ConstructedInterpolants, 0 QuantifiedInterpolants, 1099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2448/2448 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: 83]: 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))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) RESULT: Ultimate proved your program to be correct! [2024-11-16 17:15:38,324 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